flb_config_map.c:flb_env_warn_unused: 34| 23.8k|{ 35| 23.8k| env->warn_unused = warn; 36| 23.8k|} flb_log.c:flb_log_check: 102| 484|static inline int flb_log_check(int l) { 103| 484| struct flb_worker *w; 104| 484| w = (struct flb_worker *) FLB_TLS_GET(flb_worker_ctx); ------------------ | | 34| 484|#define FLB_TLS_GET(key) key ------------------ 105| 484| if (!w && l <= 3) { ------------------ | Branch (105:9): [True: 484, False: 0] | Branch (105:15): [True: 484, False: 0] ------------------ 106| 484| return FLB_TRUE; ------------------ | | 26| 484|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 484|#define FLB_FALSE 0 | | ------------------ ------------------ 107| 484| } 108| | 109| 0| if (w == NULL || flb_worker_log_level(w) < l) { ------------------ | Branch (109:9): [True: 0, False: 0] | Branch (109:22): [True: 0, False: 0] ------------------ 110| 0| return FLB_FALSE; ------------------ | | 25| 0|#define FLB_FALSE 0 ------------------ 111| 0| } 112| 0| return FLB_TRUE; ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ 113| 0|} flb_config.c:flb_log_check: 102| 310|static inline int flb_log_check(int l) { 103| 310| struct flb_worker *w; 104| 310| w = (struct flb_worker *) FLB_TLS_GET(flb_worker_ctx); ------------------ | | 34| 310|#define FLB_TLS_GET(key) key ------------------ 105| 310| if (!w && l <= 3) { ------------------ | Branch (105:9): [True: 310, False: 0] | Branch (105:15): [True: 310, False: 0] ------------------ 106| 310| return FLB_TRUE; ------------------ | | 26| 310|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 310|#define FLB_FALSE 0 | | ------------------ ------------------ 107| 310| } 108| | 109| 0| if (w == NULL || flb_worker_log_level(w) < l) { ------------------ | Branch (109:9): [True: 0, False: 0] | Branch (109:22): [True: 0, False: 0] ------------------ 110| 0| return FLB_FALSE; ------------------ | | 25| 0|#define FLB_FALSE 0 ------------------ 111| 0| } 112| 0| return FLB_TRUE; ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ 113| 0|} flb_config_map.c:flb_log_check: 102| 1.26k|static inline int flb_log_check(int l) { 103| 1.26k| struct flb_worker *w; 104| 1.26k| w = (struct flb_worker *) FLB_TLS_GET(flb_worker_ctx); ------------------ | | 34| 1.26k|#define FLB_TLS_GET(key) key ------------------ 105| 1.26k| if (!w && l <= 3) { ------------------ | Branch (105:9): [True: 1.26k, False: 0] | Branch (105:15): [True: 1.26k, False: 0] ------------------ 106| 1.26k| return FLB_TRUE; ------------------ | | 26| 1.26k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 1.26k|#define FLB_FALSE 0 | | ------------------ ------------------ 107| 1.26k| } 108| | 109| 0| if (w == NULL || flb_worker_log_level(w) < l) { ------------------ | Branch (109:9): [True: 0, False: 0] | Branch (109:22): [True: 0, False: 0] ------------------ 110| 0| return FLB_FALSE; ------------------ | | 25| 0|#define FLB_FALSE 0 ------------------ 111| 0| } 112| 0| return FLB_TRUE; ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ 113| 0|} flb_parser.c:flb_log_check: 102| 11|static inline int flb_log_check(int l) { 103| 11| struct flb_worker *w; 104| 11| w = (struct flb_worker *) FLB_TLS_GET(flb_worker_ctx); ------------------ | | 34| 11|#define FLB_TLS_GET(key) key ------------------ 105| 11| if (!w && l <= 3) { ------------------ | Branch (105:9): [True: 11, False: 0] | Branch (105:15): [True: 11, False: 0] ------------------ 106| 11| return FLB_TRUE; ------------------ | | 26| 11|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 11|#define FLB_FALSE 0 | | ------------------ ------------------ 107| 11| } 108| | 109| 0| if (w == NULL || flb_worker_log_level(w) < l) { ------------------ | Branch (109:9): [True: 0, False: 0] | Branch (109:22): [True: 0, False: 0] ------------------ 110| 0| return FLB_FALSE; ------------------ | | 25| 0|#define FLB_FALSE 0 ------------------ 111| 0| } 112| 0| return FLB_TRUE; ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ 113| 0|} flb_ml_parser.c:flb_log_check: 102| 204|static inline int flb_log_check(int l) { 103| 204| struct flb_worker *w; 104| 204| w = (struct flb_worker *) FLB_TLS_GET(flb_worker_ctx); ------------------ | | 34| 204|#define FLB_TLS_GET(key) key ------------------ 105| 204| if (!w && l <= 3) { ------------------ | Branch (105:9): [True: 204, False: 0] | Branch (105:15): [True: 204, False: 0] ------------------ 106| 204| return FLB_TRUE; ------------------ | | 26| 204|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 204|#define FLB_FALSE 0 | | ------------------ ------------------ 107| 204| } 108| | 109| 0| if (w == NULL || flb_worker_log_level(w) < l) { ------------------ | Branch (109:9): [True: 0, False: 0] | Branch (109:22): [True: 0, False: 0] ------------------ 110| 0| return FLB_FALSE; ------------------ | | 25| 0|#define FLB_FALSE 0 ------------------ 111| 0| } 112| 0| return FLB_TRUE; ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ 113| 0|} flb_ml_rule.c:flb_log_check: 102| 55|static inline int flb_log_check(int l) { 103| 55| struct flb_worker *w; 104| 55| w = (struct flb_worker *) FLB_TLS_GET(flb_worker_ctx); ------------------ | | 34| 55|#define FLB_TLS_GET(key) key ------------------ 105| 55| if (!w && l <= 3) { ------------------ | Branch (105:9): [True: 55, False: 0] | Branch (105:15): [True: 55, False: 0] ------------------ 106| 55| return FLB_TRUE; ------------------ | | 26| 55|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 55|#define FLB_FALSE 0 | | ------------------ ------------------ 107| 55| } 108| | 109| 0| if (w == NULL || flb_worker_log_level(w) < l) { ------------------ | Branch (109:9): [True: 0, False: 0] | Branch (109:22): [True: 0, False: 0] ------------------ 110| 0| return FLB_FALSE; ------------------ | | 25| 0|#define FLB_FALSE 0 ------------------ 111| 0| } 112| 0| return FLB_TRUE; ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ 113| 0|} flb_ml_parser_cri.c:flb_log_check: 102| 6|static inline int flb_log_check(int l) { 103| 6| struct flb_worker *w; 104| 6| w = (struct flb_worker *) FLB_TLS_GET(flb_worker_ctx); ------------------ | | 34| 6|#define FLB_TLS_GET(key) key ------------------ 105| 6| if (!w && l <= 3) { ------------------ | Branch (105:9): [True: 6, False: 0] | Branch (105:15): [True: 6, False: 0] ------------------ 106| 6| return FLB_TRUE; ------------------ | | 26| 6|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 6|#define FLB_FALSE 0 | | ------------------ ------------------ 107| 6| } 108| | 109| 0| if (w == NULL || flb_worker_log_level(w) < l) { ------------------ | Branch (109:9): [True: 0, False: 0] | Branch (109:22): [True: 0, False: 0] ------------------ 110| 0| return FLB_FALSE; ------------------ | | 25| 0|#define FLB_FALSE 0 ------------------ 111| 0| } 112| 0| return FLB_TRUE; ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ 113| 0|} flb_ml_parser_docker.c:flb_log_check: 102| 5|static inline int flb_log_check(int l) { 103| 5| struct flb_worker *w; 104| 5| w = (struct flb_worker *) FLB_TLS_GET(flb_worker_ctx); ------------------ | | 34| 5|#define FLB_TLS_GET(key) key ------------------ 105| 5| if (!w && l <= 3) { ------------------ | Branch (105:9): [True: 5, False: 0] | Branch (105:15): [True: 5, False: 0] ------------------ 106| 5| return FLB_TRUE; ------------------ | | 26| 5|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 5|#define FLB_FALSE 0 | | ------------------ ------------------ 107| 5| } 108| | 109| 0| if (w == NULL || flb_worker_log_level(w) < l) { ------------------ | Branch (109:9): [True: 0, False: 0] | Branch (109:22): [True: 0, False: 0] ------------------ 110| 0| return FLB_FALSE; ------------------ | | 25| 0|#define FLB_FALSE 0 ------------------ 111| 0| } 112| 0| return FLB_TRUE; ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ 113| 0|} flb_ml_parser_python.c:flb_log_check: 102| 29|static inline int flb_log_check(int l) { 103| 29| struct flb_worker *w; 104| 29| w = (struct flb_worker *) FLB_TLS_GET(flb_worker_ctx); ------------------ | | 34| 29|#define FLB_TLS_GET(key) key ------------------ 105| 29| if (!w && l <= 3) { ------------------ | Branch (105:9): [True: 29, False: 0] | Branch (105:15): [True: 29, False: 0] ------------------ 106| 29| return FLB_TRUE; ------------------ | | 26| 29|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 29|#define FLB_FALSE 0 | | ------------------ ------------------ 107| 29| } 108| | 109| 0| if (w == NULL || flb_worker_log_level(w) < l) { ------------------ | Branch (109:9): [True: 0, False: 0] | Branch (109:22): [True: 0, False: 0] ------------------ 110| 0| return FLB_FALSE; ------------------ | | 25| 0|#define FLB_FALSE 0 ------------------ 111| 0| } 112| 0| return FLB_TRUE; ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ 113| 0|} flb_ml_parser_java.c:flb_log_check: 102| 86|static inline int flb_log_check(int l) { 103| 86| struct flb_worker *w; 104| 86| w = (struct flb_worker *) FLB_TLS_GET(flb_worker_ctx); ------------------ | | 34| 86|#define FLB_TLS_GET(key) key ------------------ 105| 86| if (!w && l <= 3) { ------------------ | Branch (105:9): [True: 86, False: 0] | Branch (105:15): [True: 86, False: 0] ------------------ 106| 86| return FLB_TRUE; ------------------ | | 26| 86|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 86|#define FLB_FALSE 0 | | ------------------ ------------------ 107| 86| } 108| | 109| 0| if (w == NULL || flb_worker_log_level(w) < l) { ------------------ | Branch (109:9): [True: 0, False: 0] | Branch (109:22): [True: 0, False: 0] ------------------ 110| 0| return FLB_FALSE; ------------------ | | 25| 0|#define FLB_FALSE 0 ------------------ 111| 0| } 112| 0| return FLB_TRUE; ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ 113| 0|} flb_ml_parser_go.c:flb_log_check: 102| 48|static inline int flb_log_check(int l) { 103| 48| struct flb_worker *w; 104| 48| w = (struct flb_worker *) FLB_TLS_GET(flb_worker_ctx); ------------------ | | 34| 48|#define FLB_TLS_GET(key) key ------------------ 105| 48| if (!w && l <= 3) { ------------------ | Branch (105:9): [True: 48, False: 0] | Branch (105:15): [True: 48, False: 0] ------------------ 106| 48| return FLB_TRUE; ------------------ | | 26| 48|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 48|#define FLB_FALSE 0 | | ------------------ ------------------ 107| 48| } 108| | 109| 0| if (w == NULL || flb_worker_log_level(w) < l) { ------------------ | Branch (109:9): [True: 0, False: 0] | Branch (109:22): [True: 0, False: 0] ------------------ 110| 0| return FLB_FALSE; ------------------ | | 25| 0|#define FLB_FALSE 0 ------------------ 111| 0| } 112| 0| return FLB_TRUE; ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ 113| 0|} flb_ml_parser_ruby.c:flb_log_check: 102| 15|static inline int flb_log_check(int l) { 103| 15| struct flb_worker *w; 104| 15| w = (struct flb_worker *) FLB_TLS_GET(flb_worker_ctx); ------------------ | | 34| 15|#define FLB_TLS_GET(key) key ------------------ 105| 15| if (!w && l <= 3) { ------------------ | Branch (105:9): [True: 15, False: 0] | Branch (105:15): [True: 15, False: 0] ------------------ 106| 15| return FLB_TRUE; ------------------ | | 26| 15|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 15|#define FLB_FALSE 0 | | ------------------ ------------------ 107| 15| } 108| | 109| 0| if (w == NULL || flb_worker_log_level(w) < l) { ------------------ | Branch (109:9): [True: 0, False: 0] | Branch (109:22): [True: 0, False: 0] ------------------ 110| 0| return FLB_FALSE; ------------------ | | 25| 0|#define FLB_FALSE 0 ------------------ 111| 0| } 112| 0| return FLB_TRUE; ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ 113| 0|} config_map_fuzzer.c:flb_malloc: 67| 3.09k|void *flb_malloc(const size_t size) { 68| | 69| 3.09k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 70| | // 1% chance of failure 71| 3.09k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (71:8): [True: 11, False: 3.07k] ------------------ 72| 11| return NULL; 73| 11| } 74| 3.07k|#endif 75| | 76| 3.07k| if (size == 0) { ------------------ | Branch (76:9): [True: 0, False: 3.07k] ------------------ 77| 0| return NULL; 78| 0| } 79| | 80| 3.07k| return malloc(size); 81| 3.07k|} config_map_fuzzer.c:flb_fuzz_get_probability: 56| 3.09k|static inline int flb_fuzz_get_probability(int val) { 57| 3.09k| flb_malloc_p += 1; 58| 3.09k| flb_malloc_p = flb_malloc_p % flb_malloc_mod; 59| 3.09k| if (val > flb_malloc_p) { ------------------ | Branch (59:7): [True: 11, False: 3.07k] ------------------ 60| 11| return 1; 61| 11| } 62| 3.07k| return 0; 63| 3.09k|} config_map_fuzzer.c:flb_free: 126| 3.09k|static inline void flb_free(void *ptr) { 127| 3.09k| free(ptr); 128| 3.09k|} flb_kv.c:flb_calloc: 84| 1.73k|void *flb_calloc(size_t n, const size_t size) { 85| 1.73k| if (size == 0) { ------------------ | Branch (85:9): [True: 0, False: 1.73k] ------------------ 86| 0| return NULL; 87| 0| } 88| 1.73k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 89| | // Add chance of failure. Used by fuzzing to test error-handling code. 90| 1.73k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (90:8): [True: 1, False: 1.73k] ------------------ 91| 1| return NULL; 92| 1| } 93| 1.73k|#endif 94| | 95| 1.73k| return calloc(n, size); 96| 1.73k|} flb_kv.c:flb_fuzz_get_probability: 56| 1.73k|static inline int flb_fuzz_get_probability(int val) { 57| 1.73k| flb_malloc_p += 1; 58| 1.73k| flb_malloc_p = flb_malloc_p % flb_malloc_mod; 59| 1.73k| if (val > flb_malloc_p) { ------------------ | Branch (59:7): [True: 1, False: 1.73k] ------------------ 60| 1| return 1; 61| 1| } 62| 1.73k| return 0; 63| 1.73k|} flb_kv.c:flb_free: 126| 1.73k|static inline void flb_free(void *ptr) { 127| 1.73k| free(ptr); 128| 1.73k|} flb_sds.c:flb_malloc: 67| 196k|void *flb_malloc(const size_t size) { 68| | 69| 196k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 70| | // 1% chance of failure 71| 196k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (71:8): [True: 167, False: 195k] ------------------ 72| 167| return NULL; 73| 167| } 74| 195k|#endif 75| | 76| 195k| if (size == 0) { ------------------ | Branch (76:9): [True: 0, False: 195k] ------------------ 77| 0| return NULL; 78| 0| } 79| | 80| 195k| return malloc(size); 81| 195k|} flb_sds.c:flb_fuzz_get_probability: 56| 196k|static inline int flb_fuzz_get_probability(int val) { 57| 196k| flb_malloc_p += 1; 58| 196k| flb_malloc_p = flb_malloc_p % flb_malloc_mod; 59| 196k| if (val > flb_malloc_p) { ------------------ | Branch (59:7): [True: 167, False: 195k] ------------------ 60| 167| return 1; 61| 167| } 62| 195k| return 0; 63| 196k|} flb_sds.c:flb_free: 126| 195k|static inline void flb_free(void *ptr) { 127| 195k| free(ptr); 128| 195k|} flb_config.c:flb_malloc: 67| 109k|void *flb_malloc(const size_t size) { 68| | 69| 109k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 70| | // 1% chance of failure 71| 109k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (71:8): [True: 102, False: 109k] ------------------ 72| 102| return NULL; 73| 102| } 74| 109k|#endif 75| | 76| 109k| if (size == 0) { ------------------ | Branch (76:9): [True: 0, False: 109k] ------------------ 77| 0| return NULL; 78| 0| } 79| | 80| 109k| return malloc(size); 81| 109k|} flb_config.c:flb_fuzz_get_probability: 56| 111k|static inline int flb_fuzz_get_probability(int val) { 57| 111k| flb_malloc_p += 1; 58| 111k| flb_malloc_p = flb_malloc_p % flb_malloc_mod; 59| 111k| if (val > flb_malloc_p) { ------------------ | Branch (59:7): [True: 112, False: 111k] ------------------ 60| 112| return 1; 61| 112| } 62| 111k| return 0; 63| 111k|} flb_config.c:flb_free: 126| 115k|static inline void flb_free(void *ptr) { 127| 115k| free(ptr); 128| 115k|} flb_config.c:flb_calloc: 84| 2.06k|void *flb_calloc(size_t n, const size_t size) { 85| 2.06k| if (size == 0) { ------------------ | Branch (85:9): [True: 0, False: 2.06k] ------------------ 86| 0| return NULL; 87| 0| } 88| 2.06k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 89| | // Add chance of failure. Used by fuzzing to test error-handling code. 90| 2.06k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (90:8): [True: 10, False: 2.05k] ------------------ 91| 10| return NULL; 92| 10| } 93| 2.05k|#endif 94| | 95| 2.05k| return calloc(n, size); 96| 2.06k|} flb_config_map.c:flb_malloc: 67| 10.4k|void *flb_malloc(const size_t size) { 68| | 69| 10.4k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 70| | // 1% chance of failure 71| 10.4k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (71:8): [True: 7, False: 10.4k] ------------------ 72| 7| return NULL; 73| 7| } 74| 10.4k|#endif 75| | 76| 10.4k| if (size == 0) { ------------------ | Branch (76:9): [True: 0, False: 10.4k] ------------------ 77| 0| return NULL; 78| 0| } 79| | 80| 10.4k| return malloc(size); 81| 10.4k|} flb_config_map.c:flb_fuzz_get_probability: 56| 27.8k|static inline int flb_fuzz_get_probability(int val) { 57| 27.8k| flb_malloc_p += 1; 58| 27.8k| flb_malloc_p = flb_malloc_p % flb_malloc_mod; 59| 27.8k| if (val > flb_malloc_p) { ------------------ | Branch (59:7): [True: 20, False: 27.7k] ------------------ 60| 20| return 1; 61| 20| } 62| 27.7k| return 0; 63| 27.8k|} flb_config_map.c:flb_calloc: 84| 17.3k|void *flb_calloc(size_t n, const size_t size) { 85| 17.3k| if (size == 0) { ------------------ | Branch (85:9): [True: 0, False: 17.3k] ------------------ 86| 0| return NULL; 87| 0| } 88| 17.3k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 89| | // Add chance of failure. Used by fuzzing to test error-handling code. 90| 17.3k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (90:8): [True: 13, False: 17.3k] ------------------ 91| 13| return NULL; 92| 13| } 93| 17.3k|#endif 94| | 95| 17.3k| return calloc(n, size); 96| 17.3k|} flb_config_map.c:flb_free: 126| 27.7k|static inline void flb_free(void *ptr) { 127| 27.7k| free(ptr); 128| 27.7k|} flb_slist.c:flb_malloc: 67| 95.3k|void *flb_malloc(const size_t size) { 68| | 69| 95.3k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 70| | // 1% chance of failure 71| 95.3k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (71:8): [True: 58, False: 95.3k] ------------------ 72| 58| return NULL; 73| 58| } 74| 95.3k|#endif 75| | 76| 95.3k| if (size == 0) { ------------------ | Branch (76:9): [True: 0, False: 95.3k] ------------------ 77| 0| return NULL; 78| 0| } 79| | 80| 95.3k| return malloc(size); 81| 95.3k|} flb_slist.c:flb_fuzz_get_probability: 56| 95.3k|static inline int flb_fuzz_get_probability(int val) { 57| 95.3k| flb_malloc_p += 1; 58| 95.3k| flb_malloc_p = flb_malloc_p % flb_malloc_mod; 59| 95.3k| if (val > flb_malloc_p) { ------------------ | Branch (59:7): [True: 58, False: 95.3k] ------------------ 60| 58| return 1; 61| 58| } 62| 95.3k| return 0; 63| 95.3k|} flb_slist.c:flb_free: 126| 95.0k|static inline void flb_free(void *ptr) { 127| 95.0k| free(ptr); 128| 95.0k|} flb_plugin.c:flb_malloc: 67| 1.73k|void *flb_malloc(const size_t size) { 68| | 69| 1.73k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 70| | // 1% chance of failure 71| 1.73k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (71:8): [True: 3, False: 1.73k] ------------------ 72| 3| return NULL; 73| 3| } 74| 1.73k|#endif 75| | 76| 1.73k| if (size == 0) { ------------------ | Branch (76:9): [True: 0, False: 1.73k] ------------------ 77| 0| return NULL; 78| 0| } 79| | 80| 1.73k| return malloc(size); 81| 1.73k|} flb_plugin.c:flb_fuzz_get_probability: 56| 1.73k|static inline int flb_fuzz_get_probability(int val) { 57| 1.73k| flb_malloc_p += 1; 58| 1.73k| flb_malloc_p = flb_malloc_p % flb_malloc_mod; 59| 1.73k| if (val > flb_malloc_p) { ------------------ | Branch (59:7): [True: 3, False: 1.73k] ------------------ 60| 3| return 1; 61| 3| } 62| 1.73k| return 0; 63| 1.73k|} flb_plugin.c:flb_free: 126| 1.73k|static inline void flb_free(void *ptr) { 127| 1.73k| free(ptr); 128| 1.73k|} flb_config_format.c:flb_calloc: 84| 2.05k|void *flb_calloc(size_t n, const size_t size) { 85| 2.05k| if (size == 0) { ------------------ | Branch (85:9): [True: 0, False: 2.05k] ------------------ 86| 0| return NULL; 87| 0| } 88| 2.05k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 89| | // Add chance of failure. Used by fuzzing to test error-handling code. 90| 2.05k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (90:8): [True: 2, False: 2.04k] ------------------ 91| 2| return NULL; 92| 2| } 93| 2.04k|#endif 94| | 95| 2.04k| return calloc(n, size); 96| 2.05k|} flb_config_format.c:flb_fuzz_get_probability: 56| 4.09k|static inline int flb_fuzz_get_probability(int val) { 57| 4.09k| flb_malloc_p += 1; 58| 4.09k| flb_malloc_p = flb_malloc_p % flb_malloc_mod; 59| 4.09k| if (val > flb_malloc_p) { ------------------ | Branch (59:7): [True: 5, False: 4.09k] ------------------ 60| 5| return 1; 61| 5| } 62| 4.09k| return 0; 63| 4.09k|} flb_config_format.c:flb_free: 126| 4.09k|static inline void flb_free(void *ptr) { 127| 4.09k| free(ptr); 128| 4.09k|} flb_config_format.c:flb_malloc: 67| 2.04k|void *flb_malloc(const size_t size) { 68| | 69| 2.04k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 70| | // 1% chance of failure 71| 2.04k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (71:8): [True: 3, False: 2.04k] ------------------ 72| 3| return NULL; 73| 3| } 74| 2.04k|#endif 75| | 76| 2.04k| if (size == 0) { ------------------ | Branch (76:9): [True: 0, False: 2.04k] ------------------ 77| 0| return NULL; 78| 0| } 79| | 80| 2.04k| return malloc(size); 81| 2.04k|} flb_parser.c:flb_calloc: 84| 4.05k|void *flb_calloc(size_t n, const size_t size) { 85| 4.05k| if (size == 0) { ------------------ | Branch (85:9): [True: 0, False: 4.05k] ------------------ 86| 0| return NULL; 87| 0| } 88| 4.05k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 89| | // Add chance of failure. Used by fuzzing to test error-handling code. 90| 4.05k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (90:8): [True: 4, False: 4.05k] ------------------ 91| 4| return NULL; 92| 4| } 93| 4.05k|#endif 94| | 95| 4.05k| return calloc(n, size); 96| 4.05k|} flb_parser.c:flb_fuzz_get_probability: 56| 22.2k|static inline int flb_fuzz_get_probability(int val) { 57| 22.2k| flb_malloc_p += 1; 58| 22.2k| flb_malloc_p = flb_malloc_p % flb_malloc_mod; 59| 22.2k| if (val > flb_malloc_p) { ------------------ | Branch (59:7): [True: 23, False: 22.2k] ------------------ 60| 23| return 1; 61| 23| } 62| 22.2k| return 0; 63| 22.2k|} flb_parser.c:flb_free: 126| 22.2k|static inline void flb_free(void *ptr) { 127| 22.2k| free(ptr); 128| 22.2k|} flb_parser.c:flb_malloc: 67| 18.1k|void *flb_malloc(const size_t size) { 68| | 69| 18.1k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 70| | // 1% chance of failure 71| 18.1k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (71:8): [True: 19, False: 18.1k] ------------------ 72| 19| return NULL; 73| 19| } 74| 18.1k|#endif 75| | 76| 18.1k| if (size == 0) { ------------------ | Branch (76:9): [True: 0, False: 18.1k] ------------------ 77| 0| return NULL; 78| 0| } 79| | 80| 18.1k| return malloc(size); 81| 18.1k|} flb_regex.c:flb_malloc: 67| 44.0k|void *flb_malloc(const size_t size) { 68| | 69| 44.0k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 70| | // 1% chance of failure 71| 44.0k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (71:8): [True: 25, False: 44.0k] ------------------ 72| 25| return NULL; 73| 25| } 74| 44.0k|#endif 75| | 76| 44.0k| if (size == 0) { ------------------ | Branch (76:9): [True: 0, False: 44.0k] ------------------ 77| 0| return NULL; 78| 0| } 79| | 80| 44.0k| return malloc(size); 81| 44.0k|} flb_regex.c:flb_fuzz_get_probability: 56| 44.0k|static inline int flb_fuzz_get_probability(int val) { 57| 44.0k| flb_malloc_p += 1; 58| 44.0k| flb_malloc_p = flb_malloc_p % flb_malloc_mod; 59| 44.0k| if (val > flb_malloc_p) { ------------------ | Branch (59:7): [True: 25, False: 44.0k] ------------------ 60| 25| return 1; 61| 25| } 62| 44.0k| return 0; 63| 44.0k|} flb_regex.c:flb_free: 126| 44.0k|static inline void flb_free(void *ptr) { 127| 44.0k| free(ptr); 128| 44.0k|} flb_env.c:flb_malloc: 67| 2.04k|void *flb_malloc(const size_t size) { 68| | 69| 2.04k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 70| | // 1% chance of failure 71| 2.04k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (71:8): [True: 1, False: 2.04k] ------------------ 72| 1| return NULL; 73| 1| } 74| 2.04k|#endif 75| | 76| 2.04k| if (size == 0) { ------------------ | Branch (76:9): [True: 0, False: 2.04k] ------------------ 77| 0| return NULL; 78| 0| } 79| | 80| 2.04k| return malloc(size); 81| 2.04k|} flb_env.c:flb_fuzz_get_probability: 56| 2.04k|static inline int flb_fuzz_get_probability(int val) { 57| 2.04k| flb_malloc_p += 1; 58| 2.04k| flb_malloc_p = flb_malloc_p % flb_malloc_mod; 59| 2.04k| if (val > flb_malloc_p) { ------------------ | Branch (59:7): [True: 1, False: 2.04k] ------------------ 60| 1| return 1; 61| 1| } 62| 2.04k| return 0; 63| 2.04k|} flb_env.c:flb_free: 126| 2.04k|static inline void flb_free(void *ptr) { 127| 2.04k| free(ptr); 128| 2.04k|} flb_hash_table.c:flb_malloc: 67| 2.04k|void *flb_malloc(const size_t size) { 68| | 69| 2.04k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 70| | // 1% chance of failure 71| 2.04k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (71:8): [True: 6, False: 2.03k] ------------------ 72| 6| return NULL; 73| 6| } 74| 2.03k|#endif 75| | 76| 2.03k| if (size == 0) { ------------------ | Branch (76:9): [True: 0, False: 2.03k] ------------------ 77| 0| return NULL; 78| 0| } 79| | 80| 2.03k| return malloc(size); 81| 2.03k|} flb_hash_table.c:flb_fuzz_get_probability: 56| 4.08k|static inline int flb_fuzz_get_probability(int val) { 57| 4.08k| flb_malloc_p += 1; 58| 4.08k| flb_malloc_p = flb_malloc_p % flb_malloc_mod; 59| 4.08k| if (val > flb_malloc_p) { ------------------ | Branch (59:7): [True: 9, False: 4.07k] ------------------ 60| 9| return 1; 61| 9| } 62| 4.07k| return 0; 63| 4.08k|} flb_hash_table.c:flb_calloc: 84| 2.03k|void *flb_calloc(size_t n, const size_t size) { 85| 2.03k| if (size == 0) { ------------------ | Branch (85:9): [True: 0, False: 2.03k] ------------------ 86| 0| return NULL; 87| 0| } 88| 2.03k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 89| | // Add chance of failure. Used by fuzzing to test error-handling code. 90| 2.03k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (90:8): [True: 3, False: 2.03k] ------------------ 91| 3| return NULL; 92| 3| } 93| 2.03k|#endif 94| | 95| 2.03k| return calloc(n, size); 96| 2.03k|} flb_hash_table.c:flb_free: 126| 4.07k|static inline void flb_free(void *ptr) { 127| 4.07k| free(ptr); 128| 4.07k|} flb_kernel.c:flb_malloc: 67| 4.08k|void *flb_malloc(const size_t size) { 68| | 69| 4.08k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 70| | // 1% chance of failure 71| 4.08k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (71:8): [True: 4, False: 4.08k] ------------------ 72| 4| return NULL; 73| 4| } 74| 4.08k|#endif 75| | 76| 4.08k| if (size == 0) { ------------------ | Branch (76:9): [True: 0, False: 4.08k] ------------------ 77| 0| return NULL; 78| 0| } 79| | 80| 4.08k| return malloc(size); 81| 4.08k|} flb_kernel.c:flb_fuzz_get_probability: 56| 4.08k|static inline int flb_fuzz_get_probability(int val) { 57| 4.08k| flb_malloc_p += 1; 58| 4.08k| flb_malloc_p = flb_malloc_p % flb_malloc_mod; 59| 4.08k| if (val > flb_malloc_p) { ------------------ | Branch (59:7): [True: 4, False: 4.08k] ------------------ 60| 4| return 1; 61| 4| } 62| 4.08k| return 0; 63| 4.08k|} flb_kernel.c:flb_free: 126| 1|static inline void flb_free(void *ptr) { 127| 1| free(ptr); 128| 1|} flb_ml_parser.c:flb_calloc: 84| 11.7k|void *flb_calloc(size_t n, const size_t size) { 85| 11.7k| if (size == 0) { ------------------ | Branch (85:9): [True: 0, False: 11.7k] ------------------ 86| 0| return NULL; 87| 0| } 88| 11.7k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 89| | // Add chance of failure. Used by fuzzing to test error-handling code. 90| 11.7k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (90:8): [True: 9, False: 11.6k] ------------------ 91| 9| return NULL; 92| 9| } 93| 11.6k|#endif 94| | 95| 11.6k| return calloc(n, size); 96| 11.7k|} flb_ml_parser.c:flb_fuzz_get_probability: 56| 11.7k|static inline int flb_fuzz_get_probability(int val) { 57| 11.7k| flb_malloc_p += 1; 58| 11.7k| flb_malloc_p = flb_malloc_p % flb_malloc_mod; 59| 11.7k| if (val > flb_malloc_p) { ------------------ | Branch (59:7): [True: 9, False: 11.6k] ------------------ 60| 9| return 1; 61| 9| } 62| 11.6k| return 0; 63| 11.7k|} flb_ml_parser.c:flb_free: 126| 11.6k|static inline void flb_free(void *ptr) { 127| 11.6k| free(ptr); 128| 11.6k|} flb_ml_rule.c:flb_calloc: 84| 42.1k|void *flb_calloc(size_t n, const size_t size) { 85| 42.1k| if (size == 0) { ------------------ | Branch (85:9): [True: 0, False: 42.1k] ------------------ 86| 0| return NULL; 87| 0| } 88| 42.1k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 89| | // Add chance of failure. Used by fuzzing to test error-handling code. 90| 42.1k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (90:8): [True: 26, False: 42.1k] ------------------ 91| 26| return NULL; 92| 26| } 93| 42.1k|#endif 94| | 95| 42.1k| return calloc(n, size); 96| 42.1k|} flb_ml_rule.c:flb_fuzz_get_probability: 56| 160k|static inline int flb_fuzz_get_probability(int val) { 57| 160k| flb_malloc_p += 1; 58| 160k| flb_malloc_p = flb_malloc_p % flb_malloc_mod; 59| 160k| if (val > flb_malloc_p) { ------------------ | Branch (59:7): [True: 62, False: 160k] ------------------ 60| 62| return 1; 61| 62| } 62| 160k| return 0; 63| 160k|} flb_ml_rule.c:flb_free: 126| 160k|static inline void flb_free(void *ptr) { 127| 160k| free(ptr); 128| 160k|} flb_ml_rule.c:flb_malloc: 67| 118k|void *flb_malloc(const size_t size) { 68| | 69| 118k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 70| | // 1% chance of failure 71| 118k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (71:8): [True: 36, False: 118k] ------------------ 72| 36| return NULL; 73| 36| } 74| 118k|#endif 75| | 76| 118k| if (size == 0) { ------------------ | Branch (76:9): [True: 0, False: 118k] ------------------ 77| 0| return NULL; 78| 0| } 79| | 80| 118k| return malloc(size); 81| 118k|} flb_plugins_register: 95| 1.83k|{ 96| 1.83k| struct flb_custom_plugin *custom; 97| 1.83k| struct flb_input_plugin *in; 98| 1.83k| struct flb_output_plugin *out; 99| 1.83k| struct flb_filter_plugin *filter; 100| | 101| | 102| 1.83k| custom = flb_malloc(sizeof(struct flb_custom_plugin)); 103| 1.83k| if (!custom) { ------------------ | Branch (103:9): [True: 1, False: 1.82k] ------------------ 104| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 105| 1| return -1; 106| 1| } 107| 1.82k| memcpy(custom, &custom_calyptia_plugin, sizeof(struct flb_custom_plugin)); 108| 1.82k| mk_list_add(&custom->_head, &config->custom_plugins); 109| | 110| 1.82k| in = flb_malloc(sizeof(struct flb_input_plugin)); 111| 1.82k| if (!in) { ------------------ | Branch (111:9): [True: 2, False: 1.82k] ------------------ 112| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 113| 2| return -1; 114| 2| } 115| 1.82k| memcpy(in, &in_docker_events_plugin, sizeof(struct flb_input_plugin)); 116| 1.82k| mk_list_add(&in->_head, &config->in_plugins); 117| | 118| 1.82k| in = flb_malloc(sizeof(struct flb_input_plugin)); 119| 1.82k| if (!in) { ------------------ | Branch (119:9): [True: 2, False: 1.82k] ------------------ 120| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 121| 2| return -1; 122| 2| } 123| 1.82k| memcpy(in, &in_node_exporter_metrics_plugin, sizeof(struct flb_input_plugin)); 124| 1.82k| mk_list_add(&in->_head, &config->in_plugins); 125| | 126| 1.82k| in = flb_malloc(sizeof(struct flb_input_plugin)); 127| 1.82k| if (!in) { ------------------ | Branch (127:9): [True: 2, False: 1.82k] ------------------ 128| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 129| 2| return -1; 130| 2| } 131| 1.82k| memcpy(in, &in_fluentbit_metrics_plugin, sizeof(struct flb_input_plugin)); 132| 1.82k| mk_list_add(&in->_head, &config->in_plugins); 133| | 134| 1.82k| in = flb_malloc(sizeof(struct flb_input_plugin)); 135| 1.82k| if (!in) { ------------------ | Branch (135:9): [True: 1, False: 1.82k] ------------------ 136| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 137| 1| return -1; 138| 1| } 139| 1.82k| memcpy(in, &in_prometheus_scrape_plugin, sizeof(struct flb_input_plugin)); 140| 1.82k| mk_list_add(&in->_head, &config->in_plugins); 141| | 142| 1.82k| in = flb_malloc(sizeof(struct flb_input_plugin)); 143| 1.82k| if (!in) { ------------------ | Branch (143:9): [True: 1, False: 1.82k] ------------------ 144| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 145| 1| return -1; 146| 1| } 147| 1.82k| memcpy(in, &in_emitter_plugin, sizeof(struct flb_input_plugin)); 148| 1.82k| mk_list_add(&in->_head, &config->in_plugins); 149| | 150| 1.82k| in = flb_malloc(sizeof(struct flb_input_plugin)); 151| 1.82k| if (!in) { ------------------ | Branch (151:9): [True: 1, False: 1.82k] ------------------ 152| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 153| 1| return -1; 154| 1| } 155| 1.82k| memcpy(in, &in_dummy_plugin, sizeof(struct flb_input_plugin)); 156| 1.82k| mk_list_add(&in->_head, &config->in_plugins); 157| | 158| 1.82k| in = flb_malloc(sizeof(struct flb_input_plugin)); 159| 1.82k| if (!in) { ------------------ | Branch (159:9): [True: 1, False: 1.81k] ------------------ 160| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 161| 1| return -1; 162| 1| } 163| 1.81k| memcpy(in, &in_http_plugin, sizeof(struct flb_input_plugin)); 164| 1.81k| mk_list_add(&in->_head, &config->in_plugins); 165| | 166| 1.81k| in = flb_malloc(sizeof(struct flb_input_plugin)); 167| 1.81k| if (!in) { ------------------ | Branch (167:9): [True: 1, False: 1.81k] ------------------ 168| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 169| 1| return -1; 170| 1| } 171| 1.81k| memcpy(in, &in_statsd_plugin, sizeof(struct flb_input_plugin)); 172| 1.81k| mk_list_add(&in->_head, &config->in_plugins); 173| | 174| 1.81k| in = flb_malloc(sizeof(struct flb_input_plugin)); 175| 1.81k| if (!in) { ------------------ | Branch (175:9): [True: 1, False: 1.81k] ------------------ 176| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 177| 1| return -1; 178| 1| } 179| 1.81k| memcpy(in, &in_opentelemetry_plugin, sizeof(struct flb_input_plugin)); 180| 1.81k| mk_list_add(&in->_head, &config->in_plugins); 181| | 182| 1.81k| in = flb_malloc(sizeof(struct flb_input_plugin)); 183| 1.81k| if (!in) { ------------------ | Branch (183:9): [True: 3, False: 1.81k] ------------------ 184| 3| flb_errno(); ------------------ | | 201| 3|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 185| 3| return -1; 186| 3| } 187| 1.81k| memcpy(in, &in_elasticsearch_plugin, sizeof(struct flb_input_plugin)); 188| 1.81k| mk_list_add(&in->_head, &config->in_plugins); 189| | 190| 1.81k| in = flb_malloc(sizeof(struct flb_input_plugin)); 191| 1.81k| if (!in) { ------------------ | Branch (191:9): [True: 2, False: 1.81k] ------------------ 192| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 193| 2| return -1; 194| 2| } 195| 1.81k| memcpy(in, &in_event_test_plugin, sizeof(struct flb_input_plugin)); 196| 1.81k| mk_list_add(&in->_head, &config->in_plugins); 197| | 198| 1.81k| in = flb_malloc(sizeof(struct flb_input_plugin)); 199| 1.81k| if (!in) { ------------------ | Branch (199:9): [True: 2, False: 1.81k] ------------------ 200| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 201| 2| return -1; 202| 2| } 203| 1.81k| memcpy(in, &in_event_type_plugin, sizeof(struct flb_input_plugin)); 204| 1.81k| mk_list_add(&in->_head, &config->in_plugins); 205| | 206| 1.81k| in = flb_malloc(sizeof(struct flb_input_plugin)); 207| 1.81k| if (!in) { ------------------ | Branch (207:9): [True: 3, False: 1.80k] ------------------ 208| 3| flb_errno(); ------------------ | | 201| 3|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 209| 3| return -1; 210| 3| } 211| 1.80k| memcpy(in, &in_storage_backlog_plugin, sizeof(struct flb_input_plugin)); 212| 1.80k| mk_list_add(&in->_head, &config->in_plugins); 213| | 214| 1.80k| in = flb_malloc(sizeof(struct flb_input_plugin)); 215| 1.80k| if (!in) { ------------------ | Branch (215:9): [True: 2, False: 1.80k] ------------------ 216| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 217| 2| return -1; 218| 2| } 219| 1.80k| memcpy(in, &in_nginx_exporter_metrics_plugin, sizeof(struct flb_input_plugin)); 220| 1.80k| mk_list_add(&in->_head, &config->in_plugins); 221| | 222| 1.80k| in = flb_malloc(sizeof(struct flb_input_plugin)); 223| 1.80k| if (!in) { ------------------ | Branch (223:9): [True: 1, False: 1.80k] ------------------ 224| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 225| 1| return -1; 226| 1| } 227| 1.80k| memcpy(in, &in_udp_plugin, sizeof(struct flb_input_plugin)); 228| 1.80k| mk_list_add(&in->_head, &config->in_plugins); 229| | 230| 1.80k| in = flb_malloc(sizeof(struct flb_input_plugin)); 231| 1.80k| if (!in) { ------------------ | Branch (231:9): [True: 1, False: 1.80k] ------------------ 232| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 233| 1| return -1; 234| 1| } 235| 1.80k| memcpy(in, &in_exec_wasi_plugin, sizeof(struct flb_input_plugin)); 236| 1.80k| mk_list_add(&in->_head, &config->in_plugins); 237| | 238| 1.80k| in = flb_malloc(sizeof(struct flb_input_plugin)); 239| 1.80k| if (!in) { ------------------ | Branch (239:9): [True: 1, False: 1.80k] ------------------ 240| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 241| 1| return -1; 242| 1| } 243| 1.80k| memcpy(in, &in_lib_plugin, sizeof(struct flb_input_plugin)); 244| 1.80k| mk_list_add(&in->_head, &config->in_plugins); 245| | 246| | 247| 1.80k| out = flb_malloc(sizeof(struct flb_output_plugin)); 248| 1.80k| if (!out) { ------------------ | Branch (248:9): [True: 1, False: 1.80k] ------------------ 249| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 250| 1| return -1; 251| 1| } 252| 1.80k| memcpy(out, &out_azure_blob_plugin, sizeof(struct flb_output_plugin)); 253| 1.80k| mk_list_add(&out->_head, &config->out_plugins); 254| | 255| 1.80k| out = flb_malloc(sizeof(struct flb_output_plugin)); 256| 1.80k| if (!out) { ------------------ | Branch (256:9): [True: 2, False: 1.79k] ------------------ 257| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 258| 2| return -1; 259| 2| } 260| 1.79k| memcpy(out, &out_azure_kusto_plugin, sizeof(struct flb_output_plugin)); 261| 1.79k| mk_list_add(&out->_head, &config->out_plugins); 262| | 263| 1.79k| out = flb_malloc(sizeof(struct flb_output_plugin)); 264| 1.79k| if (!out) { ------------------ | Branch (264:9): [True: 2, False: 1.79k] ------------------ 265| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 266| 2| return -1; 267| 2| } 268| 1.79k| memcpy(out, &out_calyptia_plugin, sizeof(struct flb_output_plugin)); 269| 1.79k| mk_list_add(&out->_head, &config->out_plugins); 270| | 271| 1.79k| out = flb_malloc(sizeof(struct flb_output_plugin)); 272| 1.79k| if (!out) { ------------------ | Branch (272:9): [True: 2, False: 1.79k] ------------------ 273| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 274| 2| return -1; 275| 2| } 276| 1.79k| memcpy(out, &out_exit_plugin, sizeof(struct flb_output_plugin)); 277| 1.79k| mk_list_add(&out->_head, &config->out_plugins); 278| | 279| 1.79k| out = flb_malloc(sizeof(struct flb_output_plugin)); 280| 1.79k| if (!out) { ------------------ | Branch (280:9): [True: 2, False: 1.79k] ------------------ 281| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 282| 2| return -1; 283| 2| } 284| 1.79k| memcpy(out, &out_http_plugin, sizeof(struct flb_output_plugin)); 285| 1.79k| mk_list_add(&out->_head, &config->out_plugins); 286| | 287| 1.79k| out = flb_malloc(sizeof(struct flb_output_plugin)); 288| 1.79k| if (!out) { ------------------ | Branch (288:9): [True: 1, False: 1.79k] ------------------ 289| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 290| 1| return -1; 291| 1| } 292| 1.79k| memcpy(out, &out_logdna_plugin, sizeof(struct flb_output_plugin)); 293| 1.79k| mk_list_add(&out->_head, &config->out_plugins); 294| | 295| 1.79k| out = flb_malloc(sizeof(struct flb_output_plugin)); 296| 1.79k| if (!out) { ------------------ | Branch (296:9): [True: 1, False: 1.79k] ------------------ 297| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 298| 1| return -1; 299| 1| } 300| 1.79k| memcpy(out, &out_opensearch_plugin, sizeof(struct flb_output_plugin)); 301| 1.79k| mk_list_add(&out->_head, &config->out_plugins); 302| | 303| 1.79k| out = flb_malloc(sizeof(struct flb_output_plugin)); 304| 1.79k| if (!out) { ------------------ | Branch (304:9): [True: 2, False: 1.78k] ------------------ 305| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 306| 2| return -1; 307| 2| } 308| 1.78k| memcpy(out, &out_skywalking_plugin, sizeof(struct flb_output_plugin)); 309| 1.78k| mk_list_add(&out->_head, &config->out_plugins); 310| | 311| 1.78k| out = flb_malloc(sizeof(struct flb_output_plugin)); 312| 1.78k| if (!out) { ------------------ | Branch (312:9): [True: 2, False: 1.78k] ------------------ 313| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 314| 2| return -1; 315| 2| } 316| 1.78k| memcpy(out, &out_stdout_plugin, sizeof(struct flb_output_plugin)); 317| 1.78k| mk_list_add(&out->_head, &config->out_plugins); 318| | 319| 1.78k| out = flb_malloc(sizeof(struct flb_output_plugin)); 320| 1.78k| if (!out) { ------------------ | Branch (320:9): [True: 1, False: 1.78k] ------------------ 321| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 322| 1| return -1; 323| 1| } 324| 1.78k| memcpy(out, &out_udp_plugin, sizeof(struct flb_output_plugin)); 325| 1.78k| mk_list_add(&out->_head, &config->out_plugins); 326| | 327| 1.78k| out = flb_malloc(sizeof(struct flb_output_plugin)); 328| 1.78k| if (!out) { ------------------ | Branch (328:9): [True: 2, False: 1.78k] ------------------ 329| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 330| 2| return -1; 331| 2| } 332| 1.78k| memcpy(out, &out_td_plugin, sizeof(struct flb_output_plugin)); 333| 1.78k| mk_list_add(&out->_head, &config->out_plugins); 334| | 335| 1.78k| out = flb_malloc(sizeof(struct flb_output_plugin)); 336| 1.78k| if (!out) { ------------------ | Branch (336:9): [True: 1, False: 1.78k] ------------------ 337| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 338| 1| return -1; 339| 1| } 340| 1.78k| memcpy(out, &out_lib_plugin, sizeof(struct flb_output_plugin)); 341| 1.78k| mk_list_add(&out->_head, &config->out_plugins); 342| | 343| 1.78k| out = flb_malloc(sizeof(struct flb_output_plugin)); 344| 1.78k| if (!out) { ------------------ | Branch (344:9): [True: 2, False: 1.78k] ------------------ 345| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 346| 2| return -1; 347| 2| } 348| 1.78k| memcpy(out, &out_websocket_plugin, sizeof(struct flb_output_plugin)); 349| 1.78k| mk_list_add(&out->_head, &config->out_plugins); 350| | 351| 1.78k| out = flb_malloc(sizeof(struct flb_output_plugin)); 352| 1.78k| if (!out) { ------------------ | Branch (352:9): [True: 2, False: 1.77k] ------------------ 353| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 354| 2| return -1; 355| 2| } 356| 1.77k| memcpy(out, &out_cloudwatch_logs_plugin, sizeof(struct flb_output_plugin)); 357| 1.77k| mk_list_add(&out->_head, &config->out_plugins); 358| | 359| 1.77k| out = flb_malloc(sizeof(struct flb_output_plugin)); 360| 1.77k| if (!out) { ------------------ | Branch (360:9): [True: 1, False: 1.77k] ------------------ 361| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 362| 1| return -1; 363| 1| } 364| 1.77k| memcpy(out, &out_kinesis_firehose_plugin, sizeof(struct flb_output_plugin)); 365| 1.77k| mk_list_add(&out->_head, &config->out_plugins); 366| | 367| 1.77k| out = flb_malloc(sizeof(struct flb_output_plugin)); 368| 1.77k| if (!out) { ------------------ | Branch (368:9): [True: 1, False: 1.77k] ------------------ 369| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 370| 1| return -1; 371| 1| } 372| 1.77k| memcpy(out, &out_kinesis_streams_plugin, sizeof(struct flb_output_plugin)); 373| 1.77k| mk_list_add(&out->_head, &config->out_plugins); 374| | 375| 1.77k| out = flb_malloc(sizeof(struct flb_output_plugin)); 376| 1.77k| if (!out) { ------------------ | Branch (376:9): [True: 1, False: 1.77k] ------------------ 377| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 378| 1| return -1; 379| 1| } 380| 1.77k| memcpy(out, &out_opentelemetry_plugin, sizeof(struct flb_output_plugin)); 381| 1.77k| mk_list_add(&out->_head, &config->out_plugins); 382| | 383| 1.77k| out = flb_malloc(sizeof(struct flb_output_plugin)); 384| 1.77k| if (!out) { ------------------ | Branch (384:9): [True: 1, False: 1.77k] ------------------ 385| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 386| 1| return -1; 387| 1| } 388| 1.77k| memcpy(out, &out_prometheus_exporter_plugin, sizeof(struct flb_output_plugin)); 389| 1.77k| mk_list_add(&out->_head, &config->out_plugins); 390| | 391| 1.77k| out = flb_malloc(sizeof(struct flb_output_plugin)); 392| 1.77k| if (!out) { ------------------ | Branch (392:9): [True: 1, False: 1.77k] ------------------ 393| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 394| 1| return -1; 395| 1| } 396| 1.77k| memcpy(out, &out_prometheus_remote_write_plugin, sizeof(struct flb_output_plugin)); 397| 1.77k| mk_list_add(&out->_head, &config->out_plugins); 398| | 399| 1.77k| out = flb_malloc(sizeof(struct flb_output_plugin)); 400| 1.77k| if (!out) { ------------------ | Branch (400:9): [True: 1, False: 1.77k] ------------------ 401| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 402| 1| return -1; 403| 1| } 404| 1.77k| memcpy(out, &out_s3_plugin, sizeof(struct flb_output_plugin)); 405| 1.77k| mk_list_add(&out->_head, &config->out_plugins); 406| | 407| 1.77k| out = flb_malloc(sizeof(struct flb_output_plugin)); 408| 1.77k| if (!out) { ------------------ | Branch (408:9): [True: 2, False: 1.77k] ------------------ 409| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 410| 2| return -1; 411| 2| } 412| 1.77k| memcpy(out, &out_vivo_exporter_plugin, sizeof(struct flb_output_plugin)); 413| 1.77k| mk_list_add(&out->_head, &config->out_plugins); 414| | 415| | 416| 1.77k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 417| 1.77k| if (!filter) { ------------------ | Branch (417:9): [True: 2, False: 1.76k] ------------------ 418| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 419| 2| return -1; 420| 2| } 421| 1.76k| memcpy(filter, &filter_alter_size_plugin, sizeof(struct flb_filter_plugin)); 422| 1.76k| mk_list_add(&filter->_head, &config->filter_plugins); 423| | 424| 1.76k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 425| 1.76k| if (!filter) { ------------------ | Branch (425:9): [True: 2, False: 1.76k] ------------------ 426| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 427| 2| return -1; 428| 2| } 429| 1.76k| memcpy(filter, &filter_aws_plugin, sizeof(struct flb_filter_plugin)); 430| 1.76k| mk_list_add(&filter->_head, &config->filter_plugins); 431| | 432| 1.76k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 433| 1.76k| if (!filter) { ------------------ | Branch (433:9): [True: 1, False: 1.76k] ------------------ 434| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 435| 1| return -1; 436| 1| } 437| 1.76k| memcpy(filter, &filter_checklist_plugin, sizeof(struct flb_filter_plugin)); 438| 1.76k| mk_list_add(&filter->_head, &config->filter_plugins); 439| | 440| 1.76k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 441| 1.76k| if (!filter) { ------------------ | Branch (441:9): [True: 2, False: 1.76k] ------------------ 442| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 443| 2| return -1; 444| 2| } 445| 1.76k| memcpy(filter, &filter_ecs_plugin, sizeof(struct flb_filter_plugin)); 446| 1.76k| mk_list_add(&filter->_head, &config->filter_plugins); 447| | 448| 1.76k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 449| 1.76k| if (!filter) { ------------------ | Branch (449:9): [True: 2, False: 1.76k] ------------------ 450| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 451| 2| return -1; 452| 2| } 453| 1.76k| memcpy(filter, &filter_record_modifier_plugin, sizeof(struct flb_filter_plugin)); 454| 1.76k| mk_list_add(&filter->_head, &config->filter_plugins); 455| | 456| 1.76k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 457| 1.76k| if (!filter) { ------------------ | Branch (457:9): [True: 2, False: 1.76k] ------------------ 458| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 459| 2| return -1; 460| 2| } 461| 1.76k| memcpy(filter, &filter_throttle_plugin, sizeof(struct flb_filter_plugin)); 462| 1.76k| mk_list_add(&filter->_head, &config->filter_plugins); 463| | 464| 1.76k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 465| 1.76k| if (!filter) { ------------------ | Branch (465:9): [True: 2, False: 1.75k] ------------------ 466| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 467| 2| return -1; 468| 2| } 469| 1.75k| memcpy(filter, &filter_type_converter_plugin, sizeof(struct flb_filter_plugin)); 470| 1.75k| mk_list_add(&filter->_head, &config->filter_plugins); 471| | 472| 1.75k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 473| 1.75k| if (!filter) { ------------------ | Branch (473:9): [True: 1, False: 1.75k] ------------------ 474| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 475| 1| return -1; 476| 1| } 477| 1.75k| memcpy(filter, &filter_kubernetes_plugin, sizeof(struct flb_filter_plugin)); 478| 1.75k| mk_list_add(&filter->_head, &config->filter_plugins); 479| | 480| 1.75k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 481| 1.75k| if (!filter) { ------------------ | Branch (481:9): [True: 1, False: 1.75k] ------------------ 482| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 483| 1| return -1; 484| 1| } 485| 1.75k| memcpy(filter, &filter_modify_plugin, sizeof(struct flb_filter_plugin)); 486| 1.75k| mk_list_add(&filter->_head, &config->filter_plugins); 487| | 488| 1.75k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 489| 1.75k| if (!filter) { ------------------ | Branch (489:9): [True: 2, False: 1.75k] ------------------ 490| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 491| 2| return -1; 492| 2| } 493| 1.75k| memcpy(filter, &filter_multiline_plugin, sizeof(struct flb_filter_plugin)); 494| 1.75k| mk_list_add(&filter->_head, &config->filter_plugins); 495| | 496| 1.75k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 497| 1.75k| if (!filter) { ------------------ | Branch (497:9): [True: 1, False: 1.75k] ------------------ 498| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 499| 1| return -1; 500| 1| } 501| 1.75k| memcpy(filter, &filter_nest_plugin, sizeof(struct flb_filter_plugin)); 502| 1.75k| mk_list_add(&filter->_head, &config->filter_plugins); 503| | 504| 1.75k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 505| 1.75k| if (!filter) { ------------------ | Branch (505:9): [True: 1, False: 1.75k] ------------------ 506| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 507| 1| return -1; 508| 1| } 509| 1.75k| memcpy(filter, &filter_parser_plugin, sizeof(struct flb_filter_plugin)); 510| 1.75k| mk_list_add(&filter->_head, &config->filter_plugins); 511| | 512| 1.75k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 513| 1.75k| if (!filter) { ------------------ | Branch (513:9): [True: 1, False: 1.75k] ------------------ 514| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 515| 1| return -1; 516| 1| } 517| 1.75k| memcpy(filter, &filter_expect_plugin, sizeof(struct flb_filter_plugin)); 518| 1.75k| mk_list_add(&filter->_head, &config->filter_plugins); 519| | 520| 1.75k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 521| 1.75k| if (!filter) { ------------------ | Branch (521:9): [True: 2, False: 1.74k] ------------------ 522| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 523| 2| return -1; 524| 2| } 525| 1.74k| memcpy(filter, &filter_grep_plugin, sizeof(struct flb_filter_plugin)); 526| 1.74k| mk_list_add(&filter->_head, &config->filter_plugins); 527| | 528| 1.74k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 529| 1.74k| if (!filter) { ------------------ | Branch (529:9): [True: 2, False: 1.74k] ------------------ 530| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 531| 2| return -1; 532| 2| } 533| 1.74k| memcpy(filter, &filter_rewrite_tag_plugin, sizeof(struct flb_filter_plugin)); 534| 1.74k| mk_list_add(&filter->_head, &config->filter_plugins); 535| | 536| 1.74k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 537| 1.74k| if (!filter) { ------------------ | Branch (537:9): [True: 5, False: 1.74k] ------------------ 538| 5| flb_errno(); ------------------ | | 201| 5|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 539| 5| return -1; 540| 5| } 541| 1.74k| memcpy(filter, &filter_log_to_metrics_plugin, sizeof(struct flb_filter_plugin)); 542| 1.74k| mk_list_add(&filter->_head, &config->filter_plugins); 543| | 544| 1.74k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 545| 1.74k| if (!filter) { ------------------ | Branch (545:9): [True: 1, False: 1.74k] ------------------ 546| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 547| 1| return -1; 548| 1| } 549| 1.74k| memcpy(filter, &filter_stdout_plugin, sizeof(struct flb_filter_plugin)); 550| 1.74k| mk_list_add(&filter->_head, &config->filter_plugins); 551| | 552| 1.74k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 553| 1.74k| if (!filter) { ------------------ | Branch (553:9): [True: 3, False: 1.73k] ------------------ 554| 3| flb_errno(); ------------------ | | 201| 3|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 555| 3| return -1; 556| 3| } 557| 1.73k| memcpy(filter, &filter_geoip2_plugin, sizeof(struct flb_filter_plugin)); 558| 1.73k| mk_list_add(&filter->_head, &config->filter_plugins); 559| | 560| 1.73k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 561| 1.73k| if (!filter) { ------------------ | Branch (561:9): [True: 3, False: 1.73k] ------------------ 562| 3| flb_errno(); ------------------ | | 201| 3|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 563| 3| return -1; 564| 3| } 565| 1.73k| memcpy(filter, &filter_nightfall_plugin, sizeof(struct flb_filter_plugin)); 566| 1.73k| mk_list_add(&filter->_head, &config->filter_plugins); 567| | 568| 1.73k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 569| 1.73k| if (!filter) { ------------------ | Branch (569:9): [True: 1, False: 1.73k] ------------------ 570| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 571| 1| return -1; 572| 1| } 573| 1.73k| memcpy(filter, &filter_wasm_plugin, sizeof(struct flb_filter_plugin)); 574| 1.73k| mk_list_add(&filter->_head, &config->filter_plugins); 575| | 576| | 577| | 578| 1.73k| return 0; 579| 1.73k|} flb_plugins_unregister: 582| 2.04k|{ 583| 2.04k| struct mk_list *tmp; 584| 2.04k| struct mk_list *head; 585| 2.04k| struct flb_custom_plugin *custom; 586| 2.04k| struct flb_input_plugin *in; 587| 2.04k| struct flb_output_plugin *out; 588| 2.04k| struct flb_filter_plugin *filter; 589| | 590| 2.04k| mk_list_foreach_safe(head, tmp, &config->custom_plugins) { ------------------ | | 207| 3.87k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 1.82k, False: 2.04k] | | ------------------ ------------------ 591| 1.82k| custom = mk_list_entry(head, struct flb_custom_plugin, _head); ------------------ | | 214| 1.82k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 1.82k|#define container_of(ptr, type, member) ({ \ | | | | 39| 1.82k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 1.82k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 592| 1.82k| mk_list_del(&custom->_head); 593| 1.82k| flb_free(custom); 594| 1.82k| } 595| | 596| 30.8k| mk_list_foreach_safe(head, tmp, &config->in_plugins) { ------------------ | | 207| 32.8k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 30.8k, False: 2.04k] | | ------------------ ------------------ 597| 30.8k| in = mk_list_entry(head, struct flb_input_plugin, _head); ------------------ | | 214| 30.8k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 30.8k|#define container_of(ptr, type, member) ({ \ | | | | 39| 30.8k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 30.8k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 598| 30.8k| if(in->cb_destroy) { ------------------ | Branch (598:12): [True: 0, False: 30.8k] ------------------ 599| 0| in->cb_destroy(in); 600| 0| } 601| 30.8k| mk_list_del(&in->_head); 602| 30.8k| flb_free(in); 603| 30.8k| } 604| | 605| 37.4k| mk_list_foreach_safe(head, tmp, &config->out_plugins) { ------------------ | | 207| 39.5k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 37.4k, False: 2.04k] | | ------------------ ------------------ 606| 37.4k| out = mk_list_entry(head, struct flb_output_plugin, _head); ------------------ | | 214| 37.4k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 37.4k|#define container_of(ptr, type, member) ({ \ | | | | 39| 37.4k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 37.4k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 607| 37.4k| if(out->cb_destroy) { ------------------ | Branch (607:12): [True: 0, False: 37.4k] ------------------ 608| 0| out->cb_destroy(out); 609| 0| } 610| 37.4k| mk_list_del(&out->_head); 611| 37.4k| flb_free(out); 612| 37.4k| } 613| | 614| 35.0k| mk_list_foreach_safe(head, tmp, &config->filter_plugins) { ------------------ | | 207| 37.0k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 35.0k, False: 2.04k] | | ------------------ ------------------ 615| 35.0k| filter = mk_list_entry(head, struct flb_filter_plugin, _head); ------------------ | | 214| 35.0k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 35.0k|#define container_of(ptr, type, member) ({ \ | | | | 39| 35.0k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 35.0k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 616| 35.0k| mk_list_del(&filter->_head); 617| 35.0k| flb_free(filter); 618| 35.0k| } 619| 2.04k|} flb_sds.c:flb_sds_alloc: 68| 11.9k|{ 69| 11.9k| return (size_t) FLB_SDS_HEADER(s)->alloc; ------------------ | | 46| 11.9k|#define FLB_SDS_HEADER(s) ((struct flb_sds *) (s - FLB_SDS_HEADER_SIZE)) | | ------------------ | | | | 34| 11.9k|#define FLB_SDS_HEADER_SIZE (sizeof(uint64_t) + sizeof(uint64_t)) | | ------------------ ------------------ 70| 11.9k|} flb_sds.c:flb_sds_avail: 73| 26.0k|{ 74| 26.0k| struct flb_sds *h; 75| | 76| 26.0k| h = FLB_SDS_HEADER(s); ------------------ | | 46| 26.0k|#define FLB_SDS_HEADER(s) ((struct flb_sds *) (s - FLB_SDS_HEADER_SIZE)) | | ------------------ | | | | 34| 26.0k|#define FLB_SDS_HEADER_SIZE (sizeof(uint64_t) + sizeof(uint64_t)) | | ------------------ ------------------ 77| 26.0k| return (size_t) (h->alloc - h->len); 78| 26.0k|} flb_sds.c:flb_sds_len: 49| 8.68k|{ 50| 8.68k| return (size_t) FLB_SDS_HEADER(s)->len; ------------------ | | 46| 8.68k|#define FLB_SDS_HEADER(s) ((struct flb_sds *) (s - FLB_SDS_HEADER_SIZE)) | | ------------------ | | | | 34| 8.68k|#define FLB_SDS_HEADER_SIZE (sizeof(uint64_t) + sizeof(uint64_t)) | | ------------------ ------------------ 51| 8.68k|} flb_config_map.c:flb_sds_len: 49| 49.5k|{ 50| 49.5k| return (size_t) FLB_SDS_HEADER(s)->len; ------------------ | | 46| 49.5k|#define FLB_SDS_HEADER(s) ((struct flb_sds *) (s - FLB_SDS_HEADER_SIZE)) | | ------------------ | | | | 34| 49.5k|#define FLB_SDS_HEADER_SIZE (sizeof(uint64_t) + sizeof(uint64_t)) | | ------------------ ------------------ 51| 49.5k|} flb_slist.c:flb_sds_len_set: 63| 79|{ 64| 79| FLB_SDS_HEADER(s)->len = len; ------------------ | | 46| 79|#define FLB_SDS_HEADER(s) ((struct flb_sds *) (s - FLB_SDS_HEADER_SIZE)) | | ------------------ | | | | 34| 79|#define FLB_SDS_HEADER_SIZE (sizeof(uint64_t) + sizeof(uint64_t)) | | ------------------ ------------------ 65| 79|} flb_env.c:flb_sds_len: 49| 11.9k|{ 50| 11.9k| return (size_t) FLB_SDS_HEADER(s)->len; ------------------ | | 46| 11.9k|#define FLB_SDS_HEADER(s) ((struct flb_sds *) (s - FLB_SDS_HEADER_SIZE)) | | ------------------ | | | | 34| 11.9k|#define FLB_SDS_HEADER_SIZE (sizeof(uint64_t) + sizeof(uint64_t)) | | ------------------ ------------------ 51| 11.9k|} flb_config.c:flb_strdup: 45| 4.08k|{ 46| 4.08k| return flb_strndup(s, strlen(s)); 47| 4.08k|} flb_config.c:flb_strndup: 31| 4.08k|{ 32| 4.08k| char *str; 33| | 34| 4.08k| str = (char *) flb_malloc(n + 1); 35| 4.08k| if (!str) { ------------------ | Branch (35:9): [True: 6, False: 4.08k] ------------------ 36| 6| return NULL; 37| 6| } 38| 4.08k| memcpy(str, s, n); 39| 4.08k| str[n] = '\0'; 40| | 41| 4.08k| return str; 42| 4.08k|} flb_config.c:flb_str_emptyval: 51| 6.13k|{ 52| 6.13k| if (s != NULL && strcmp(s, "") == 0) { ------------------ | Branch (52:9): [True: 0, False: 6.13k] | Branch (52:22): [True: 0, False: 0] ------------------ 53| 0| return FLB_TRUE; ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ 54| 0| } 55| 6.13k| return FLB_FALSE; ------------------ | | 25| 6.13k|#define FLB_FALSE 0 ------------------ 56| 6.13k|} flb_parser.c:flb_strdup: 45| 18.1k|{ 46| 18.1k| return flb_strndup(s, strlen(s)); 47| 18.1k|} flb_parser.c:flb_strndup: 31| 18.1k|{ 32| 18.1k| char *str; 33| | 34| 18.1k| str = (char *) flb_malloc(n + 1); 35| 18.1k| if (!str) { ------------------ | Branch (35:9): [True: 19, False: 18.1k] ------------------ 36| 19| return NULL; 37| 19| } 38| 18.1k| memcpy(str, s, n); 39| 18.1k| str[n] = '\0'; 40| | 41| 18.1k| return str; 42| 18.1k|} cfl_kvlist.c:cfl_list_init: 55| 2.04k|{ 56| 2.04k| list->next = list; 57| 2.04k| list->prev = list; 58| 2.04k|} cfl_kvlist_create: 26| 2.04k|{ 27| 2.04k| struct cfl_kvlist *list; 28| | 29| 2.04k| list = malloc(sizeof(struct cfl_kvlist)); 30| 2.04k| if (list == NULL) { ------------------ | Branch (30:9): [True: 0, False: 2.04k] ------------------ 31| 0| cfl_report_runtime_error(); ------------------ | | 28| 0|#define cfl_report_runtime_error() cfl_report_runtime_error_impl(errno, __FILENAME__, __LINE__) ------------------ 32| 0| return NULL; 33| 0| } 34| | 35| 2.04k| cfl_list_init(&list->list); 36| 2.04k| return list; 37| 2.04k|} cfl_kvlist_destroy: 40| 2.04k|{ 41| 2.04k| struct cfl_list *tmp; 42| 2.04k| struct cfl_list *head; 43| 2.04k| struct cfl_kvpair *pair; 44| | 45| 2.04k| cfl_list_foreach_safe(head, tmp, &list->list) { ------------------ | | 158| 2.04k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (158:47): [True: 0, False: 2.04k] | | ------------------ ------------------ 46| 0| pair = cfl_list_entry(head, struct cfl_kvpair, _head); ------------------ | | 165| 0|#define cfl_list_entry( ptr, type, member ) cfl_container_of( ptr, type, member ) | | ------------------ | | | | 45| 0|#define cfl_container_of(ptr, type, member) ({ \ | | | | 46| 0| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 47| 0| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 47| | 48| 0| if (pair->key) { ------------------ | Branch (48:13): [True: 0, False: 0] ------------------ 49| 0| cfl_sds_destroy(pair->key); 50| 0| } 51| | 52| 0| if (pair->val) { ------------------ | Branch (52:13): [True: 0, False: 0] ------------------ 53| 0| cfl_variant_destroy(pair->val); 54| 0| } 55| 0| cfl_list_del(&pair->_head); 56| 0| free(pair); 57| 0| } 58| | 59| 2.04k| free(list); 60| 2.04k|} flb_config.c:MK_EVENT_ZERO: 123| 6.15k|{ 124| 6.15k| MK_EVENT_INIT(e, -1, NULL, NULL); 125| 6.15k|} flb_config.c:MK_EVENT_INIT: 113| 6.15k|{ 114| 6.15k| ev->fd = fd; 115| 6.15k| ev->type = MK_EVENT_CUSTOM; ------------------ | | 33| 6.15k|#define MK_EVENT_CUSTOM 4 /* custom fd registered */ ------------------ 116| 6.15k| ev->mask = MK_EVENT_EMPTY; ------------------ | | 37| 6.15k|#define MK_EVENT_EMPTY 0 ------------------ 117| 6.15k| ev->status = MK_EVENT_NONE; ------------------ | | 52| 6.15k|#define MK_EVENT_NONE 1 /* nothing */ ------------------ 118| 6.15k| ev->data = data; 119| 6.15k| ev->handler = callback; 120| 6.15k|} flb_kv.c:mk_list_init: 49| 1.73k|{ 50| 1.73k| list->next = list; 51| 1.73k| list->prev = list; 52| 1.73k|} flb_kv.c:mk_list_add: 64| 1.73k|{ 65| 1.73k| __mk_list_add(_new, head->prev, head); 66| 1.73k|} flb_kv.c:__mk_list_add: 56| 1.73k|{ 57| 1.73k| next->prev = _new; 58| 1.73k| _new->next = next; 59| 1.73k| _new->prev = prev; 60| 1.73k| prev->next = _new; 61| 1.73k|} flb_kv.c:mk_list_del: 146| 1.73k|{ 147| 1.73k| __mk_list_del(entry->prev, entry->next); 148| 1.73k| entry->prev = NULL; 149| 1.73k| entry->next = NULL; 150| 1.73k|} flb_kv.c:__mk_list_del: 140| 1.73k|{ 141| 1.73k| prev->next = next; 142| 1.73k| next->prev = prev; 143| 1.73k|} flb_config.c:mk_list_add: 64| 105k|{ 65| 105k| __mk_list_add(_new, head->prev, head); 66| 105k|} flb_config.c:__mk_list_add: 56| 105k|{ 57| 105k| next->prev = _new; 58| 105k| _new->next = next; 59| 105k| _new->prev = prev; 60| 105k| prev->next = _new; 61| 105k|} flb_config.c:mk_list_del: 146| 105k|{ 147| 105k| __mk_list_del(entry->prev, entry->next); 148| 105k| entry->prev = NULL; 149| 105k| entry->next = NULL; 150| 105k|} flb_config.c:__mk_list_del: 140| 105k|{ 141| 105k| prev->next = next; 142| 105k| next->prev = prev; 143| 105k|} flb_config.c:mk_list_init: 49| 38.8k|{ 50| 38.8k| list->next = list; 51| 38.8k| list->prev = list; 52| 38.8k|} flb_config_map.c:mk_list_init: 49| 10.4k|{ 50| 10.4k| list->next = list; 51| 10.4k| list->prev = list; 52| 10.4k|} flb_config_map.c:mk_list_add: 64| 17.2k|{ 65| 17.2k| __mk_list_add(_new, head->prev, head); 66| 17.2k|} flb_config_map.c:__mk_list_add: 56| 17.2k|{ 57| 17.2k| next->prev = _new; 58| 17.2k| _new->next = next; 59| 17.2k| _new->prev = prev; 60| 17.2k| prev->next = _new; 61| 17.2k|} flb_config_map.c:mk_list_del: 146| 17.2k|{ 147| 17.2k| __mk_list_del(entry->prev, entry->next); 148| 17.2k| entry->prev = NULL; 149| 17.2k| entry->next = NULL; 150| 17.2k|} flb_config_map.c:__mk_list_del: 140| 17.2k|{ 141| 17.2k| prev->next = next; 142| 17.2k| next->prev = prev; 143| 17.2k|} flb_config_map.c:mk_list_size: 162| 1.16k|{ 163| 1.16k| int ret = 0; 164| 1.16k| struct mk_list *it; 165| 9.10k| for (it = head->next; it != head; it = it->next, ret++); ------------------ | Branch (165:27): [True: 7.94k, False: 1.16k] ------------------ 166| 1.16k| return ret; 167| 1.16k|} flb_slist.c:mk_list_init: 49| 42.1k|{ 50| 42.1k| list->next = list; 51| 42.1k| list->prev = list; 52| 42.1k|} flb_slist.c:mk_list_add: 64| 95.2k|{ 65| 95.2k| __mk_list_add(_new, head->prev, head); 66| 95.2k|} flb_slist.c:__mk_list_add: 56| 95.2k|{ 57| 95.2k| next->prev = _new; 58| 95.2k| _new->next = next; 59| 95.2k| _new->prev = prev; 60| 95.2k| prev->next = _new; 61| 95.2k|} flb_slist.c:mk_list_del: 146| 95.0k|{ 147| 95.0k| __mk_list_del(entry->prev, entry->next); 148| 95.0k| entry->prev = NULL; 149| 95.0k| entry->next = NULL; 150| 95.0k|} flb_slist.c:__mk_list_del: 140| 95.0k|{ 141| 95.0k| prev->next = next; 142| 95.0k| next->prev = prev; 143| 95.0k|} flb_plugin.c:mk_list_init: 49| 5.19k|{ 50| 5.19k| list->next = list; 51| 5.19k| list->prev = list; 52| 5.19k|} flb_config_format.c:mk_list_init: 49| 22.5k|{ 50| 22.5k| list->next = list; 51| 22.5k| list->prev = list; 52| 22.5k|} flb_config_format.c:mk_list_add: 64| 2.04k|{ 65| 2.04k| __mk_list_add(_new, head->prev, head); 66| 2.04k|} flb_config_format.c:__mk_list_add: 56| 2.04k|{ 57| 2.04k| next->prev = _new; 58| 2.04k| _new->next = next; 59| 2.04k| _new->prev = prev; 60| 2.04k| prev->next = _new; 61| 2.04k|} flb_config_format.c:mk_list_del: 146| 2.04k|{ 147| 2.04k| __mk_list_del(entry->prev, entry->next); 148| 2.04k| entry->prev = NULL; 149| 2.04k| entry->next = NULL; 150| 2.04k|} flb_config_format.c:__mk_list_del: 140| 2.04k|{ 141| 2.04k| prev->next = next; 142| 2.04k| next->prev = prev; 143| 2.04k|} flb_parser.c:mk_list_add: 64| 4.05k|{ 65| 4.05k| __mk_list_add(_new, head->prev, head); 66| 4.05k|} flb_parser.c:__mk_list_add: 56| 4.05k|{ 57| 4.05k| next->prev = _new; 58| 4.05k| _new->next = next; 59| 4.05k| _new->prev = prev; 60| 4.05k| prev->next = _new; 61| 4.05k|} flb_parser.c:mk_list_del: 146| 4.05k|{ 147| 4.05k| __mk_list_del(entry->prev, entry->next); 148| 4.05k| entry->prev = NULL; 149| 4.05k| entry->next = NULL; 150| 4.05k|} flb_parser.c:__mk_list_del: 140| 4.05k|{ 141| 4.05k| prev->next = next; 142| 4.05k| next->prev = prev; 143| 4.05k|} flb_hash_table.c:mk_list_init: 49| 132k|{ 50| 132k| list->next = list; 51| 132k| list->prev = list; 52| 132k|} flb_ml_parser.c:mk_list_init: 49| 11.6k|{ 50| 11.6k| list->next = list; 51| 11.6k| list->prev = list; 52| 11.6k|} flb_ml_parser.c:mk_list_add: 64| 11.6k|{ 65| 11.6k| __mk_list_add(_new, head->prev, head); 66| 11.6k|} flb_ml_parser.c:__mk_list_add: 56| 11.6k|{ 57| 11.6k| next->prev = _new; 58| 11.6k| _new->next = next; 59| 11.6k| _new->prev = prev; 60| 11.6k| prev->next = _new; 61| 11.6k|} flb_ml_parser.c:mk_list_del: 146| 11.6k|{ 147| 11.6k| __mk_list_del(entry->prev, entry->next); 148| 11.6k| entry->prev = NULL; 149| 11.6k| entry->next = NULL; 150| 11.6k|} flb_ml_parser.c:__mk_list_del: 140| 11.6k|{ 141| 11.6k| prev->next = next; 142| 11.6k| next->prev = prev; 143| 11.6k|} flb_ml_rule.c:mk_list_init: 49| 42.1k|{ 50| 42.1k| list->next = list; 51| 42.1k| list->prev = list; 52| 42.1k|} flb_ml_rule.c:mk_list_size: 162| 42.1k|{ 163| 42.1k| int ret = 0; 164| 42.1k| struct mk_list *it; 165| 162k| for (it = head->next; it != head; it = it->next, ret++); ------------------ | Branch (165:27): [True: 120k, False: 42.1k] ------------------ 166| 42.1k| return ret; 167| 42.1k|} flb_ml_rule.c:mk_list_add: 64| 160k|{ 65| 160k| __mk_list_add(_new, head->prev, head); 66| 160k|} flb_ml_rule.c:__mk_list_add: 56| 160k|{ 57| 160k| next->prev = _new; 58| 160k| _new->next = next; 59| 160k| _new->prev = prev; 60| 160k| prev->next = _new; 61| 160k|} flb_ml_rule.c:mk_list_del: 146| 160k|{ 147| 160k| __mk_list_del(entry->prev, entry->next); 148| 160k| entry->prev = NULL; 149| 160k| entry->next = NULL; 150| 160k|} flb_ml_rule.c:__mk_list_del: 140| 160k|{ 141| 160k| prev->next = next; 142| 160k| next->prev = prev; 143| 160k|} flb_ml_parser_python.c:mk_list_size: 162| 24|{ 163| 24| int ret = 0; 164| 24| struct mk_list *it; 165| 56| for (it = head->next; it != head; it = it->next, ret++); ------------------ | Branch (165:27): [True: 32, False: 24] ------------------ 166| 24| return ret; 167| 24|} flb_ml_parser_java.c:mk_list_size: 162| 60|{ 163| 60| int ret = 0; 164| 60| struct mk_list *it; 165| 225| for (it = head->next; it != head; it = it->next, ret++); ------------------ | Branch (165:27): [True: 165, False: 60] ------------------ 166| 60| return ret; 167| 60|} flb_ml_parser_go.c:mk_list_size: 162| 42|{ 163| 42| int ret = 0; 164| 42| struct mk_list *it; 165| 183| for (it = head->next; it != head; it = it->next, ret++); ------------------ | Branch (165:27): [True: 141, False: 42] ------------------ 166| 42| return ret; 167| 42|} flb_ml_parser_ruby.c:mk_list_size: 162| 9|{ 163| 9| int ret = 0; 164| 9| struct mk_list *it; 165| 12| for (it = head->next; it != head; it = it->next, ret++); ------------------ | Branch (165:27): [True: 3, False: 9] ------------------ 166| 9| return ret; 167| 9|} flb_kernel.c:mk_mem_free: 98| 4.08k|{ 99| |#ifdef MALLOC_JEMALLOC 100| | je_free(ptr); 101| |#else 102| 4.08k| free(ptr); 103| 4.08k|#endif 104| 4.08k|} mk_string.c:mk_mem_alloc: 49| 4.08k|{ 50| |#ifdef MALLOC_JEMALLOC 51| | void *aux = je_malloc(size); 52| |#else 53| 4.08k| void *aux = malloc(size); 54| 4.08k|#endif 55| | 56| 4.08k| if (mk_unlikely(!aux && size)) { ------------------ | | 116| 4.08k| #define mk_unlikely(x) __builtin_expect((x),0) | | ------------------ | | | Branch (116:26): [True: 0, False: 4.08k] | | | Branch (116:44): [True: 0, False: 4.08k] | | | Branch (116:44): [True: 0, False: 0] | | ------------------ ------------------ 57| 0| perror("malloc"); 58| 0| return NULL; 59| 0| } 60| | 61| 4.08k| return aux; 62| 4.08k|} mk_string_char_search: 287| 94.1k|{ 288| 94.1k| char *p; 289| | 290| 94.1k| if (len < 0) { ------------------ | Branch (290:9): [True: 0, False: 94.1k] ------------------ 291| 0| len = strlen(string); 292| 0| } 293| | 294| 94.1k| p = memchr(string, c, len); 295| 94.1k| if (p) { ------------------ | Branch (295:9): [True: 50.3k, False: 43.8k] ------------------ 296| 50.3k| return (p - string); 297| 50.3k| } 298| | 299| 43.8k| return -1; 300| 94.1k|} mk_string_copy_substr: 591| 4.08k|{ 592| 4.08k| unsigned int size, bytes; 593| 4.08k| char *buffer = 0; 594| | 595| 4.08k| if (pos_init > pos_end) { ------------------ | Branch (595:9): [True: 0, False: 4.08k] ------------------ 596| 0| return NULL; 597| 0| } 598| | 599| 4.08k| size = (unsigned int) (pos_end - pos_init) + 1; 600| 4.08k| if (size <= 2) { ------------------ | Branch (600:9): [True: 2.04k, False: 2.04k] ------------------ 601| 2.04k| size = 4; 602| 2.04k| } 603| | 604| 4.08k| buffer = mk_mem_alloc(size); 605| | 606| 4.08k| if (!buffer) { ------------------ | Branch (606:9): [True: 0, False: 4.08k] ------------------ 607| 0| return NULL; 608| 0| } 609| | 610| 4.08k| bytes = pos_end - pos_init; 611| 4.08k| memcpy(buffer, string + pos_init, bytes); 612| 4.08k| buffer[bytes] = '\0'; 613| | 614| 4.08k| return (char *) buffer; 615| 4.08k|} onigenc_unicode_is_code_ctype: 183| 59.9k|{ 184| 59.9k| if ( 185| 59.9k|#ifdef USE_UNICODE_PROPERTIES 186| 59.9k| ctype <= ONIGENC_MAX_STD_CTYPE && ------------------ | | 309| 59.9k|#define ONIGENC_MAX_STD_CTYPE ONIGENC_CTYPE_ASCII | | ------------------ | | | | 308| 119k|#define ONIGENC_CTYPE_ASCII 14 | | ------------------ ------------------ | Branch (186:7): [True: 59.9k, False: 0] ------------------ 187| 59.9k|#endif 188| 59.9k| code < 256) { ------------------ | Branch (188:7): [True: 59.9k, False: 0] ------------------ 189| 59.9k| return ONIGENC_IS_UNICODE_ISO_8859_1_CTYPE(code, ctype); ------------------ | | 33| 59.9k| ((EncUNICODE_ISO_8859_1_CtypeTable[code] & CTYPE_TO_BIT(ctype)) != 0) | | ------------------ | | | | 113| 59.9k|#define CTYPE_TO_BIT(ctype) (1<<(ctype)) | | ------------------ ------------------ 190| 59.9k| } 191| | 192| 0| if (ctype >= CODE_RANGES_NUM) { ------------------ | | 179| 0|#define CODE_RANGES_NUM numberof(CodeRanges) | | ------------------ | | | | 129| 0|# define numberof(array) (int )(sizeof(array) / sizeof((array)[0])) | | ------------------ ------------------ | Branch (192:7): [True: 0, False: 0] ------------------ 193| 0| return ONIGERR_TYPE_BUG; ------------------ | | 633| 0|#define ONIGERR_TYPE_BUG -6 ------------------ 194| 0| } 195| | 196| 0| return onig_is_in_code_range((UChar* )CodeRanges[ctype], code); 197| 0|} onigenc_unicode_ctype_code_range: 202| 24.3k|{ 203| 24.3k| if (ctype >= CODE_RANGES_NUM) { ------------------ | | 179| 24.3k|#define CODE_RANGES_NUM numberof(CodeRanges) | | ------------------ | | | | 129| 24.3k|# define numberof(array) (int )(sizeof(array) / sizeof((array)[0])) | | ------------------ ------------------ | Branch (203:7): [True: 0, False: 24.3k] ------------------ 204| 0| return ONIGERR_TYPE_BUG; ------------------ | | 633| 0|#define ONIGERR_TYPE_BUG -6 ------------------ 205| 0| } 206| | 207| 24.3k| *ranges = CodeRanges[ctype]; 208| | 209| 24.3k| return 0; 210| 24.3k|} utf_8.c:mbc_enc_len: 317| 4.80M|{ 318| 4.80M| int firstbyte = *p++; 319| 4.80M| state_t s; 320| 4.80M| s = trans[0][firstbyte]; 321| 4.80M| if (s < 0) return s == ACCEPT ? ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(1) : ------------------ | | 345| 4.80M|#define ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(n) (n) ------------------ | Branch (321:7): [True: 4.80M, False: 0] | Branch (321:21): [True: 4.80M, False: 0] ------------------ 322| 4.80M| ONIGENC_CONSTRUCT_MBCLEN_INVALID(); ------------------ | | 349| 0|#define ONIGENC_CONSTRUCT_MBCLEN_INVALID() (-1) ------------------ 323| | 324| 0| if (p == e) return ONIGENC_CONSTRUCT_MBCLEN_NEEDMORE(EncLen_UTF8[firstbyte]-1); ------------------ | | 352| 0|#define ONIGENC_CONSTRUCT_MBCLEN_NEEDMORE(n) (-1-(n)) ------------------ | Branch (324:7): [True: 0, False: 0] ------------------ 325| 0| s = trans[s][*p++]; 326| 0| if (s < 0) return s == ACCEPT ? ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(2) : ------------------ | | 345| 0|#define ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(n) (n) ------------------ | Branch (326:7): [True: 0, False: 0] | Branch (326:21): [True: 0, False: 0] ------------------ 327| 0| ONIGENC_CONSTRUCT_MBCLEN_INVALID(); ------------------ | | 349| 0|#define ONIGENC_CONSTRUCT_MBCLEN_INVALID() (-1) ------------------ 328| | 329| 0| if (p == e) return ONIGENC_CONSTRUCT_MBCLEN_NEEDMORE(EncLen_UTF8[firstbyte]-2); ------------------ | | 352| 0|#define ONIGENC_CONSTRUCT_MBCLEN_NEEDMORE(n) (-1-(n)) ------------------ | Branch (329:7): [True: 0, False: 0] ------------------ 330| 0| s = trans[s][*p++]; 331| 0| if (s < 0) return s == ACCEPT ? ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(3) : ------------------ | | 345| 0|#define ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(n) (n) ------------------ | Branch (331:7): [True: 0, False: 0] | Branch (331:21): [True: 0, False: 0] ------------------ 332| 0| ONIGENC_CONSTRUCT_MBCLEN_INVALID(); ------------------ | | 349| 0|#define ONIGENC_CONSTRUCT_MBCLEN_INVALID() (-1) ------------------ 333| | 334| 0| if (p == e) return ONIGENC_CONSTRUCT_MBCLEN_NEEDMORE(EncLen_UTF8[firstbyte]-3); ------------------ | | 352| 0|#define ONIGENC_CONSTRUCT_MBCLEN_NEEDMORE(n) (-1-(n)) ------------------ | Branch (334:7): [True: 0, False: 0] ------------------ 335| 0| s = trans[s][*p++]; 336| | 337| 0|#ifndef USE_UTF8_31BITS 338| 0| return s == ACCEPT ? ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(4) : ------------------ | | 345| 0|#define ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(n) (n) ------------------ | Branch (338:10): [True: 0, False: 0] ------------------ 339| 0| ONIGENC_CONSTRUCT_MBCLEN_INVALID(); ------------------ | | 349| 0|#define ONIGENC_CONSTRUCT_MBCLEN_INVALID() (-1) ------------------ 340| |#else 341| | if (s < 0) return s == ACCEPT ? ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(4) : 342| | ONIGENC_CONSTRUCT_MBCLEN_INVALID(); 343| | 344| | if (p == e) return ONIGENC_CONSTRUCT_MBCLEN_NEEDMORE(EncLen_UTF8[firstbyte]-4); 345| | s = trans[s][*p++]; 346| | if (s < 0) return s == ACCEPT ? ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(5) : 347| | ONIGENC_CONSTRUCT_MBCLEN_INVALID(); 348| | 349| | if (p == e) return ONIGENC_CONSTRUCT_MBCLEN_NEEDMORE(EncLen_UTF8[firstbyte]-5); 350| | s = trans[s][*p++]; 351| | return s == ACCEPT ? ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(6) : 352| | ONIGENC_CONSTRUCT_MBCLEN_INVALID(); 353| |#endif 354| 0|} utf_8.c:mbc_to_code: 381| 1.48M|{ 382| 1.48M| int c, len; 383| 1.48M| OnigCodePoint n; 384| | 385| 1.48M| len = mbc_enc_len(p, end, enc); 386| 1.48M| c = *p++; 387| 1.48M| if (len > 1) { ------------------ | Branch (387:7): [True: 0, False: 1.48M] ------------------ 388| 0| len--; 389| 0| n = c & ((1 << (6 - len)) - 1); 390| 0| while (len--) { ------------------ | Branch (390:12): [True: 0, False: 0] ------------------ 391| 0| c = *p++; 392| 0| n = (n << 6) | (c & ((1 << 6) - 1)); 393| 0| } 394| 0| return n; 395| 0| } 396| 1.48M| else { 397| 1.48M|#ifdef USE_INVALID_CODE_SCHEME 398| 1.48M| if (c > 0xfd) { ------------------ | Branch (398:9): [True: 0, False: 1.48M] ------------------ 399| 0| return ((c == 0xfe) ? INVALID_CODE_FE : INVALID_CODE_FF); ------------------ | | 44| 0|# define INVALID_CODE_FE 0xfffffffe ------------------ return ((c == 0xfe) ? INVALID_CODE_FE : INVALID_CODE_FF); ------------------ | | 45| 0|# define INVALID_CODE_FF 0xffffffff ------------------ | Branch (399:15): [True: 0, False: 0] ------------------ 400| 0| } 401| 1.48M|#endif 402| 1.48M| return (OnigCodePoint )c; 403| 1.48M| } 404| 1.48M|} utf_8.c:code_to_mbclen: 408| 93.3k|{ 409| 93.3k| if ((code & 0xffffff80) == 0) return 1; ------------------ | Branch (409:12): [True: 93.3k, False: 0] ------------------ 410| 0| else if ((code & 0xfffff800) == 0) return 2; ------------------ | Branch (410:12): [True: 0, False: 0] ------------------ 411| 0| else if ((code & 0xffff0000) == 0) return 3; ------------------ | Branch (411:12): [True: 0, False: 0] ------------------ 412| 0|#ifndef USE_UTF8_31BITS 413| 0| else if (code <= VALID_CODE_LIMIT) return 4; ------------------ | | 49| 0|#define VALID_CODE_LIMIT 0x0010ffff ------------------ | Branch (413:12): [True: 0, False: 0] ------------------ 414| |#else 415| | else if ((code & 0xffe00000) == 0) return 4; 416| | else if ((code & 0xfc000000) == 0) return 5; 417| | else if (code <= VALID_CODE_LIMIT) return 6; 418| |#endif 419| 0|#ifdef USE_INVALID_CODE_SCHEME 420| 0| else if (code == INVALID_CODE_FE) return 1; ------------------ | | 44| 0|# define INVALID_CODE_FE 0xfffffffe ------------------ | Branch (420:12): [True: 0, False: 0] ------------------ 421| 0| else if (code == INVALID_CODE_FF) return 1; ------------------ | | 45| 0|# define INVALID_CODE_FF 0xffffffff ------------------ | Branch (421:12): [True: 0, False: 0] ------------------ 422| 0|#endif 423| 0| else 424| 0| return ONIGERR_TOO_BIG_WIDE_CHAR_VALUE; ------------------ | | 694| 0|#define ONIGERR_TOO_BIG_WIDE_CHAR_VALUE -401 ------------------ 425| 93.3k|} utf_8.c:get_ctype_code_range: 524| 24.3k|{ 525| 24.3k| *sb_out = 0x80; 526| 24.3k| return onigenc_unicode_ctype_code_range(ctype, ranges); 527| 24.3k|} onig_bbuf_init: 143| 68.3k|{ 144| 68.3k| if (size <= 0) { ------------------ | Branch (144:7): [True: 0, False: 68.3k] ------------------ 145| 0| size = 0; 146| 0| buf->p = NULL; 147| 0| } 148| 68.3k| else { 149| 68.3k| buf->p = (UChar* )xmalloc(size); ------------------ | | 142| 68.3k|# define xmalloc malloc ------------------ 150| 68.3k| if (IS_NULL(buf->p)) return(ONIGERR_MEMORY); ------------------ | | 311| 68.3k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 68.3k] | | ------------------ ------------------ if (IS_NULL(buf->p)) return(ONIGERR_MEMORY); ------------------ | | 632| 0|#define ONIGERR_MEMORY -5 ------------------ 151| 68.3k| } 152| | 153| 68.3k| buf->alloc = (unsigned int )size; 154| 68.3k| buf->used = 0; 155| 68.3k| return 0; 156| 68.3k|} onig_free_body: 5535| 44.0k|{ 5536| 44.0k| if (IS_NOT_NULL(reg)) { ------------------ | | 312| 44.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 44.0k, False: 0] | | ------------------ ------------------ 5537| 44.0k| if (IS_NOT_NULL(reg->p)) xfree(reg->p); ------------------ | | 312| 44.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 44.0k, False: 0] | | ------------------ ------------------ if (IS_NOT_NULL(reg->p)) xfree(reg->p); ------------------ | | 145| 44.0k|# define xfree free ------------------ 5538| 44.0k| if (IS_NOT_NULL(reg->exact)) xfree(reg->exact); ------------------ | | 312| 44.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 21.0k, False: 22.9k] | | ------------------ ------------------ if (IS_NOT_NULL(reg->exact)) xfree(reg->exact); ------------------ | | 145| 21.0k|# define xfree free ------------------ 5539| 44.0k| if (IS_NOT_NULL(reg->repeat_range)) xfree(reg->repeat_range); ------------------ | | 312| 44.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 44.0k] | | ------------------ ------------------ if (IS_NOT_NULL(reg->repeat_range)) xfree(reg->repeat_range); ------------------ | | 145| 0|# define xfree free ------------------ 5540| 44.0k| if (IS_NOT_NULL(reg->chain)) onig_free(reg->chain); ------------------ | | 312| 44.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 44.0k] | | ------------------ ------------------ 5541| | 5542| 44.0k|#ifdef USE_NAMED_GROUP 5543| 44.0k| onig_names_free(reg); 5544| 44.0k|#endif 5545| 44.0k| } 5546| 44.0k|} onig_free: 5550| 44.0k|{ 5551| 44.0k| if (IS_NOT_NULL(reg)) { ------------------ | | 312| 44.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 44.0k, False: 0] | | ------------------ ------------------ 5552| 44.0k| onig_free_body(reg); 5553| 44.0k| xfree(reg); ------------------ | | 145| 44.0k|# define xfree free ------------------ 5554| 44.0k| } 5555| 44.0k|} onig_compile: 5620| 44.0k|{ 5621| 44.0k|#define COMPILE_INIT_SIZE 20 5622| | 5623| 44.0k| int r; 5624| 44.0k| OnigDistance init_size; 5625| 44.0k| Node* root; 5626| 44.0k| ScanEnv scan_env = {0}; 5627| 44.0k|#ifdef USE_SUBEXP_CALL 5628| 44.0k| UnsetAddrList uslist; 5629| 44.0k|#endif 5630| | 5631| 44.0k| if (IS_NOT_NULL(einfo)) einfo->par = (UChar* )NULL; ------------------ | | 312| 44.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 44.0k, False: 0] | | ------------------ ------------------ 5632| | 5633| |#ifdef RUBY 5634| | scan_env.sourcefile = sourcefile; 5635| | scan_env.sourceline = sourceline; 5636| |#endif 5637| | 5638| |#ifdef ONIG_DEBUG 5639| | print_enc_string(stderr, reg->enc, pattern, pattern_end); 5640| |#endif 5641| | 5642| 44.0k| if (reg->alloc == 0) { ------------------ | Branch (5642:7): [True: 44.0k, False: 0] ------------------ 5643| 44.0k| init_size = (pattern_end - pattern) * 2; 5644| 44.0k| if (init_size <= 0) init_size = COMPILE_INIT_SIZE; ------------------ | | 5621| 0|#define COMPILE_INIT_SIZE 20 ------------------ | Branch (5644:9): [True: 0, False: 44.0k] ------------------ 5645| 44.0k| r = BBUF_INIT(reg, init_size); ------------------ | | 460| 44.0k|#define BBUF_INIT(buf,size) onig_bbuf_init((BBuf* )(buf), (size)) ------------------ 5646| 44.0k| if (r != 0) goto end; ------------------ | Branch (5646:9): [True: 0, False: 44.0k] ------------------ 5647| 44.0k| } 5648| 0| else 5649| 0| reg->used = 0; 5650| | 5651| 44.0k| reg->num_mem = 0; 5652| 44.0k| reg->num_repeat = 0; 5653| 44.0k| reg->num_null_check = 0; 5654| 44.0k| reg->repeat_range_alloc = 0; 5655| 44.0k| reg->repeat_range = (OnigRepeatRange* )NULL; 5656| |#ifdef USE_COMBINATION_EXPLOSION_CHECK 5657| | reg->num_comb_exp_check = 0; 5658| |#endif 5659| | 5660| 44.0k| r = onig_parse_make_tree(&root, pattern, pattern_end, reg, &scan_env); 5661| 44.0k| if (r != 0) goto err; ------------------ | Branch (5661:7): [True: 0, False: 44.0k] ------------------ 5662| | 5663| |#ifdef ONIG_DEBUG_PARSE_TREE 5664| |# if 0 5665| | fprintf(stderr, "ORIGINAL PARSE TREE:\n"); 5666| | print_tree(stderr, root); 5667| |# endif 5668| |#endif 5669| | 5670| 44.0k|#ifdef USE_NAMED_GROUP 5671| | /* mixed use named group and no-named group */ 5672| 44.0k| if (scan_env.num_named > 0 && ------------------ | Branch (5672:7): [True: 2.01k, False: 42.0k] ------------------ 5673| 44.0k| IS_SYNTAX_BV(scan_env.syntax, ONIG_SYN_CAPTURE_ONLY_NAMED_GROUP) && ------------------ | | 332| 46.0k|#define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0) | | ------------------ | | | Branch (332:35): [True: 2.01k, False: 0] | | ------------------ ------------------ 5674| 44.0k| !ONIG_IS_OPTION_ON(reg->options, ONIG_OPTION_CAPTURE_GROUP)) { ------------------ | | 479| 2.01k|#define ONIG_IS_OPTION_ON(options,option) ((options) & (option)) ------------------ | Branch (5674:7): [True: 2.01k, False: 0] ------------------ 5675| 2.01k| if (scan_env.num_named != scan_env.num_mem) ------------------ | Branch (5675:9): [True: 0, False: 2.01k] ------------------ 5676| 0| r = disable_noname_group_capture(&root, reg, &scan_env); 5677| 2.01k| else 5678| 2.01k| r = numbered_ref_check(root); 5679| | 5680| 2.01k| if (r != 0) goto err; ------------------ | Branch (5680:9): [True: 0, False: 2.01k] ------------------ 5681| 2.01k| } 5682| 44.0k|#endif 5683| | 5684| 44.0k|#ifdef USE_SUBEXP_CALL 5685| 44.0k| if (scan_env.num_call > 0) { ------------------ | Branch (5685:7): [True: 0, False: 44.0k] ------------------ 5686| 0| r = unset_addr_list_init(&uslist, scan_env.num_call); 5687| 0| if (r != 0) goto err; ------------------ | Branch (5687:9): [True: 0, False: 0] ------------------ 5688| 0| scan_env.unset_addr_list = &uslist; 5689| 0| r = setup_subexp_call(root, &scan_env); 5690| 0| if (r != 0) goto err_unset; ------------------ | Branch (5690:9): [True: 0, False: 0] ------------------ 5691| 0| r = subexp_recursive_check_trav(root, &scan_env); 5692| 0| if (r < 0) goto err_unset; ------------------ | Branch (5692:9): [True: 0, False: 0] ------------------ 5693| 0| r = subexp_inf_recursive_check_trav(root, &scan_env); 5694| 0| if (r != 0) goto err_unset; ------------------ | Branch (5694:9): [True: 0, False: 0] ------------------ 5695| | 5696| 0| reg->num_call = scan_env.num_call; 5697| 0| } 5698| 44.0k| else 5699| 44.0k| reg->num_call = 0; 5700| 44.0k|#endif 5701| | 5702| 44.0k| r = setup_tree(root, reg, 0, &scan_env); 5703| 44.0k| if (r != 0) goto err_unset; ------------------ | Branch (5703:7): [True: 0, False: 44.0k] ------------------ 5704| | 5705| |#ifdef ONIG_DEBUG_PARSE_TREE 5706| | print_tree(stderr, root); 5707| |#endif 5708| | 5709| 44.0k| reg->capture_history = scan_env.capture_history; 5710| 44.0k| reg->bt_mem_start = scan_env.bt_mem_start; 5711| 44.0k| reg->bt_mem_start |= reg->capture_history; 5712| 44.0k| if (IS_FIND_CONDITION(reg->options)) ------------------ | | 400| 44.0k|#define IS_FIND_CONDITION(option) ((option) & \ | | ------------------ | | | Branch (400:35): [True: 0, False: 44.0k] | | ------------------ | | 401| 44.0k| (ONIG_OPTION_FIND_LONGEST | ONIG_OPTION_FIND_NOT_EMPTY)) | | ------------------ | | | | 459| 44.0k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | ------------------ | | | | | | 458| 44.0k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | ------------------ | | | | | | | | 456| 44.0k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | ------------------ | | | | | | | | | | 455| 44.0k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 454| 44.0k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ | | (ONIG_OPTION_FIND_LONGEST | ONIG_OPTION_FIND_NOT_EMPTY)) | | ------------------ | | | | 460| 44.0k|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | ------------------ | | | | | | 459| 44.0k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | ------------------ | | | | | | | | 458| 44.0k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | ------------------ | | | | | | | | | | 456| 44.0k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 455| 44.0k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 454| 44.0k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 5713| 0| BIT_STATUS_ON_ALL(reg->bt_mem_end); ------------------ | | 369| 0|#define BIT_STATUS_ON_ALL(stats) (stats) = ~((BitStatusType )0) ------------------ 5714| 44.0k| else { 5715| 44.0k| reg->bt_mem_end = scan_env.bt_mem_end; 5716| 44.0k| reg->bt_mem_end |= reg->capture_history; 5717| 44.0k| } 5718| | 5719| |#ifdef USE_COMBINATION_EXPLOSION_CHECK 5720| | if (scan_env.backrefed_mem == 0 5721| |# ifdef USE_SUBEXP_CALL 5722| | || scan_env.num_call == 0 5723| |# endif 5724| | ) { 5725| | setup_comb_exp_check(root, 0, &scan_env); 5726| |# ifdef USE_SUBEXP_CALL 5727| | if (scan_env.has_recursion != 0) { 5728| | scan_env.num_comb_exp_check = 0; 5729| | } 5730| | else 5731| |# endif 5732| | if (scan_env.comb_exp_max_regnum > 0) { 5733| | int i; 5734| | for (i = 1; i <= scan_env.comb_exp_max_regnum; i++) { 5735| | if (BIT_STATUS_AT(scan_env.backrefed_mem, i) != 0) { 5736| | scan_env.num_comb_exp_check = 0; 5737| | break; 5738| | } 5739| | } 5740| | } 5741| | } 5742| | 5743| | reg->num_comb_exp_check = scan_env.num_comb_exp_check; 5744| |#endif 5745| | 5746| 44.0k| clear_optimize_info(reg); 5747| 44.0k|#ifndef ONIG_DONT_OPTIMIZE 5748| 44.0k| r = set_optimize_info_from_tree(root, reg, &scan_env); 5749| 44.0k| if (r != 0) goto err_unset; ------------------ | Branch (5749:7): [True: 0, False: 44.0k] ------------------ 5750| 44.0k|#endif 5751| | 5752| 44.0k| if (IS_NOT_NULL(scan_env.mem_nodes_dynamic)) { ------------------ | | 312| 44.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 44.0k] | | ------------------ ------------------ 5753| 0| xfree(scan_env.mem_nodes_dynamic); ------------------ | | 145| 0|# define xfree free ------------------ 5754| 0| scan_env.mem_nodes_dynamic = (Node** )NULL; 5755| 0| } 5756| | 5757| 44.0k| r = compile_tree(root, reg); 5758| 44.0k| if (r == 0) { ------------------ | Branch (5758:7): [True: 44.0k, False: 0] ------------------ 5759| 44.0k| r = add_opcode(reg, OP_END); 5760| 44.0k|#ifdef USE_SUBEXP_CALL 5761| 44.0k| if (scan_env.num_call > 0) { ------------------ | Branch (5761:9): [True: 0, False: 44.0k] ------------------ 5762| 0| r = unset_addr_list_fix(&uslist, reg); 5763| 0| unset_addr_list_end(&uslist); 5764| 0| if (r) goto err; ------------------ | Branch (5764:11): [True: 0, False: 0] ------------------ 5765| 0| } 5766| 44.0k|#endif 5767| | 5768| 44.0k| if ((reg->num_repeat != 0) || (reg->bt_mem_end != 0)) ------------------ | Branch (5768:9): [True: 0, False: 44.0k] | Branch (5768:35): [True: 0, False: 44.0k] ------------------ 5769| 0| reg->stack_pop_level = STACK_POP_LEVEL_ALL; ------------------ | | 352| 0|#define STACK_POP_LEVEL_ALL 2 ------------------ 5770| 44.0k| else { 5771| 44.0k| if (reg->bt_mem_start != 0) ------------------ | Branch (5771:11): [True: 0, False: 44.0k] ------------------ 5772| 0| reg->stack_pop_level = STACK_POP_LEVEL_MEM_START; ------------------ | | 351| 0|#define STACK_POP_LEVEL_MEM_START 1 ------------------ 5773| 44.0k| else 5774| 44.0k| reg->stack_pop_level = STACK_POP_LEVEL_FREE; ------------------ | | 350| 44.0k|#define STACK_POP_LEVEL_FREE 0 ------------------ 5775| 44.0k| } 5776| 44.0k| } 5777| 0|#ifdef USE_SUBEXP_CALL 5778| 0| else if (scan_env.num_call > 0) { ------------------ | Branch (5778:12): [True: 0, False: 0] ------------------ 5779| 0| unset_addr_list_end(&uslist); 5780| 0| } 5781| 44.0k|#endif 5782| 44.0k| onig_node_free(root); 5783| | 5784| |#ifdef ONIG_DEBUG_COMPILE 5785| |# ifdef USE_NAMED_GROUP 5786| | onig_print_names(stderr, reg); 5787| |# endif 5788| | print_compiled_byte_code_list(stderr, reg); 5789| |#endif 5790| | 5791| 44.0k| end: 5792| 44.0k| return r; 5793| | 5794| 0| err_unset: 5795| 0|#ifdef USE_SUBEXP_CALL 5796| 0| if (scan_env.num_call > 0) { ------------------ | Branch (5796:7): [True: 0, False: 0] ------------------ 5797| 0| unset_addr_list_end(&uslist); 5798| 0| } 5799| 0|#endif 5800| 0| err: 5801| 0| if (IS_NOT_NULL(scan_env.error)) { ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ 5802| 0| if (IS_NOT_NULL(einfo)) { ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ 5803| 0| einfo->enc = scan_env.enc; 5804| 0| einfo->par = scan_env.error; 5805| 0| einfo->par_end = scan_env.error_end; 5806| 0| } 5807| 0| } 5808| | 5809| 0| onig_node_free(root); 5810| 0| if (IS_NOT_NULL(scan_env.mem_nodes_dynamic)) ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ 5811| 0| xfree(scan_env.mem_nodes_dynamic); ------------------ | | 145| 0|# define xfree free ------------------ 5812| 0| return r; 5813| 0|} onig_reg_init: 5821| 44.0k|{ 5822| 44.0k| if (! onig_inited) ------------------ | Branch (5822:7): [True: 1, False: 44.0k] ------------------ 5823| 1| onig_init(); 5824| | 5825| 44.0k| if (IS_NULL(reg)) ------------------ | | 311| 44.0k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 44.0k] | | ------------------ ------------------ 5826| 0| return ONIGERR_INVALID_ARGUMENT; ------------------ | | 643| 0|#define ONIGERR_INVALID_ARGUMENT -30 ------------------ 5827| | 5828| 44.0k| (reg)->exact = (UChar* )NULL; 5829| 44.0k| (reg)->chain = (regex_t* )NULL; 5830| 44.0k| (reg)->p = (UChar* )NULL; 5831| 44.0k| (reg)->name_table = (void* )NULL; 5832| 44.0k| (reg)->repeat_range = (OnigRepeatRange* )NULL; 5833| | 5834| 44.0k| if (ONIGENC_IS_UNDEF(enc)) ------------------ | | 317| 44.0k|#define ONIGENC_IS_UNDEF(enc) ((enc) == ONIG_ENCODING_UNDEF) | | ------------------ | | | | 281| 44.0k|#define ONIG_ENCODING_UNDEF ((OnigEncoding )0) | | ------------------ | | | Branch (317:40): [True: 0, False: 44.0k] | | ------------------ ------------------ 5835| 0| return ONIGERR_DEFAULT_ENCODING_IS_NOT_SET; ------------------ | | 640| 0|#define ONIGERR_DEFAULT_ENCODING_IS_NOT_SET -21 ------------------ 5836| | 5837| 44.0k| if ((option & (ONIG_OPTION_DONT_CAPTURE_GROUP|ONIG_OPTION_CAPTURE_GROUP)) ------------------ | | 462| 44.0k|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | ------------------ | | | | 461| 44.0k|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | ------------------ | | | | | | 460| 44.0k|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | ------------------ | | | | | | | | 459| 44.0k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | ------------------ | | | | | | | | | | 458| 44.0k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 456| 44.0k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 455| 44.0k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 454| 44.0k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ if ((option & (ONIG_OPTION_DONT_CAPTURE_GROUP|ONIG_OPTION_CAPTURE_GROUP)) ------------------ | | 463| 44.0k|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | ------------------ | | | | 462| 44.0k|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | ------------------ | | | | | | 461| 44.0k|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | ------------------ | | | | | | | | 460| 44.0k|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | ------------------ | | | | | | | | | | 459| 44.0k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 458| 44.0k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 456| 44.0k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 455| 44.0k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 454| 44.0k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ | Branch (5837:7): [True: 0, False: 44.0k] ------------------ 5838| 44.0k| == (ONIG_OPTION_DONT_CAPTURE_GROUP|ONIG_OPTION_CAPTURE_GROUP)) { ------------------ | | 462| 44.0k|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | ------------------ | | | | 461| 44.0k|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | ------------------ | | | | | | 460| 44.0k|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | ------------------ | | | | | | | | 459| 44.0k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | ------------------ | | | | | | | | | | 458| 44.0k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 456| 44.0k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 455| 44.0k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 454| 44.0k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ == (ONIG_OPTION_DONT_CAPTURE_GROUP|ONIG_OPTION_CAPTURE_GROUP)) { ------------------ | | 463| 44.0k|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | ------------------ | | | | 462| 44.0k|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | ------------------ | | | | | | 461| 44.0k|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | ------------------ | | | | | | | | 460| 44.0k|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | ------------------ | | | | | | | | | | 459| 44.0k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 458| 44.0k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 456| 44.0k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 455| 44.0k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 454| 44.0k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 5839| 0| return ONIGERR_INVALID_COMBINATION_OF_OPTIONS; ------------------ | | 696| 0|#define ONIGERR_INVALID_COMBINATION_OF_OPTIONS -403 ------------------ 5840| 0| } 5841| | 5842| 44.0k| if ((option & ONIG_OPTION_NEGATE_SINGLELINE) != 0) { ------------------ | | 461| 44.0k|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | ------------------ | | | | 460| 44.0k|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | ------------------ | | | | | | 459| 44.0k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | ------------------ | | | | | | | | 458| 44.0k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | ------------------ | | | | | | | | | | 456| 44.0k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 455| 44.0k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 454| 44.0k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ | Branch (5842:7): [True: 0, False: 44.0k] ------------------ 5843| 0| option |= syntax->options; 5844| 0| option &= ~ONIG_OPTION_SINGLELINE; ------------------ | | 458| 0|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | ------------------ | | | | 456| 0|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | ------------------ | | | | | | 455| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | ------------------ | | | | | | | | 454| 0|#define ONIG_OPTION_IGNORECASE 1U | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 5845| 0| } 5846| 44.0k| else 5847| 44.0k| option |= syntax->options; 5848| | 5849| 44.0k| (reg)->enc = enc; 5850| 44.0k| (reg)->options = option; 5851| 44.0k| (reg)->syntax = syntax; 5852| 44.0k| (reg)->optimize = 0; 5853| | 5854| 44.0k| (reg)->alloc = 0; 5855| 44.0k| (reg)->used = 0; 5856| | 5857| 44.0k| (reg)->case_fold_flag = case_fold_flag; 5858| 44.0k| return 0; 5859| 44.0k|} onig_new: 5879| 44.0k|{ 5880| 44.0k| int r; 5881| | 5882| 44.0k| *reg = (regex_t* )xmalloc(sizeof(regex_t)); ------------------ | | 142| 44.0k|# define xmalloc malloc ------------------ 5883| 44.0k| if (IS_NULL(*reg)) return ONIGERR_MEMORY; ------------------ | | 311| 44.0k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 44.0k] | | ------------------ ------------------ if (IS_NULL(*reg)) return ONIGERR_MEMORY; ------------------ | | 632| 0|#define ONIGERR_MEMORY -5 ------------------ 5884| | 5885| 44.0k| r = onig_reg_init(*reg, option, ONIGENC_CASE_FOLD_DEFAULT, enc, syntax); ------------------ | | 131| 44.0k|#define ONIGENC_CASE_FOLD_DEFAULT OnigDefaultCaseFoldFlag ------------------ 5886| 44.0k| if (r) goto err; ------------------ | Branch (5886:7): [True: 0, False: 44.0k] ------------------ 5887| | 5888| 44.0k| r = onig_compile(*reg, pattern, pattern_end, einfo); 5889| 44.0k| if (r) { ------------------ | Branch (5889:7): [True: 0, False: 44.0k] ------------------ 5890| 0| err: 5891| 0| onig_free(*reg); 5892| 0| *reg = NULL; 5893| 0| } 5894| 44.0k| return r; 5895| 44.0k|} onig_init: 5905| 1.73k|{ 5906| 1.73k| if (onig_inited != 0) ------------------ | Branch (5906:7): [True: 1.73k, False: 1] ------------------ 5907| 1.73k| return 0; 5908| | 5909| 1| onig_inited = 1; 5910| | 5911| |#if defined(ONIG_DEBUG_MEMLEAK) && defined(_MSC_VER) 5912| | _CrtSetDbgFlag(_CRTDBG_ALLOC_MEM_DF | _CRTDBG_LEAK_CHECK_DF); 5913| |#endif 5914| | 5915| 1| onigenc_init(); 5916| | /* onigenc_set_default_caseconv_table((UChar* )0); */ 5917| | 5918| |#ifdef ONIG_DEBUG_STATISTICS 5919| | onig_statistics_init(); 5920| |#endif 5921| | 5922| 1| return 0; 5923| 1.73k|} onig_is_code_in_cc_len: 5998| 24.5k|{ 5999| 24.5k| int found; 6000| | 6001| 24.5k| if (elen > 1 || (code >= SINGLE_BYTE_SIZE)) { ------------------ | | 426| 24.5k|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 425| 24.5k|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (6001:7): [True: 0, False: 24.5k] | Branch (6001:19): [True: 0, False: 24.5k] ------------------ 6002| 0| if (IS_NULL(cc->mbuf)) { ------------------ | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 0] | | ------------------ ------------------ 6003| 0| found = 0; 6004| 0| } 6005| 0| else { 6006| 0| found = (onig_is_in_code_range(cc->mbuf->p, code) != 0 ? 1 : 0); ------------------ | Branch (6006:16): [True: 0, False: 0] ------------------ 6007| 0| } 6008| 0| } 6009| 24.5k| else { 6010| 24.5k| found = (BITSET_AT(cc->bs, code) == 0 ? 0 : 1); ------------------ | | 448| 24.5k|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 445| 24.5k|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 24.5k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 24.5k|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 446| 24.5k|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 24.5k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 24.5k|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ | Branch (6010:14): [True: 15.2k, False: 9.32k] ------------------ 6011| 24.5k| } 6012| | 6013| 24.5k| if (IS_NCCLASS_NOT(cc)) ------------------ | | 809| 24.5k|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 802| 24.5k|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 799| 24.5k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | | | | Branch (802:37): [True: 9.32k, False: 15.2k] | | | | ------------------ | | ------------------ ------------------ 6014| 9.32k| return !found; 6015| 15.2k| else 6016| 15.2k| return found; 6017| 24.5k|} onig_is_code_in_cc: 6021| 24.5k|{ 6022| 24.5k| int len; 6023| | 6024| 24.5k| if (ONIGENC_MBC_MINLEN(enc) > 1) { ------------------ | | 367| 24.5k|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) ------------------ | Branch (6024:7): [True: 0, False: 24.5k] ------------------ 6025| 0| len = 2; 6026| 0| } 6027| 24.5k| else { 6028| 24.5k| len = ONIGENC_CODE_TO_MBCLEN(enc, code); ------------------ | | 370| 24.5k|#define ONIGENC_CODE_TO_MBCLEN(enc,code) (enc)->code_to_mbclen(code,enc) ------------------ 6029| 24.5k| } 6030| 24.5k| return onig_is_code_in_cc_len(len, code, cc); 6031| 24.5k|} regcomp.c:numbered_ref_check: 1989| 40.3k|{ 1990| 40.3k| int r = 0; 1991| | 1992| 40.3k| switch (NTYPE(node)) { ------------------ | | 69| 40.3k|#define NTYPE(node) ((node)->u.base.type) ------------------ 1993| 2.01k| case NT_LIST: ------------------ | | 46| 2.01k|#define NT_LIST 8 ------------------ | Branch (1993:3): [True: 2.01k, False: 38.3k] ------------------ 1994| 6.05k| case NT_ALT: ------------------ | | 47| 6.05k|#define NT_ALT 9 ------------------ | Branch (1994:3): [True: 4.03k, False: 36.3k] ------------------ 1995| 26.2k| do { 1996| 26.2k| r = numbered_ref_check(NCAR(node)); ------------------ | | 86| 26.2k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 26.2k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1997| 26.2k| } while (r == 0 && IS_NOT_NULL(node = NCDR(node))); ------------------ | | 312| 26.2k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 20.1k, False: 6.05k] | | ------------------ ------------------ | Branch (1997:14): [True: 26.2k, False: 0] ------------------ 1998| 6.05k| break; 1999| 4.03k| case NT_QTFR: ------------------ | | 43| 4.03k|#define NT_QTFR 5 ------------------ | Branch (1999:3): [True: 4.03k, False: 36.3k] ------------------ 2000| 4.03k| r = numbered_ref_check(NQTFR(node)->target); ------------------ | | 80| 4.03k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 2001| 4.03k| break; 2002| 8.06k| case NT_ENCLOSE: ------------------ | | 44| 8.06k|#define NT_ENCLOSE 6 ------------------ | Branch (2002:3): [True: 8.06k, False: 32.2k] ------------------ 2003| 8.06k| r = numbered_ref_check(NENCLOSE(node)->target); ------------------ | | 81| 8.06k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 2004| 8.06k| break; 2005| | 2006| 0| case NT_BREF: ------------------ | | 42| 0|#define NT_BREF 4 ------------------ | Branch (2006:3): [True: 0, False: 40.3k] ------------------ 2007| 0| if (! IS_BACKREF_NAME_REF(NBREF(node))) ------------------ | | 163| 0|#define IS_BACKREF_NAME_REF(bn) (((bn)->state & NST_NAME_REF) != 0) | | ------------------ | | | | 139| 0|#define NST_NAME_REF (1<<11) | | ------------------ ------------------ | Branch (2007:9): [True: 0, False: 0] ------------------ 2008| 0| return ONIGERR_NUMBERED_BACKREF_OR_CALL_NOT_ALLOWED; ------------------ | | 678| 0|#define ONIGERR_NUMBERED_BACKREF_OR_CALL_NOT_ALLOWED -209 ------------------ 2009| 0| break; 2010| | 2011| 4.03k| case NT_ANCHOR: ------------------ | | 45| 4.03k|#define NT_ANCHOR 7 ------------------ | Branch (2011:3): [True: 4.03k, False: 36.3k] ------------------ 2012| 4.03k| if (NANCHOR(node)->target) ------------------ | | 82| 4.03k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ | Branch (2012:9): [True: 0, False: 4.03k] ------------------ 2013| 0| r = numbered_ref_check(NANCHOR(node)->target); ------------------ | | 82| 0|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 2014| 4.03k| break; 2015| | 2016| 18.1k| default: ------------------ | Branch (2016:3): [True: 18.1k, False: 22.1k] ------------------ 2017| 18.1k| break; 2018| 40.3k| } 2019| | 2020| 40.3k| return r; 2021| 40.3k|} regcomp.c:get_min_match_length: 2157| 68.3k|{ 2158| 68.3k| OnigDistance tmin; 2159| 68.3k| int r = 0; 2160| | 2161| 68.3k| *min = 0; 2162| 68.3k| switch (NTYPE(node)) { ------------------ | | 69| 68.3k|#define NTYPE(node) ((node)->u.base.type) ------------------ 2163| 0| case NT_BREF: ------------------ | | 42| 0|#define NT_BREF 4 ------------------ | Branch (2163:3): [True: 0, False: 68.3k] ------------------ 2164| 0| { 2165| 0| int i; 2166| 0| int* backs; 2167| 0| Node** nodes = SCANENV_MEM_NODES(env); ------------------ | | 287| 0| (IS_NOT_NULL((senv)->mem_nodes_dynamic) ? \ | | ------------------ | | | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | | | ------------------ | | | | | Branch (312:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 288| 0| (senv)->mem_nodes_dynamic : (senv)->mem_nodes_static) ------------------ 2168| 0| BRefNode* br = NBREF(node); ------------------ | | 79| 0|#define NBREF(node) (&((node)->u.bref)) ------------------ 2169| 0| if (br->state & NST_RECURSION) break; ------------------ | | 135| 0|#define NST_RECURSION (1<<7) ------------------ | Branch (2169:11): [True: 0, False: 0] ------------------ 2170| | 2171| 0| backs = BACKREFS_P(br); ------------------ | | 120| 0| (IS_NOT_NULL((br)->back_dynamic) ? (br)->back_dynamic : (br)->back_static); | | ------------------ | | | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | | | ------------------ | | | | | Branch (312:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 2172| 0| if (backs[0] > env->num_mem) return ONIGERR_INVALID_BACKREF; ------------------ | | 677| 0|#define ONIGERR_INVALID_BACKREF -208 ------------------ | Branch (2172:11): [True: 0, False: 0] ------------------ 2173| 0| r = get_min_match_length(nodes[backs[0]], min, env); 2174| 0| if (r != 0) break; ------------------ | Branch (2174:11): [True: 0, False: 0] ------------------ 2175| 0| for (i = 1; i < br->back_num; i++) { ------------------ | Branch (2175:19): [True: 0, False: 0] ------------------ 2176| 0| if (backs[i] > env->num_mem) return ONIGERR_INVALID_BACKREF; ------------------ | | 677| 0|#define ONIGERR_INVALID_BACKREF -208 ------------------ | Branch (2176:6): [True: 0, False: 0] ------------------ 2177| 0| r = get_min_match_length(nodes[backs[i]], &tmin, env); 2178| 0| if (r != 0) break; ------------------ | Branch (2178:6): [True: 0, False: 0] ------------------ 2179| 0| if (*min > tmin) *min = tmin; ------------------ | Branch (2179:6): [True: 0, False: 0] ------------------ 2180| 0| } 2181| 0| } 2182| 0| break; 2183| | 2184| 0|#ifdef USE_SUBEXP_CALL 2185| 0| case NT_CALL: ------------------ | | 48| 0|#define NT_CALL 10 ------------------ | Branch (2185:3): [True: 0, False: 68.3k] ------------------ 2186| 0| if (IS_CALL_RECURSION(NCALL(node))) { ------------------ | | 161| 0|#define IS_CALL_RECURSION(cn) (((cn)->state & NST_RECURSION) != 0) | | ------------------ | | | | 135| 0|#define NST_RECURSION (1<<7) | | ------------------ | | | Branch (161:40): [True: 0, False: 0] | | ------------------ ------------------ 2187| 0| EncloseNode* en = NENCLOSE(NCALL(node)->target); ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 2188| 0| if (IS_ENCLOSE_MIN_FIXED(en)) ------------------ | | 152| 0|#define IS_ENCLOSE_MIN_FIXED(en) (((en)->state & NST_MIN_FIXED) != 0) | | ------------------ | | | | 128| 0|#define NST_MIN_FIXED (1<<0) | | ------------------ | | | Branch (152:40): [True: 0, False: 0] | | ------------------ ------------------ 2189| 0| *min = en->min_len; 2190| 0| } 2191| 0| else 2192| 0| r = get_min_match_length(NCALL(node)->target, min, env); ------------------ | | 84| 0|#define NCALL(node) (&((node)->u.call)) ------------------ 2193| 0| break; 2194| 0|#endif 2195| | 2196| 3.72k| case NT_LIST: ------------------ | | 46| 3.72k|#define NT_LIST 8 ------------------ | Branch (2196:3): [True: 3.72k, False: 64.5k] ------------------ 2197| 7.44k| do { 2198| 7.44k| r = get_min_match_length(NCAR(node), &tmin, env); ------------------ | | 86| 7.44k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 7.44k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 2199| 7.44k| if (r == 0) *min += tmin; ------------------ | Branch (2199:11): [True: 7.44k, False: 0] ------------------ 2200| 7.44k| } while (r == 0 && IS_NOT_NULL(node = NCDR(node))); ------------------ | | 312| 7.44k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 3.72k, False: 3.72k] | | ------------------ ------------------ | Branch (2200:14): [True: 7.44k, False: 0] ------------------ 2201| 3.72k| break; 2202| | 2203| 0| case NT_ALT: ------------------ | | 47| 0|#define NT_ALT 9 ------------------ | Branch (2203:3): [True: 0, False: 68.3k] ------------------ 2204| 0| { 2205| 0| Node *x, *y; 2206| 0| y = node; 2207| 0| do { 2208| 0| x = NCAR(y); ------------------ | | 86| 0|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 2209| 0| r = get_min_match_length(x, &tmin, env); 2210| 0| if (r != 0) break; ------------------ | Branch (2210:6): [True: 0, False: 0] ------------------ 2211| 0| if (y == node) *min = tmin; ------------------ | Branch (2211:6): [True: 0, False: 0] ------------------ 2212| 0| else if (*min > tmin) *min = tmin; ------------------ | Branch (2212:11): [True: 0, False: 0] ------------------ 2213| 0| } while (r == 0 && IS_NOT_NULL(y = NCDR(y))); ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ | Branch (2213:16): [True: 0, False: 0] ------------------ 2214| 0| } 2215| 0| break; 2216| | 2217| 5.68k| case NT_STR: ------------------ | | 38| 5.68k|#define NT_STR 0 ------------------ | Branch (2217:3): [True: 5.68k, False: 62.6k] ------------------ 2218| 5.68k| { 2219| 5.68k| StrNode* sn = NSTR(node); ------------------ | | 76| 5.68k|#define NSTR(node) (&((node)->u.str)) ------------------ 2220| 5.68k| *min = sn->end - sn->s; 2221| 5.68k| } 2222| 5.68k| break; 2223| | 2224| 0| case NT_CTYPE: ------------------ | | 40| 0|#define NT_CTYPE 2 ------------------ | Branch (2224:3): [True: 0, False: 68.3k] ------------------ 2225| 0| *min = 1; 2226| 0| break; 2227| | 2228| 43.6k| case NT_CCLASS: ------------------ | | 39| 43.6k|#define NT_CCLASS 1 ------------------ | Branch (2228:3): [True: 43.6k, False: 24.6k] ------------------ 2229| 55.1k| case NT_CANY: ------------------ | | 41| 55.1k|#define NT_CANY 3 ------------------ | Branch (2229:3): [True: 11.4k, False: 56.8k] ------------------ 2230| 55.1k| *min = 1; 2231| 55.1k| break; 2232| | 2233| 3.72k| case NT_QTFR: ------------------ | | 43| 3.72k|#define NT_QTFR 5 ------------------ | Branch (2233:3): [True: 3.72k, False: 64.5k] ------------------ 2234| 3.72k| { 2235| 3.72k| QtfrNode* qn = NQTFR(node); ------------------ | | 80| 3.72k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 2236| | 2237| 3.72k| if (qn->lower > 0) { ------------------ | Branch (2237:11): [True: 3.72k, False: 0] ------------------ 2238| 3.72k| r = get_min_match_length(qn->target, min, env); 2239| 3.72k| if (r == 0) ------------------ | Branch (2239:6): [True: 3.72k, False: 0] ------------------ 2240| 3.72k| *min = distance_multiply(*min, qn->lower); 2241| 3.72k| } 2242| 3.72k| } 2243| 3.72k| break; 2244| | 2245| 0| case NT_ENCLOSE: ------------------ | | 44| 0|#define NT_ENCLOSE 6 ------------------ | Branch (2245:3): [True: 0, False: 68.3k] ------------------ 2246| 0| { 2247| 0| EncloseNode* en = NENCLOSE(node); ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 2248| 0| switch (en->type) { ------------------ | Branch (2248:15): [True: 0, False: 0] ------------------ 2249| 0| case ENCLOSE_MEMORY: ------------------ | | 94| 0|#define ENCLOSE_MEMORY (1<<0) ------------------ | Branch (2249:7): [True: 0, False: 0] ------------------ 2250| 0| if (IS_ENCLOSE_MIN_FIXED(en)) ------------------ | | 152| 0|#define IS_ENCLOSE_MIN_FIXED(en) (((en)->state & NST_MIN_FIXED) != 0) | | ------------------ | | | | 128| 0|#define NST_MIN_FIXED (1<<0) | | ------------------ | | | Branch (152:40): [True: 0, False: 0] | | ------------------ ------------------ 2251| 0| *min = en->min_len; 2252| 0| else { 2253| 0| if (IS_ENCLOSE_MARK1(NENCLOSE(node))) ------------------ | | 150| 0|#define IS_ENCLOSE_MARK1(en) (((en)->state & NST_MARK1) != 0) | | ------------------ | | | | 131| 0|#define NST_MARK1 (1<<3) | | ------------------ | | | Branch (150:40): [True: 0, False: 0] | | ------------------ ------------------ 2254| 0| *min = 0; /* recursive */ 2255| 0| else { 2256| 0| SET_ENCLOSE_STATUS(node, NST_MARK1); ------------------ | | 144| 0|#define SET_ENCLOSE_STATUS(node,f) (node)->u.enclose.state |= (f) ------------------ 2257| 0| r = get_min_match_length(en->target, min, env); 2258| 0| CLEAR_ENCLOSE_STATUS(node, NST_MARK1); ------------------ | | 145| 0|#define CLEAR_ENCLOSE_STATUS(node,f) (node)->u.enclose.state &= ~(f) ------------------ 2259| 0| if (r == 0) { ------------------ | Branch (2259:10): [True: 0, False: 0] ------------------ 2260| 0| en->min_len = *min; 2261| 0| SET_ENCLOSE_STATUS(node, NST_MIN_FIXED); ------------------ | | 144| 0|#define SET_ENCLOSE_STATUS(node,f) (node)->u.enclose.state |= (f) ------------------ 2262| 0| } 2263| 0| } 2264| 0| } 2265| 0| break; 2266| | 2267| 0| case ENCLOSE_OPTION: ------------------ | | 95| 0|#define ENCLOSE_OPTION (1<<1) ------------------ | Branch (2267:7): [True: 0, False: 0] ------------------ 2268| 0| case ENCLOSE_STOP_BACKTRACK: ------------------ | | 96| 0|#define ENCLOSE_STOP_BACKTRACK (1<<2) ------------------ | Branch (2268:7): [True: 0, False: 0] ------------------ 2269| 0| case ENCLOSE_CONDITION: ------------------ | | 97| 0|#define ENCLOSE_CONDITION (1<<3) ------------------ | Branch (2269:7): [True: 0, False: 0] ------------------ 2270| 0| r = get_min_match_length(en->target, min, env); 2271| 0| break; 2272| | 2273| 0| case ENCLOSE_ABSENT: ------------------ | | 98| 0|#define ENCLOSE_ABSENT (1<<4) ------------------ | Branch (2273:7): [True: 0, False: 0] ------------------ 2274| 0| break; 2275| 0| } 2276| 0| } 2277| 0| break; 2278| | 2279| 0| case NT_ANCHOR: ------------------ | | 45| 0|#define NT_ANCHOR 7 ------------------ | Branch (2279:3): [True: 0, False: 68.3k] ------------------ 2280| 0| default: ------------------ | Branch (2280:3): [True: 0, False: 68.3k] ------------------ 2281| 0| break; 2282| 68.3k| } 2283| | 2284| 68.3k| return r; 2285| 68.3k|} regcomp.c:distance_multiply: 108| 62.8k|{ 109| 62.8k| if (m == 0) return 0; ------------------ | Branch (109:7): [True: 23.1k, False: 39.6k] ------------------ 110| | 111| 39.6k| if (d < ONIG_INFINITE_DISTANCE / m) ------------------ | | 85| 39.6k|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ | Branch (111:7): [True: 39.6k, False: 0] ------------------ 112| 39.6k| return d * m; 113| 0| else 114| 0| return ONIG_INFINITE_DISTANCE; ------------------ | | 85| 0|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ 115| 39.6k|} regcomp.c:setup_tree: 3879| 330k|{ 3880| 330k| int type; 3881| 330k| int r = 0; 3882| | 3883| 330k|restart: 3884| 330k| type = NTYPE(node); ------------------ | | 69| 330k|#define NTYPE(node) ((node)->u.base.type) ------------------ 3885| 330k| switch (type) { 3886| 45.9k| case NT_LIST: ------------------ | | 46| 45.9k|#define NT_LIST 8 ------------------ | Branch (3886:3): [True: 45.9k, False: 284k] ------------------ 3887| 45.9k| { 3888| 45.9k| Node* prev = NULL_NODE; ------------------ | | 283| 45.9k|#define NULL_NODE ((Node* )0) ------------------ 3889| 189k| do { 3890| 189k| r = setup_tree(NCAR(node), reg, state, env); ------------------ | | 86| 189k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 189k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 3891| 189k| if (IS_NOT_NULL(prev) && r == 0) { ------------------ | | 312| 379k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 144k, False: 45.9k] | | ------------------ ------------------ | Branch (3891:27): [True: 144k, False: 0] ------------------ 3892| 144k| r = next_setup(prev, NCAR(node), reg); ------------------ | | 86| 144k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 144k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 3893| 144k| } 3894| 189k| prev = NCAR(node); ------------------ | | 86| 189k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 189k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 3895| 189k| } while (r == 0 && IS_NOT_NULL(node = NCDR(node))); ------------------ | | 312| 189k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 144k, False: 45.9k] | | ------------------ ------------------ | Branch (3895:16): [True: 189k, False: 0] ------------------ 3896| 45.9k| } 3897| 45.9k| break; 3898| | 3899| 11.8k| case NT_ALT: ------------------ | | 47| 11.8k|#define NT_ALT 9 ------------------ | Branch (3899:3): [True: 11.8k, False: 319k] ------------------ 3900| 27.6k| do { 3901| 27.6k| r = setup_tree(NCAR(node), reg, (state | IN_ALT), env); ------------------ | | 86| 27.6k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 27.6k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ r = setup_tree(NCAR(node), reg, (state | IN_ALT), env); ------------------ | | 3268| 27.6k|#define IN_ALT (1<<0) ------------------ 3902| 27.6k| } while (r == 0 && IS_NOT_NULL(node = NCDR(node))); ------------------ | | 312| 27.6k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 15.8k, False: 11.8k] | | ------------------ ------------------ | Branch (3902:14): [True: 27.6k, False: 0] ------------------ 3903| 11.8k| break; 3904| | 3905| 45.6k| case NT_CCLASS: ------------------ | | 39| 45.6k|#define NT_CCLASS 1 ------------------ | Branch (3905:3): [True: 45.6k, False: 285k] ------------------ 3906| 45.6k| break; 3907| | 3908| 83.2k| case NT_STR: ------------------ | | 38| 83.2k|#define NT_STR 0 ------------------ | Branch (3908:3): [True: 83.2k, False: 247k] ------------------ 3909| 83.2k| if (IS_IGNORECASE(reg->options) && !NSTRING_IS_RAW(node)) { ------------------ | | 396| 166k|#define IS_IGNORECASE(option) ((option) & ONIG_OPTION_IGNORECASE) | | ------------------ | | | | 454| 83.2k|#define ONIG_OPTION_IGNORECASE 1U | | ------------------ | | | Branch (396:35): [True: 0, False: 83.2k] | | ------------------ ------------------ if (IS_IGNORECASE(reg->options) && !NSTRING_IS_RAW(node)) { ------------------ | | 114| 0|#define NSTRING_IS_RAW(node) (((node)->u.str.flag & NSTR_RAW) != 0) | | ------------------ | | | | 104| 0|#define NSTR_RAW (1<<0) /* by backslashed number */ | | ------------------ ------------------ | Branch (3909:40): [True: 0, False: 0] ------------------ 3910| 0| r = expand_case_fold_string(node, reg, state); 3911| 0| } 3912| 83.2k| break; 3913| | 3914| 0| case NT_CTYPE: ------------------ | | 40| 0|#define NT_CTYPE 2 ------------------ | Branch (3914:3): [True: 0, False: 330k] ------------------ 3915| 19.3k| case NT_CANY: ------------------ | | 41| 19.3k|#define NT_CANY 3 ------------------ | Branch (3915:3): [True: 19.3k, False: 311k] ------------------ 3916| 19.3k| break; 3917| | 3918| 0|#ifdef USE_SUBEXP_CALL 3919| 0| case NT_CALL: ------------------ | | 48| 0|#define NT_CALL 10 ------------------ | Branch (3919:3): [True: 0, False: 330k] ------------------ 3920| 0| break; 3921| 0|#endif 3922| | 3923| 0| case NT_BREF: ------------------ | | 42| 0|#define NT_BREF 4 ------------------ | Branch (3923:3): [True: 0, False: 330k] ------------------ 3924| 0| { 3925| 0| int i; 3926| 0| int* p; 3927| 0| Node** nodes = SCANENV_MEM_NODES(env); ------------------ | | 287| 0| (IS_NOT_NULL((senv)->mem_nodes_dynamic) ? \ | | ------------------ | | | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | | | ------------------ | | | | | Branch (312:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 288| 0| (senv)->mem_nodes_dynamic : (senv)->mem_nodes_static) ------------------ 3928| 0| BRefNode* br = NBREF(node); ------------------ | | 79| 0|#define NBREF(node) (&((node)->u.bref)) ------------------ 3929| 0| p = BACKREFS_P(br); ------------------ | | 120| 0| (IS_NOT_NULL((br)->back_dynamic) ? (br)->back_dynamic : (br)->back_static); | | ------------------ | | | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | | | ------------------ | | | | | Branch (312:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 3930| 0| for (i = 0; i < br->back_num; i++) { ------------------ | Branch (3930:19): [True: 0, False: 0] ------------------ 3931| 0| if (p[i] > env->num_mem) return ONIGERR_INVALID_BACKREF; ------------------ | | 677| 0|#define ONIGERR_INVALID_BACKREF -208 ------------------ | Branch (3931:6): [True: 0, False: 0] ------------------ 3932| 0| BIT_STATUS_ON_AT(env->backrefed_mem, p[i]); ------------------ | | 373| 0|#define BIT_STATUS_ON_AT(stats,n) do {\ | | 374| 0| if ((n) < (int )BIT_STATUS_BITS_NUM)\ | | ------------------ | | | | 367| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (374:7): [True: 0, False: 0] | | ------------------ | | 375| 0| (stats) |= (1 << (n));\ | | 376| 0| else\ | | 377| 0| (stats) |= 1;\ | | 378| 0|} while (0) | | ------------------ | | | Branch (378:10): [Folded - Ignored] | | ------------------ ------------------ 3933| 0| BIT_STATUS_ON_AT(env->bt_mem_start, p[i]); ------------------ | | 373| 0|#define BIT_STATUS_ON_AT(stats,n) do {\ | | 374| 0| if ((n) < (int )BIT_STATUS_BITS_NUM)\ | | ------------------ | | | | 367| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (374:7): [True: 0, False: 0] | | ------------------ | | 375| 0| (stats) |= (1 << (n));\ | | 376| 0| else\ | | 377| 0| (stats) |= 1;\ | | 378| 0|} while (0) | | ------------------ | | | Branch (378:10): [Folded - Ignored] | | ------------------ ------------------ 3934| 0|#ifdef USE_BACKREF_WITH_LEVEL 3935| 0| if (IS_BACKREF_NEST_LEVEL(br)) { ------------------ | | 164| 0|#define IS_BACKREF_NEST_LEVEL(bn) (((bn)->state & NST_NEST_LEVEL) != 0) | | ------------------ | | | | 141| 0|#define NST_NEST_LEVEL (1<<13) | | ------------------ | | | Branch (164:40): [True: 0, False: 0] | | ------------------ ------------------ 3936| 0| BIT_STATUS_ON_AT(env->bt_mem_end, p[i]); ------------------ | | 373| 0|#define BIT_STATUS_ON_AT(stats,n) do {\ | | 374| 0| if ((n) < (int )BIT_STATUS_BITS_NUM)\ | | ------------------ | | | | 367| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (374:7): [True: 0, False: 0] | | ------------------ | | 375| 0| (stats) |= (1 << (n));\ | | 376| 0| else\ | | 377| 0| (stats) |= 1;\ | | 378| 0|} while (0) | | ------------------ | | | Branch (378:10): [Folded - Ignored] | | ------------------ ------------------ 3937| 0| } 3938| 0|#endif 3939| 0| SET_ENCLOSE_STATUS(nodes[p[i]], NST_MEM_BACKREFED); ------------------ | | 144| 0|#define SET_ENCLOSE_STATUS(node,f) (node)->u.enclose.state |= (f) ------------------ 3940| 0| } 3941| 0| } 3942| 0| break; 3943| | 3944| 57.1k| case NT_QTFR: ------------------ | | 43| 57.1k|#define NT_QTFR 5 ------------------ | Branch (3944:3): [True: 57.1k, False: 273k] ------------------ 3945| 57.1k| { 3946| 57.1k| OnigDistance d; 3947| 57.1k| QtfrNode* qn = NQTFR(node); ------------------ | | 80| 57.1k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 3948| 57.1k| Node* target = qn->target; 3949| | 3950| 57.1k| if ((state & IN_REPEAT) != 0) { ------------------ | | 3270| 57.1k|#define IN_REPEAT (1<<2) ------------------ | Branch (3950:11): [True: 3.72k, False: 53.4k] ------------------ 3951| 3.72k| qn->state |= NST_IN_REPEAT; ------------------ | | 140| 3.72k|#define NST_IN_REPEAT (1<<12) /* STK_REPEAT is nested in stack. */ ------------------ 3952| 3.72k| } 3953| | 3954| 57.1k| if (IS_REPEAT_INFINITE(qn->upper) || qn->upper >= 1) { ------------------ | | 422| 114k|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 421| 57.1k|#define REPEAT_INFINITE -1 | | ------------------ | | | Branch (422:33): [True: 55.1k, False: 1.96k] | | ------------------ ------------------ | Branch (3954:44): [True: 1.96k, False: 0] ------------------ 3955| 57.1k| r = get_min_match_length(target, &d, env); 3956| 57.1k| if (r) break; ------------------ | Branch (3956:6): [True: 0, False: 57.1k] ------------------ 3957| 57.1k| if (d == 0) { ------------------ | Branch (3957:6): [True: 0, False: 57.1k] ------------------ 3958| 0| qn->target_empty_info = NQ_TARGET_IS_EMPTY; ------------------ | | 123| 0|#define NQ_TARGET_IS_EMPTY 1 ------------------ 3959| 0|#ifdef USE_MONOMANIAC_CHECK_CAPTURES_IN_ENDLESS_REPEAT 3960| 0| r = quantifiers_memory_node_info(target); 3961| 0| if (r < 0) break; ------------------ | Branch (3961:8): [True: 0, False: 0] ------------------ 3962| 0| if (r > 0) { ------------------ | Branch (3962:8): [True: 0, False: 0] ------------------ 3963| 0| qn->target_empty_info = r; 3964| 0| } 3965| 0|#endif 3966| |#if 0 3967| | r = get_max_match_length(target, &d, env); 3968| | if (r == 0 && d == 0) { 3969| | /* ()* ==> ()?, ()+ ==> () */ 3970| | qn->upper = 1; 3971| | if (qn->lower > 1) qn->lower = 1; 3972| | if (NTYPE(target) == NT_STR) { 3973| | qn->upper = qn->lower = 0; /* /(?:)+/ ==> // */ 3974| | } 3975| | } 3976| |#endif 3977| 0| } 3978| 57.1k| } 3979| | 3980| 57.1k| state |= IN_REPEAT; ------------------ | | 3270| 57.1k|#define IN_REPEAT (1<<2) ------------------ 3981| 57.1k| if (qn->lower != qn->upper) ------------------ | Branch (3981:11): [True: 57.1k, False: 0] ------------------ 3982| 57.1k| state |= IN_VAR_REPEAT; ------------------ | | 3271| 57.1k|#define IN_VAR_REPEAT (1<<3) ------------------ 3983| 57.1k| r = setup_tree(target, reg, state, env); 3984| 57.1k| if (r) break; ------------------ | Branch (3984:11): [True: 0, False: 57.1k] ------------------ 3985| | 3986| | /* expand string */ 3987| 57.1k|#define EXPAND_STRING_MAX_LENGTH 100 3988| 57.1k| if (NTYPE(target) == NT_STR) { ------------------ | | 69| 57.1k|#define NTYPE(node) ((node)->u.base.type) ------------------ if (NTYPE(target) == NT_STR) { ------------------ | | 38| 57.1k|#define NT_STR 0 ------------------ | Branch (3988:11): [True: 1.96k, False: 55.1k] ------------------ 3989| 1.96k| if (qn->lower > 1) { ------------------ | Branch (3989:6): [True: 0, False: 1.96k] ------------------ 3990| 0| int i, n = qn->lower; 3991| 0| OnigDistance len = NSTRING_LEN(target); ------------------ | | 108| 0|#define NSTRING_LEN(node) (OnigDistance )((node)->u.str.end - (node)->u.str.s) ------------------ 3992| 0| StrNode* sn = NSTR(target); ------------------ | | 76| 0|#define NSTR(node) (&((node)->u.str)) ------------------ 3993| 0| Node* np; 3994| | 3995| 0| np = onig_node_new_str(sn->s, sn->end); 3996| 0| if (IS_NULL(np)) return ONIGERR_MEMORY; ------------------ | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 0] | | ------------------ ------------------ if (IS_NULL(np)) return ONIGERR_MEMORY; ------------------ | | 632| 0|#define ONIGERR_MEMORY -5 ------------------ 3997| 0| NSTR(np)->flag = sn->flag; ------------------ | | 76| 0|#define NSTR(node) (&((node)->u.str)) ------------------ 3998| | 3999| 0| for (i = 1; i < n && (i+1) * len <= EXPAND_STRING_MAX_LENGTH; i++) { ------------------ | | 3987| 0|#define EXPAND_STRING_MAX_LENGTH 100 ------------------ | Branch (3999:16): [True: 0, False: 0] | Branch (3999:25): [True: 0, False: 0] ------------------ 4000| 0| r = onig_node_str_cat(np, sn->s, sn->end); 4001| 0| if (r) { ------------------ | Branch (4001:10): [True: 0, False: 0] ------------------ 4002| 0| onig_node_free(np); 4003| 0| return r; 4004| 0| } 4005| 0| } 4006| 0| if (i < qn->upper || IS_REPEAT_INFINITE(qn->upper)) { ------------------ | | 422| 0|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 421| 0|#define REPEAT_INFINITE -1 | | ------------------ | | | Branch (422:33): [True: 0, False: 0] | | ------------------ ------------------ | Branch (4006:8): [True: 0, False: 0] ------------------ 4007| 0| Node *np1, *np2; 4008| | 4009| 0| qn->lower -= i; 4010| 0| if (! IS_REPEAT_INFINITE(qn->upper)) ------------------ | | 422| 0|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 421| 0|#define REPEAT_INFINITE -1 | | ------------------ ------------------ | Branch (4010:10): [True: 0, False: 0] ------------------ 4011| 0| qn->upper -= i; 4012| | 4013| 0| np1 = onig_node_new_list(np, NULL); 4014| 0| if (IS_NULL(np1)) { ------------------ | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 0] | | ------------------ ------------------ 4015| 0| onig_node_free(np); 4016| 0| return ONIGERR_MEMORY; ------------------ | | 632| 0|#define ONIGERR_MEMORY -5 ------------------ 4017| 0| } 4018| 0| swap_node(np1, node); 4019| 0| np2 = onig_node_list_add(node, np1); 4020| 0| if (IS_NULL(np2)) { ------------------ | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 0] | | ------------------ ------------------ 4021| 0| onig_node_free(np1); 4022| 0| return ONIGERR_MEMORY; ------------------ | | 632| 0|#define ONIGERR_MEMORY -5 ------------------ 4023| 0| } 4024| 0| } 4025| 0| else { 4026| 0| swap_node(np, node); 4027| 0| onig_node_free(np); 4028| 0| } 4029| 0| break; /* break case NT_QTFR: */ 4030| 0| } 4031| 1.96k| } 4032| | 4033| |#ifdef USE_OP_PUSH_OR_JUMP_EXACT 4034| | if (qn->greedy && (qn->target_empty_info != 0)) { 4035| | if (NTYPE(target) == NT_QTFR) { 4036| | QtfrNode* tqn = NQTFR(target); 4037| | if (IS_NOT_NULL(tqn->head_exact)) { 4038| | qn->head_exact = tqn->head_exact; 4039| | tqn->head_exact = NULL; 4040| | } 4041| | } 4042| | else { 4043| | qn->head_exact = get_head_value_node(qn->target, 1, reg); 4044| | } 4045| | } 4046| |#endif 4047| 57.1k| } 4048| 57.1k| break; 4049| | 4050| 57.1k| case NT_ENCLOSE: ------------------ | | 44| 12.0k|#define NT_ENCLOSE 6 ------------------ | Branch (4050:3): [True: 12.0k, False: 318k] ------------------ 4051| 12.0k| { 4052| 12.0k| EncloseNode* en = NENCLOSE(node); ------------------ | | 81| 12.0k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 4053| | 4054| 12.0k| switch (en->type) { ------------------ | Branch (4054:15): [True: 0, False: 12.0k] ------------------ 4055| 1.95k| case ENCLOSE_OPTION: ------------------ | | 95| 1.95k|#define ENCLOSE_OPTION (1<<1) ------------------ | Branch (4055:7): [True: 1.95k, False: 10.0k] ------------------ 4056| 1.95k| { 4057| 1.95k| OnigOptionType options = reg->options; 4058| 1.95k| reg->options = NENCLOSE(node)->option; ------------------ | | 81| 1.95k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 4059| 1.95k| r = setup_tree(NENCLOSE(node)->target, reg, state, env); ------------------ | | 81| 1.95k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 4060| 1.95k| reg->options = options; 4061| 1.95k| } 4062| 1.95k| break; 4063| | 4064| 10.0k| case ENCLOSE_MEMORY: ------------------ | | 94| 10.0k|#define ENCLOSE_MEMORY (1<<0) ------------------ | Branch (4064:7): [True: 10.0k, False: 1.95k] ------------------ 4065| 10.0k| if ((state & (IN_ALT | IN_NOT | IN_VAR_REPEAT | IN_CALL)) != 0) { ------------------ | | 3268| 10.0k|#define IN_ALT (1<<0) ------------------ if ((state & (IN_ALT | IN_NOT | IN_VAR_REPEAT | IN_CALL)) != 0) { ------------------ | | 3269| 10.0k|#define IN_NOT (1<<1) ------------------ if ((state & (IN_ALT | IN_NOT | IN_VAR_REPEAT | IN_CALL)) != 0) { ------------------ | | 3271| 10.0k|#define IN_VAR_REPEAT (1<<3) ------------------ if ((state & (IN_ALT | IN_NOT | IN_VAR_REPEAT | IN_CALL)) != 0) { ------------------ | | 3272| 10.0k|#define IN_CALL (1<<4) ------------------ | Branch (4065:6): [True: 0, False: 10.0k] ------------------ 4066| 0| BIT_STATUS_ON_AT(env->bt_mem_start, en->regnum); ------------------ | | 373| 0|#define BIT_STATUS_ON_AT(stats,n) do {\ | | 374| 0| if ((n) < (int )BIT_STATUS_BITS_NUM)\ | | ------------------ | | | | 367| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (374:7): [True: 0, False: 0] | | ------------------ | | 375| 0| (stats) |= (1 << (n));\ | | 376| 0| else\ | | 377| 0| (stats) |= 1;\ | | 378| 0|} while (0) | | ------------------ | | | Branch (378:10): [Folded - Ignored] | | ------------------ ------------------ 4067| | /* SET_ENCLOSE_STATUS(node, NST_MEM_IN_ALT_NOT); */ 4068| 0| } 4069| 10.0k| if (IS_ENCLOSE_CALLED(en)) ------------------ | | 147| 10.0k|#define IS_ENCLOSE_CALLED(en) (((en)->state & NST_CALLED) != 0) | | ------------------ | | | | 136| 10.0k|#define NST_CALLED (1<<8) | | ------------------ | | | Branch (147:40): [True: 0, False: 10.0k] | | ------------------ ------------------ 4070| 0| state |= IN_CALL; ------------------ | | 3272| 0|#define IN_CALL (1<<4) ------------------ 4071| 10.0k| if (IS_ENCLOSE_RECURSION(en)) ------------------ | | 149| 10.0k|#define IS_ENCLOSE_RECURSION(en) (((en)->state & NST_RECURSION) != 0) | | ------------------ | | | | 135| 10.0k|#define NST_RECURSION (1<<7) | | ------------------ | | | Branch (149:40): [True: 0, False: 10.0k] | | ------------------ ------------------ 4072| 0| state |= IN_RECCALL; ------------------ | | 3273| 0|#define IN_RECCALL (1<<5) ------------------ 4073| 10.0k| else if ((state & IN_RECCALL) != 0) ------------------ | | 3273| 10.0k|#define IN_RECCALL (1<<5) ------------------ | Branch (4073:11): [True: 0, False: 10.0k] ------------------ 4074| 0| SET_CALL_RECURSION(node); ------------------ | | 160| 0|#define SET_CALL_RECURSION(node) (node)->u.call.state |= NST_RECURSION | | ------------------ | | | | 135| 0|#define NST_RECURSION (1<<7) | | ------------------ ------------------ 4075| 10.0k| r = setup_tree(en->target, reg, state, env); 4076| 10.0k| break; 4077| | 4078| 0| case ENCLOSE_STOP_BACKTRACK: ------------------ | | 96| 0|#define ENCLOSE_STOP_BACKTRACK (1<<2) ------------------ | Branch (4078:7): [True: 0, False: 12.0k] ------------------ 4079| 0| { 4080| 0| Node* target = en->target; 4081| 0| r = setup_tree(target, reg, state, env); 4082| 0| if (NTYPE(target) == NT_QTFR) { ------------------ | | 69| 0|#define NTYPE(node) ((node)->u.base.type) ------------------ if (NTYPE(target) == NT_QTFR) { ------------------ | | 43| 0|#define NT_QTFR 5 ------------------ | Branch (4082:8): [True: 0, False: 0] ------------------ 4083| 0| QtfrNode* tqn = NQTFR(target); ------------------ | | 80| 0|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 4084| 0| if (IS_REPEAT_INFINITE(tqn->upper) && tqn->lower <= 1 && ------------------ | | 422| 0|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 421| 0|#define REPEAT_INFINITE -1 | | ------------------ | | | Branch (422:33): [True: 0, False: 0] | | ------------------ ------------------ | Branch (4084:44): [True: 0, False: 0] ------------------ 4085| 0| tqn->greedy != 0) { /* (?>a*), a*+ etc... */ ------------------ | Branch (4085:3): [True: 0, False: 0] ------------------ 4086| 0| int qtype = NTYPE(tqn->target); ------------------ | | 69| 0|#define NTYPE(node) ((node)->u.base.type) ------------------ 4087| 0| if (IS_NODE_TYPE_SIMPLE(qtype)) ------------------ | | 66| 0| ((NTYPE2BIT(type) & (BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE |\ | | ------------------ | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | ------------------ | | ((NTYPE2BIT(type) & (BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE |\ | | ------------------ | | | | 53| 0|#define BIT_NT_STR NTYPE2BIT(NT_STR) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | ((NTYPE2BIT(type) & (BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE |\ | | ------------------ | | | | 54| 0|#define BIT_NT_CCLASS NTYPE2BIT(NT_CCLASS) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | ((NTYPE2BIT(type) & (BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE |\ | | ------------------ | | | | 55| 0|#define BIT_NT_CTYPE NTYPE2BIT(NT_CTYPE) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | | Branch (66:3): [True: 0, False: 0] | | ------------------ | | 67| 0| BIT_NT_CANY | BIT_NT_BREF)) != 0) | | ------------------ | | | | 56| 0|#define BIT_NT_CANY NTYPE2BIT(NT_CANY) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | BIT_NT_CANY | BIT_NT_BREF)) != 0) | | ------------------ | | | | 57| 0|#define BIT_NT_BREF NTYPE2BIT(NT_BREF) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ ------------------ 4088| 0| SET_ENCLOSE_STATUS(node, NST_STOP_BT_SIMPLE_REPEAT); ------------------ | | 144| 0|#define SET_ENCLOSE_STATUS(node,f) (node)->u.enclose.state |= (f) ------------------ 4089| 0| } 4090| 0| } 4091| 0| } 4092| 0| break; 4093| | 4094| 0| case ENCLOSE_CONDITION: ------------------ | | 97| 0|#define ENCLOSE_CONDITION (1<<3) ------------------ | Branch (4094:7): [True: 0, False: 12.0k] ------------------ 4095| 0|#ifdef USE_NAMED_GROUP 4096| 0| if (! IS_ENCLOSE_NAME_REF(NENCLOSE(node)) && ------------------ | | 158| 0|#define IS_ENCLOSE_NAME_REF(en) (((en)->state & NST_NAME_REF) != 0) | | ------------------ | | | | 139| 0|#define NST_NAME_REF (1<<11) | | ------------------ ------------------ | Branch (4096:6): [True: 0, False: 0] ------------------ 4097| 0| env->num_named > 0 && ------------------ | Branch (4097:6): [True: 0, False: 0] ------------------ 4098| 0| IS_SYNTAX_BV(env->syntax, ONIG_SYN_CAPTURE_ONLY_NAMED_GROUP) && ------------------ | | 332| 0|#define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0) | | ------------------ | | | Branch (332:35): [True: 0, False: 0] | | ------------------ ------------------ 4099| 0| !ONIG_IS_OPTION_ON(env->option, ONIG_OPTION_CAPTURE_GROUP)) { ------------------ | | 479| 0|#define ONIG_IS_OPTION_ON(options,option) ((options) & (option)) ------------------ | Branch (4099:6): [True: 0, False: 0] ------------------ 4100| 0| return ONIGERR_NUMBERED_BACKREF_OR_CALL_NOT_ALLOWED; ------------------ | | 678| 0|#define ONIGERR_NUMBERED_BACKREF_OR_CALL_NOT_ALLOWED -209 ------------------ 4101| 0| } 4102| 0|#endif 4103| 0| if (NENCLOSE(node)->regnum > env->num_mem) ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ | Branch (4103:6): [True: 0, False: 0] ------------------ 4104| 0| return ONIGERR_INVALID_BACKREF; ------------------ | | 677| 0|#define ONIGERR_INVALID_BACKREF -208 ------------------ 4105| 0| r = setup_tree(NENCLOSE(node)->target, reg, state, env); ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 4106| 0| break; 4107| | 4108| 0| case ENCLOSE_ABSENT: ------------------ | | 98| 0|#define ENCLOSE_ABSENT (1<<4) ------------------ | Branch (4108:7): [True: 0, False: 12.0k] ------------------ 4109| 0| r = setup_tree(NENCLOSE(node)->target, reg, state, env); ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 4110| 0| break; 4111| 12.0k| } 4112| 12.0k| } 4113| 12.0k| break; 4114| | 4115| 55.6k| case NT_ANCHOR: ------------------ | | 45| 55.6k|#define NT_ANCHOR 7 ------------------ | Branch (4115:3): [True: 55.6k, False: 275k] ------------------ 4116| 55.6k| { 4117| 55.6k| AnchorNode* an = NANCHOR(node); ------------------ | | 82| 55.6k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 4118| | 4119| 55.6k| switch (an->type) { ------------------ | Branch (4119:15): [True: 55.6k, False: 0] ------------------ 4120| 0| case ANCHOR_PREC_READ: ------------------ | | 551| 0|#define ANCHOR_PREC_READ (1<<10) ------------------ | Branch (4120:7): [True: 0, False: 55.6k] ------------------ 4121| 0| r = setup_tree(an->target, reg, state, env); 4122| 0| break; 4123| 0| case ANCHOR_PREC_READ_NOT: ------------------ | | 552| 0|#define ANCHOR_PREC_READ_NOT (1<<11) ------------------ | Branch (4123:7): [True: 0, False: 55.6k] ------------------ 4124| 0| r = setup_tree(an->target, reg, (state | IN_NOT), env); ------------------ | | 3269| 0|#define IN_NOT (1<<1) ------------------ 4125| 0| break; 4126| | 4127| |/* allowed node types in look-behind */ 4128| 0|#define ALLOWED_TYPE_IN_LB \ 4129| 0| ( BIT_NT_LIST | BIT_NT_ALT | BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE | \ 4130| 0| BIT_NT_CANY | BIT_NT_ANCHOR | BIT_NT_ENCLOSE | BIT_NT_QTFR | BIT_NT_CALL ) 4131| | 4132| 0|#define ALLOWED_ENCLOSE_IN_LB ( ENCLOSE_MEMORY | ENCLOSE_OPTION ) 4133| 0|#define ALLOWED_ENCLOSE_IN_LB_NOT ENCLOSE_OPTION 4134| | 4135| 0|#define ALLOWED_ANCHOR_IN_LB \ 4136| 0|( ANCHOR_LOOK_BEHIND | ANCHOR_LOOK_BEHIND_NOT | ANCHOR_BEGIN_LINE | \ 4137| 0| ANCHOR_END_LINE | ANCHOR_BEGIN_BUF | ANCHOR_BEGIN_POSITION | ANCHOR_KEEP | \ 4138| 0| ANCHOR_WORD_BOUND | ANCHOR_NOT_WORD_BOUND | \ 4139| 0| ANCHOR_WORD_BEGIN | ANCHOR_WORD_END ) 4140| 0|#define ALLOWED_ANCHOR_IN_LB_NOT \ 4141| 0|( ANCHOR_LOOK_BEHIND | ANCHOR_LOOK_BEHIND_NOT | ANCHOR_BEGIN_LINE | \ 4142| 0| ANCHOR_END_LINE | ANCHOR_BEGIN_BUF | ANCHOR_BEGIN_POSITION | ANCHOR_KEEP | \ 4143| 0| ANCHOR_WORD_BOUND | ANCHOR_NOT_WORD_BOUND | \ 4144| 0| ANCHOR_WORD_BEGIN | ANCHOR_WORD_END ) 4145| | 4146| 0| case ANCHOR_LOOK_BEHIND: ------------------ | | 553| 0|#define ANCHOR_LOOK_BEHIND (1<<12) ------------------ | Branch (4146:7): [True: 0, False: 55.6k] ------------------ 4147| 0| { 4148| 0| r = check_type_tree(an->target, ALLOWED_TYPE_IN_LB, ------------------ | | 4129| 0| ( BIT_NT_LIST | BIT_NT_ALT | BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE | \ | | ------------------ | | | | 61| 0|#define BIT_NT_LIST NTYPE2BIT(NT_LIST) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | ( BIT_NT_LIST | BIT_NT_ALT | BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE | \ | | ------------------ | | | | 62| 0|#define BIT_NT_ALT NTYPE2BIT(NT_ALT) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | ( BIT_NT_LIST | BIT_NT_ALT | BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE | \ | | ------------------ | | | | 53| 0|#define BIT_NT_STR NTYPE2BIT(NT_STR) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | ( BIT_NT_LIST | BIT_NT_ALT | BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE | \ | | ------------------ | | | | 54| 0|#define BIT_NT_CCLASS NTYPE2BIT(NT_CCLASS) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | ( BIT_NT_LIST | BIT_NT_ALT | BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE | \ | | ------------------ | | | | 55| 0|#define BIT_NT_CTYPE NTYPE2BIT(NT_CTYPE) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | 4130| 0| BIT_NT_CANY | BIT_NT_ANCHOR | BIT_NT_ENCLOSE | BIT_NT_QTFR | BIT_NT_CALL ) | | ------------------ | | | | 56| 0|#define BIT_NT_CANY NTYPE2BIT(NT_CANY) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | BIT_NT_CANY | BIT_NT_ANCHOR | BIT_NT_ENCLOSE | BIT_NT_QTFR | BIT_NT_CALL ) | | ------------------ | | | | 60| 0|#define BIT_NT_ANCHOR NTYPE2BIT(NT_ANCHOR) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | BIT_NT_CANY | BIT_NT_ANCHOR | BIT_NT_ENCLOSE | BIT_NT_QTFR | BIT_NT_CALL ) | | ------------------ | | | | 59| 0|#define BIT_NT_ENCLOSE NTYPE2BIT(NT_ENCLOSE) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | BIT_NT_CANY | BIT_NT_ANCHOR | BIT_NT_ENCLOSE | BIT_NT_QTFR | BIT_NT_CALL ) | | ------------------ | | | | 58| 0|#define BIT_NT_QTFR NTYPE2BIT(NT_QTFR) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | BIT_NT_CANY | BIT_NT_ANCHOR | BIT_NT_ENCLOSE | BIT_NT_QTFR | BIT_NT_CALL ) | | ------------------ | | | | 63| 0|#define BIT_NT_CALL NTYPE2BIT(NT_CALL) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ ------------------ 4149| 0| ALLOWED_ENCLOSE_IN_LB, ALLOWED_ANCHOR_IN_LB); ------------------ | | 4132| 0|#define ALLOWED_ENCLOSE_IN_LB ( ENCLOSE_MEMORY | ENCLOSE_OPTION ) | | ------------------ | | | | 94| 0|#define ENCLOSE_MEMORY (1<<0) | | ------------------ | | #define ALLOWED_ENCLOSE_IN_LB ( ENCLOSE_MEMORY | ENCLOSE_OPTION ) | | ------------------ | | | | 95| 0|#define ENCLOSE_OPTION (1<<1) | | ------------------ ------------------ ALLOWED_ENCLOSE_IN_LB, ALLOWED_ANCHOR_IN_LB); ------------------ | | 4135| 0|#define ALLOWED_ANCHOR_IN_LB \ | | 4136| 0|( ANCHOR_LOOK_BEHIND | ANCHOR_LOOK_BEHIND_NOT | ANCHOR_BEGIN_LINE | \ | | ------------------ | | | | 553| 0|#define ANCHOR_LOOK_BEHIND (1<<12) | | ------------------ | | ( ANCHOR_LOOK_BEHIND | ANCHOR_LOOK_BEHIND_NOT | ANCHOR_BEGIN_LINE | \ | | ------------------ | | | | 554| 0|#define ANCHOR_LOOK_BEHIND_NOT (1<<13) | | ------------------ | | ( ANCHOR_LOOK_BEHIND | ANCHOR_LOOK_BEHIND_NOT | ANCHOR_BEGIN_LINE | \ | | ------------------ | | | | 541| 0|#define ANCHOR_BEGIN_LINE (1<<1) | | ------------------ | | 4137| 0| ANCHOR_END_LINE | ANCHOR_BEGIN_BUF | ANCHOR_BEGIN_POSITION | ANCHOR_KEEP | \ | | ------------------ | | | | 545| 0|#define ANCHOR_END_LINE (1<<5) | | ------------------ | | ANCHOR_END_LINE | ANCHOR_BEGIN_BUF | ANCHOR_BEGIN_POSITION | ANCHOR_KEEP | \ | | ------------------ | | | | 540| 0|#define ANCHOR_BEGIN_BUF (1<<0) | | ------------------ | | ANCHOR_END_LINE | ANCHOR_BEGIN_BUF | ANCHOR_BEGIN_POSITION | ANCHOR_KEEP | \ | | ------------------ | | | | 542| 0|#define ANCHOR_BEGIN_POSITION (1<<2) | | ------------------ | | ANCHOR_END_LINE | ANCHOR_BEGIN_BUF | ANCHOR_BEGIN_POSITION | ANCHOR_KEEP | \ | | ------------------ | | | | 559| 0|#define ANCHOR_KEEP (1<<16) | | ------------------ | | 4138| 0| ANCHOR_WORD_BOUND | ANCHOR_NOT_WORD_BOUND | \ | | ------------------ | | | | 547| 0|#define ANCHOR_WORD_BOUND (1<<6) | | ------------------ | | ANCHOR_WORD_BOUND | ANCHOR_NOT_WORD_BOUND | \ | | ------------------ | | | | 548| 0|#define ANCHOR_NOT_WORD_BOUND (1<<7) | | ------------------ | | 4139| 0| ANCHOR_WORD_BEGIN | ANCHOR_WORD_END ) | | ------------------ | | | | 549| 0|#define ANCHOR_WORD_BEGIN (1<<8) | | ------------------ | | ANCHOR_WORD_BEGIN | ANCHOR_WORD_END ) | | ------------------ | | | | 550| 0|#define ANCHOR_WORD_END (1<<9) | | ------------------ ------------------ 4150| 0| if (r < 0) return r; ------------------ | Branch (4150:8): [True: 0, False: 0] ------------------ 4151| 0| if (r > 0) return ONIGERR_INVALID_LOOK_BEHIND_PATTERN; ------------------ | | 665| 0|#define ONIGERR_INVALID_LOOK_BEHIND_PATTERN -122 ------------------ | Branch (4151:8): [True: 0, False: 0] ------------------ 4152| 0| if (NTYPE(node) != NT_ANCHOR) goto restart; ------------------ | | 69| 0|#define NTYPE(node) ((node)->u.base.type) ------------------ if (NTYPE(node) != NT_ANCHOR) goto restart; ------------------ | | 45| 0|#define NT_ANCHOR 7 ------------------ | Branch (4152:8): [True: 0, False: 0] ------------------ 4153| 0| r = setup_tree(an->target, reg, (state | IN_LOOK_BEHIND), env); ------------------ | | 3274| 0|#define IN_LOOK_BEHIND (1<<6) ------------------ 4154| 0| if (r != 0) return r; ------------------ | Branch (4154:8): [True: 0, False: 0] ------------------ 4155| 0| r = setup_look_behind(node, reg, env); 4156| 0| } 4157| 0| break; 4158| | 4159| 0| case ANCHOR_LOOK_BEHIND_NOT: ------------------ | | 554| 0|#define ANCHOR_LOOK_BEHIND_NOT (1<<13) ------------------ | Branch (4159:7): [True: 0, False: 55.6k] ------------------ 4160| 0| { 4161| 0| r = check_type_tree(an->target, ALLOWED_TYPE_IN_LB, ------------------ | | 4129| 0| ( BIT_NT_LIST | BIT_NT_ALT | BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE | \ | | ------------------ | | | | 61| 0|#define BIT_NT_LIST NTYPE2BIT(NT_LIST) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | ( BIT_NT_LIST | BIT_NT_ALT | BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE | \ | | ------------------ | | | | 62| 0|#define BIT_NT_ALT NTYPE2BIT(NT_ALT) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | ( BIT_NT_LIST | BIT_NT_ALT | BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE | \ | | ------------------ | | | | 53| 0|#define BIT_NT_STR NTYPE2BIT(NT_STR) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | ( BIT_NT_LIST | BIT_NT_ALT | BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE | \ | | ------------------ | | | | 54| 0|#define BIT_NT_CCLASS NTYPE2BIT(NT_CCLASS) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | ( BIT_NT_LIST | BIT_NT_ALT | BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE | \ | | ------------------ | | | | 55| 0|#define BIT_NT_CTYPE NTYPE2BIT(NT_CTYPE) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | 4130| 0| BIT_NT_CANY | BIT_NT_ANCHOR | BIT_NT_ENCLOSE | BIT_NT_QTFR | BIT_NT_CALL ) | | ------------------ | | | | 56| 0|#define BIT_NT_CANY NTYPE2BIT(NT_CANY) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | BIT_NT_CANY | BIT_NT_ANCHOR | BIT_NT_ENCLOSE | BIT_NT_QTFR | BIT_NT_CALL ) | | ------------------ | | | | 60| 0|#define BIT_NT_ANCHOR NTYPE2BIT(NT_ANCHOR) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | BIT_NT_CANY | BIT_NT_ANCHOR | BIT_NT_ENCLOSE | BIT_NT_QTFR | BIT_NT_CALL ) | | ------------------ | | | | 59| 0|#define BIT_NT_ENCLOSE NTYPE2BIT(NT_ENCLOSE) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | BIT_NT_CANY | BIT_NT_ANCHOR | BIT_NT_ENCLOSE | BIT_NT_QTFR | BIT_NT_CALL ) | | ------------------ | | | | 58| 0|#define BIT_NT_QTFR NTYPE2BIT(NT_QTFR) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | BIT_NT_CANY | BIT_NT_ANCHOR | BIT_NT_ENCLOSE | BIT_NT_QTFR | BIT_NT_CALL ) | | ------------------ | | | | 63| 0|#define BIT_NT_CALL NTYPE2BIT(NT_CALL) | | | | ------------------ | | | | | | 51| 0|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ ------------------ 4162| 0| ALLOWED_ENCLOSE_IN_LB_NOT, ALLOWED_ANCHOR_IN_LB_NOT); ------------------ | | 4133| 0|#define ALLOWED_ENCLOSE_IN_LB_NOT ENCLOSE_OPTION | | ------------------ | | | | 95| 0|#define ENCLOSE_OPTION (1<<1) | | ------------------ ------------------ ALLOWED_ENCLOSE_IN_LB_NOT, ALLOWED_ANCHOR_IN_LB_NOT); ------------------ | | 4140| 0|#define ALLOWED_ANCHOR_IN_LB_NOT \ | | 4141| 0|( ANCHOR_LOOK_BEHIND | ANCHOR_LOOK_BEHIND_NOT | ANCHOR_BEGIN_LINE | \ | | ------------------ | | | | 553| 0|#define ANCHOR_LOOK_BEHIND (1<<12) | | ------------------ | | ( ANCHOR_LOOK_BEHIND | ANCHOR_LOOK_BEHIND_NOT | ANCHOR_BEGIN_LINE | \ | | ------------------ | | | | 554| 0|#define ANCHOR_LOOK_BEHIND_NOT (1<<13) | | ------------------ | | ( ANCHOR_LOOK_BEHIND | ANCHOR_LOOK_BEHIND_NOT | ANCHOR_BEGIN_LINE | \ | | ------------------ | | | | 541| 0|#define ANCHOR_BEGIN_LINE (1<<1) | | ------------------ | | 4142| 0| ANCHOR_END_LINE | ANCHOR_BEGIN_BUF | ANCHOR_BEGIN_POSITION | ANCHOR_KEEP | \ | | ------------------ | | | | 545| 0|#define ANCHOR_END_LINE (1<<5) | | ------------------ | | ANCHOR_END_LINE | ANCHOR_BEGIN_BUF | ANCHOR_BEGIN_POSITION | ANCHOR_KEEP | \ | | ------------------ | | | | 540| 0|#define ANCHOR_BEGIN_BUF (1<<0) | | ------------------ | | ANCHOR_END_LINE | ANCHOR_BEGIN_BUF | ANCHOR_BEGIN_POSITION | ANCHOR_KEEP | \ | | ------------------ | | | | 542| 0|#define ANCHOR_BEGIN_POSITION (1<<2) | | ------------------ | | ANCHOR_END_LINE | ANCHOR_BEGIN_BUF | ANCHOR_BEGIN_POSITION | ANCHOR_KEEP | \ | | ------------------ | | | | 559| 0|#define ANCHOR_KEEP (1<<16) | | ------------------ | | 4143| 0| ANCHOR_WORD_BOUND | ANCHOR_NOT_WORD_BOUND | \ | | ------------------ | | | | 547| 0|#define ANCHOR_WORD_BOUND (1<<6) | | ------------------ | | ANCHOR_WORD_BOUND | ANCHOR_NOT_WORD_BOUND | \ | | ------------------ | | | | 548| 0|#define ANCHOR_NOT_WORD_BOUND (1<<7) | | ------------------ | | 4144| 0| ANCHOR_WORD_BEGIN | ANCHOR_WORD_END ) | | ------------------ | | | | 549| 0|#define ANCHOR_WORD_BEGIN (1<<8) | | ------------------ | | ANCHOR_WORD_BEGIN | ANCHOR_WORD_END ) | | ------------------ | | | | 550| 0|#define ANCHOR_WORD_END (1<<9) | | ------------------ ------------------ 4163| 0| if (r < 0) return r; ------------------ | Branch (4163:8): [True: 0, False: 0] ------------------ 4164| 0| if (r > 0) return ONIGERR_INVALID_LOOK_BEHIND_PATTERN; ------------------ | | 665| 0|#define ONIGERR_INVALID_LOOK_BEHIND_PATTERN -122 ------------------ | Branch (4164:8): [True: 0, False: 0] ------------------ 4165| 0| if (NTYPE(node) != NT_ANCHOR) goto restart; ------------------ | | 69| 0|#define NTYPE(node) ((node)->u.base.type) ------------------ if (NTYPE(node) != NT_ANCHOR) goto restart; ------------------ | | 45| 0|#define NT_ANCHOR 7 ------------------ | Branch (4165:8): [True: 0, False: 0] ------------------ 4166| 0| r = setup_tree(an->target, reg, (state | IN_NOT | IN_LOOK_BEHIND), ------------------ | | 3269| 0|#define IN_NOT (1<<1) ------------------ r = setup_tree(an->target, reg, (state | IN_NOT | IN_LOOK_BEHIND), ------------------ | | 3274| 0|#define IN_LOOK_BEHIND (1<<6) ------------------ 4167| 0| env); 4168| 0| if (r != 0) return r; ------------------ | Branch (4168:8): [True: 0, False: 0] ------------------ 4169| 0| r = setup_look_behind(node, reg, env); 4170| 0| } 4171| 0| break; 4172| 55.6k| } 4173| 55.6k| } 4174| 55.6k| break; 4175| | 4176| 55.6k| default: ------------------ | Branch (4176:3): [True: 0, False: 330k] ------------------ 4177| 0| break; 4178| 330k| } 4179| | 4180| 330k| return r; 4181| 330k|} regcomp.c:next_setup: 3333| 144k|{ 3334| 144k| int type; 3335| | 3336| 154k| retry: 3337| 154k| type = NTYPE(node); ------------------ | | 69| 154k|#define NTYPE(node) ((node)->u.base.type) ------------------ 3338| 154k| if (type == NT_QTFR) { ------------------ | | 43| 154k|#define NT_QTFR 5 ------------------ | Branch (3338:7): [True: 51.4k, False: 102k] ------------------ 3339| 51.4k| QtfrNode* qn = NQTFR(node); ------------------ | | 80| 51.4k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 3340| 51.4k| if (qn->greedy && IS_REPEAT_INFINITE(qn->upper)) { ------------------ | | 422| 49.4k|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 421| 49.4k|#define REPEAT_INFINITE -1 | | ------------------ | | | Branch (422:33): [True: 47.4k, False: 1.96k] | | ------------------ ------------------ | Branch (3340:9): [True: 49.4k, False: 2.01k] ------------------ 3341| 47.4k|#ifdef USE_QTFR_PEEK_NEXT 3342| 47.4k| Node* n = get_head_value_node(next_node, 1, reg); 3343| | /* '\0': for UTF-16BE etc... */ 3344| 47.4k| if (IS_NOT_NULL(n) && NSTR(n)->s[0] != '\0') { ------------------ | | 312| 94.9k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 28.2k, False: 19.1k] | | ------------------ ------------------ if (IS_NOT_NULL(n) && NSTR(n)->s[0] != '\0') { ------------------ | | 76| 28.2k|#define NSTR(node) (&((node)->u.str)) ------------------ | Branch (3344:29): [True: 28.2k, False: 0] ------------------ 3345| 28.2k| qn->next_head_exact = n; 3346| 28.2k| } 3347| 47.4k|#endif 3348| | /* automatic possessification a*b ==> (?>a*)b */ 3349| 47.4k| if (qn->lower <= 1) { ------------------ | Branch (3349:11): [True: 47.4k, False: 0] ------------------ 3350| 47.4k| int ttype = NTYPE(qn->target); ------------------ | | 69| 47.4k|#define NTYPE(node) ((node)->u.base.type) ------------------ 3351| 47.4k| if (IS_NODE_TYPE_SIMPLE(ttype)) { ------------------ | | 66| 47.4k| ((NTYPE2BIT(type) & (BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE |\ | | ------------------ | | | | 51| 47.4k|#define NTYPE2BIT(type) (1<<(type)) | | ------------------ | | ((NTYPE2BIT(type) & (BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE |\ | | ------------------ | | | | 53| 47.4k|#define BIT_NT_STR NTYPE2BIT(NT_STR) | | | | ------------------ | | | | | | 51| 47.4k|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | ((NTYPE2BIT(type) & (BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE |\ | | ------------------ | | | | 54| 47.4k|#define BIT_NT_CCLASS NTYPE2BIT(NT_CCLASS) | | | | ------------------ | | | | | | 51| 47.4k|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | ((NTYPE2BIT(type) & (BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE |\ | | ------------------ | | | | 55| 47.4k|#define BIT_NT_CTYPE NTYPE2BIT(NT_CTYPE) | | | | ------------------ | | | | | | 51| 47.4k|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | | Branch (66:3): [True: 43.7k, False: 3.72k] | | ------------------ | | 67| 47.4k| BIT_NT_CANY | BIT_NT_BREF)) != 0) | | ------------------ | | | | 56| 47.4k|#define BIT_NT_CANY NTYPE2BIT(NT_CANY) | | | | ------------------ | | | | | | 51| 47.4k|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | BIT_NT_CANY | BIT_NT_BREF)) != 0) | | ------------------ | | | | 57| 47.4k|#define BIT_NT_BREF NTYPE2BIT(NT_BREF) | | | | ------------------ | | | | | | 51| 47.4k|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ ------------------ 3352| 43.7k| Node *x, *y; 3353| 43.7k| x = get_head_value_node(qn->target, 0, reg); 3354| 43.7k| if (IS_NOT_NULL(x)) { ------------------ | | 312| 43.7k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 37.9k, False: 5.74k] | | ------------------ ------------------ 3355| 37.9k| y = get_head_value_node(next_node, 0, reg); 3356| 37.9k| if (IS_NOT_NULL(y) && is_not_included(x, y, reg)) { ------------------ | | 312| 75.9k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 24.5k, False: 13.4k] | | ------------------ ------------------ | Branch (3356:28): [True: 24.5k, False: 0] ------------------ 3357| 24.5k| Node* en = onig_node_new_enclose(ENCLOSE_STOP_BACKTRACK); ------------------ | | 96| 24.5k|#define ENCLOSE_STOP_BACKTRACK (1<<2) ------------------ 3358| 24.5k| CHECK_NULL_RETURN_MEMERR(en); ------------------ | | 314| 24.5k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 24.5k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 24.5k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 3359| 24.5k| SET_ENCLOSE_STATUS(en, NST_STOP_BT_SIMPLE_REPEAT); ------------------ | | 144| 24.5k|#define SET_ENCLOSE_STATUS(node,f) (node)->u.enclose.state |= (f) ------------------ 3360| 24.5k| swap_node(node, en); 3361| 24.5k| NENCLOSE(node)->target = en; ------------------ | | 81| 24.5k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 3362| 24.5k| } 3363| 37.9k| } 3364| 43.7k| } 3365| 47.4k| } 3366| 47.4k| } 3367| 51.4k| } 3368| 102k| else if (type == NT_ENCLOSE) { ------------------ | | 44| 102k|#define NT_ENCLOSE 6 ------------------ | Branch (3368:12): [True: 12.0k, False: 90.6k] ------------------ 3369| 12.0k| EncloseNode* en = NENCLOSE(node); ------------------ | | 81| 12.0k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 3370| 12.0k| if (en->type == ENCLOSE_MEMORY) { ------------------ | | 94| 12.0k|#define ENCLOSE_MEMORY (1<<0) ------------------ | Branch (3370:9): [True: 10.0k, False: 1.95k] ------------------ 3371| 10.0k| node = en->target; 3372| 10.0k| goto retry; 3373| 10.0k| } 3374| 12.0k| } 3375| 144k| return 0; 3376| 154k|} regcomp.c:get_head_value_node: 2746| 132k|{ 2747| 132k| Node* n = NULL_NODE; ------------------ | | 283| 132k|#define NULL_NODE ((Node* )0) ------------------ 2748| | 2749| 132k| switch (NTYPE(node)) { ------------------ | | 69| 132k|#define NTYPE(node) ((node)->u.base.type) ------------------ 2750| 0| case NT_BREF: ------------------ | | 42| 0|#define NT_BREF 4 ------------------ | Branch (2750:3): [True: 0, False: 132k] ------------------ 2751| 3.91k| case NT_ALT: ------------------ | | 47| 3.91k|#define NT_ALT 9 ------------------ | Branch (2751:3): [True: 3.91k, False: 128k] ------------------ 2752| 13.5k| case NT_CANY: ------------------ | | 41| 13.5k|#define NT_CANY 3 ------------------ | Branch (2752:3): [True: 9.64k, False: 123k] ------------------ 2753| 13.5k|#ifdef USE_SUBEXP_CALL 2754| 13.5k| case NT_CALL: ------------------ | | 48| 13.5k|#define NT_CALL 10 ------------------ | Branch (2754:3): [True: 0, False: 132k] ------------------ 2755| 13.5k|#endif 2756| 13.5k| break; 2757| | 2758| 0| case NT_CTYPE: ------------------ | | 40| 0|#define NT_CTYPE 2 ------------------ | Branch (2758:3): [True: 0, False: 132k] ------------------ 2759| 41.7k| case NT_CCLASS: ------------------ | | 39| 41.7k|#define NT_CCLASS 1 ------------------ | Branch (2759:3): [True: 41.7k, False: 91.1k] ------------------ 2760| 41.7k| if (exact == 0) { ------------------ | Branch (2760:9): [True: 37.9k, False: 3.72k] ------------------ 2761| 37.9k| n = node; 2762| 37.9k| } 2763| 41.7k| break; 2764| | 2765| 0| case NT_LIST: ------------------ | | 46| 0|#define NT_LIST 8 ------------------ | Branch (2765:3): [True: 0, False: 132k] ------------------ 2766| 0| n = get_head_value_node(NCAR(node), exact, reg); ------------------ | | 86| 0|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 2767| 0| break; 2768| | 2769| 52.8k| case NT_STR: ------------------ | | 38| 52.8k|#define NT_STR 0 ------------------ | Branch (2769:3): [True: 52.8k, False: 80.0k] ------------------ 2770| 52.8k| { 2771| 52.8k| StrNode* sn = NSTR(node); ------------------ | | 76| 52.8k|#define NSTR(node) (&((node)->u.str)) ------------------ 2772| | 2773| 52.8k| if (sn->end <= sn->s) ------------------ | Branch (2773:11): [True: 0, False: 52.8k] ------------------ 2774| 0| break; 2775| | 2776| 52.8k| if (exact == 0 || ------------------ | Branch (2776:11): [True: 24.5k, False: 28.2k] ------------------ 2777| 52.8k| NSTRING_IS_RAW(node) || !IS_IGNORECASE(reg->options)) { ------------------ | | 114| 81.1k|#define NSTRING_IS_RAW(node) (((node)->u.str.flag & NSTR_RAW) != 0) | | ------------------ | | | | 104| 28.2k|#define NSTR_RAW (1<<0) /* by backslashed number */ | | ------------------ | | | Branch (114:39): [True: 0, False: 28.2k] | | ------------------ ------------------ NSTRING_IS_RAW(node) || !IS_IGNORECASE(reg->options)) { ------------------ | | 396| 28.2k|#define IS_IGNORECASE(option) ((option) & ONIG_OPTION_IGNORECASE) | | ------------------ | | | | 454| 28.2k|#define ONIG_OPTION_IGNORECASE 1U | | ------------------ ------------------ | Branch (2777:28): [True: 28.2k, False: 0] ------------------ 2778| 52.8k| n = node; 2779| 52.8k| } 2780| 52.8k| } 2781| 0| break; 2782| | 2783| 18.8k| case NT_QTFR: ------------------ | | 43| 18.8k|#define NT_QTFR 5 ------------------ | Branch (2783:3): [True: 18.8k, False: 114k] ------------------ 2784| 18.8k| { 2785| 18.8k| QtfrNode* qn = NQTFR(node); ------------------ | | 80| 18.8k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 2786| 18.8k| if (qn->lower > 0) { ------------------ | Branch (2786:11): [True: 3.72k, False: 15.1k] ------------------ 2787| |#ifdef USE_OP_PUSH_OR_JUMP_EXACT 2788| | if (IS_NOT_NULL(qn->head_exact)) 2789| | n = qn->head_exact; 2790| | else 2791| |#endif 2792| 3.72k| n = get_head_value_node(qn->target, exact, reg); 2793| 3.72k| } 2794| 18.8k| } 2795| 18.8k| break; 2796| | 2797| 0| case NT_ENCLOSE: ------------------ | | 44| 0|#define NT_ENCLOSE 6 ------------------ | Branch (2797:3): [True: 0, False: 132k] ------------------ 2798| 0| { 2799| 0| EncloseNode* en = NENCLOSE(node); ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 2800| 0| switch (en->type) { ------------------ | Branch (2800:15): [True: 0, False: 0] ------------------ 2801| 0| case ENCLOSE_OPTION: ------------------ | | 95| 0|#define ENCLOSE_OPTION (1<<1) ------------------ | Branch (2801:7): [True: 0, False: 0] ------------------ 2802| 0| { 2803| 0| OnigOptionType options = reg->options; 2804| | 2805| 0| reg->options = NENCLOSE(node)->option; ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 2806| 0| n = get_head_value_node(NENCLOSE(node)->target, exact, reg); ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 2807| 0| reg->options = options; 2808| 0| } 2809| 0| break; 2810| | 2811| 0| case ENCLOSE_MEMORY: ------------------ | | 94| 0|#define ENCLOSE_MEMORY (1<<0) ------------------ | Branch (2811:7): [True: 0, False: 0] ------------------ 2812| 0| case ENCLOSE_STOP_BACKTRACK: ------------------ | | 96| 0|#define ENCLOSE_STOP_BACKTRACK (1<<2) ------------------ | Branch (2812:7): [True: 0, False: 0] ------------------ 2813| 0| case ENCLOSE_CONDITION: ------------------ | | 97| 0|#define ENCLOSE_CONDITION (1<<3) ------------------ | Branch (2813:7): [True: 0, False: 0] ------------------ 2814| 0| n = get_head_value_node(en->target, exact, reg); 2815| 0| break; 2816| | 2817| 0| case ENCLOSE_ABSENT: ------------------ | | 98| 0|#define ENCLOSE_ABSENT (1<<4) ------------------ | Branch (2817:7): [True: 0, False: 0] ------------------ 2818| 0| break; 2819| 0| } 2820| 0| } 2821| 0| break; 2822| | 2823| 5.97k| case NT_ANCHOR: ------------------ | | 45| 5.97k|#define NT_ANCHOR 7 ------------------ | Branch (2823:3): [True: 5.97k, False: 126k] ------------------ 2824| 5.97k| if (NANCHOR(node)->type == ANCHOR_PREC_READ) ------------------ | | 82| 5.97k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ if (NANCHOR(node)->type == ANCHOR_PREC_READ) ------------------ | | 551| 5.97k|#define ANCHOR_PREC_READ (1<<10) ------------------ | Branch (2824:9): [True: 0, False: 5.97k] ------------------ 2825| 0| n = get_head_value_node(NANCHOR(node)->target, exact, reg); ------------------ | | 82| 0|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 2826| 5.97k| break; 2827| | 2828| 0| default: ------------------ | Branch (2828:3): [True: 0, False: 132k] ------------------ 2829| 0| break; 2830| 132k| } 2831| | 2832| 132k| return n; 2833| 132k|} regcomp.c:is_not_included: 2551| 24.5k|{ 2552| 24.5k| int i; 2553| 24.5k| OnigDistance len; 2554| 24.5k| OnigCodePoint code; 2555| 24.5k| UChar *p; ------------------ | | 76| 24.5k|# define UChar OnigUChar ------------------ 2556| 24.5k| int ytype; 2557| | 2558| 49.1k| retry: 2559| 49.1k| ytype = NTYPE(y); ------------------ | | 69| 49.1k|#define NTYPE(node) ((node)->u.base.type) ------------------ 2560| 49.1k| switch (NTYPE(x)) { ------------------ | | 69| 49.1k|#define NTYPE(node) ((node)->u.base.type) ------------------ 2561| 0| case NT_CTYPE: ------------------ | | 40| 0|#define NT_CTYPE 2 ------------------ | Branch (2561:3): [True: 0, False: 49.1k] ------------------ 2562| 0| { 2563| 0| switch (ytype) { 2564| 0| case NT_CTYPE: ------------------ | | 40| 0|#define NT_CTYPE 2 ------------------ | Branch (2564:7): [True: 0, False: 0] ------------------ 2565| 0| if (NCTYPE(y)->ctype == NCTYPE(x)->ctype && ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ if (NCTYPE(y)->ctype == NCTYPE(x)->ctype && ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ | Branch (2565:6): [True: 0, False: 0] ------------------ 2566| 0| NCTYPE(y)->not != NCTYPE(x)->not && ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ NCTYPE(y)->not != NCTYPE(x)->not && ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ | Branch (2566:6): [True: 0, False: 0] ------------------ 2567| 0| NCTYPE(y)->ascii_range == NCTYPE(x)->ascii_range) ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ NCTYPE(y)->ascii_range == NCTYPE(x)->ascii_range) ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ | Branch (2567:6): [True: 0, False: 0] ------------------ 2568| 0| return 1; 2569| 0| else 2570| 0| return 0; 2571| 0| break; 2572| | 2573| 0| case NT_CCLASS: ------------------ | | 39| 0|#define NT_CCLASS 1 ------------------ | Branch (2573:7): [True: 0, False: 0] ------------------ 2574| 24.5k| swap: 2575| 24.5k| { 2576| 24.5k| Node* tmp; 2577| 24.5k| tmp = x; x = y; y = tmp; 2578| 24.5k| goto retry; 2579| 0| } 2580| 0| break; 2581| | 2582| 0| case NT_STR: ------------------ | | 38| 0|#define NT_STR 0 ------------------ | Branch (2582:7): [True: 0, False: 0] ------------------ 2583| 0| goto swap; 2584| 0| break; 2585| | 2586| 0| default: ------------------ | Branch (2586:7): [True: 0, False: 0] ------------------ 2587| 0| break; 2588| 0| } 2589| 0| } 2590| 0| break; 2591| | 2592| 24.5k| case NT_CCLASS: ------------------ | | 39| 24.5k|#define NT_CCLASS 1 ------------------ | Branch (2592:3): [True: 24.5k, False: 24.5k] ------------------ 2593| 24.5k| { 2594| 24.5k| CClassNode* xc = NCCLASS(x); ------------------ | | 77| 24.5k|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 2595| 24.5k| switch (ytype) { 2596| 0| case NT_CTYPE: ------------------ | | 40| 0|#define NT_CTYPE 2 ------------------ | Branch (2596:7): [True: 0, False: 24.5k] ------------------ 2597| 0| switch (NCTYPE(y)->ctype) { ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ 2598| 0| case ONIGENC_CTYPE_WORD: ------------------ | | 306| 0|#define ONIGENC_CTYPE_WORD 12 ------------------ | Branch (2598:2): [True: 0, False: 0] ------------------ 2599| 0| if (NCTYPE(y)->not == 0) { ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ | Branch (2599:8): [True: 0, False: 0] ------------------ 2600| 0| if (IS_NULL(xc->mbuf) && !IS_NCCLASS_NOT(xc)) { ------------------ | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 0] | | ------------------ ------------------ if (IS_NULL(xc->mbuf) && !IS_NCCLASS_NOT(xc)) { ------------------ | | 809| 0|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 802| 0|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 799| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ | Branch (2600:31): [True: 0, False: 0] ------------------ 2601| 0| for (i = 0; i < SINGLE_BYTE_SIZE; i++) { ------------------ | | 426| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 425| 0|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (2601:20): [True: 0, False: 0] ------------------ 2602| 0| if (BITSET_AT(xc->bs, i)) { ------------------ | | 448| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (448:36): [True: 0, False: 0] | | ------------------ ------------------ 2603| 0| if (NCTYPE(y)->ascii_range) { ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ | Branch (2603:9): [True: 0, False: 0] ------------------ 2604| 0| if (IS_CODE_SB_WORD(reg->enc, i)) return 0; ------------------ | | 891| 0| (ONIGENC_IS_CODE_ASCII(code) && ONIGENC_IS_CODE_WORD(enc,code)) | | ------------------ | | | | 321| 0|#define ONIGENC_IS_CODE_ASCII(code) ((code) < 128) | | | | ------------------ | | | | | Branch (321:43): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | (ONIGENC_IS_CODE_ASCII(code) && ONIGENC_IS_CODE_WORD(enc,code)) | | ------------------ | | | | 404| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | | | ------------------ | | | | | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | | | ------------------ | | | | | | | Branch (375:48): [True: 0, False: 0] | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 2605| 0| } 2606| 0| else { 2607| 0| if (ONIGENC_IS_CODE_WORD(reg->enc, i)) return 0; ------------------ | | 404| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | ------------------ | | | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (375:48): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 2608| 0| } 2609| 0| } 2610| 0| } 2611| 0| return 1; 2612| 0| } 2613| 0| return 0; 2614| 0| } 2615| 0| else { 2616| 0| if (IS_NOT_NULL(xc->mbuf)) return 0; ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ 2617| 0| for (i = 0; i < SINGLE_BYTE_SIZE; i++) { ------------------ | | 426| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 425| 0|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (2617:18): [True: 0, False: 0] ------------------ 2618| 0| int is_word; 2619| 0| if (NCTYPE(y)->ascii_range) ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ | Branch (2619:12): [True: 0, False: 0] ------------------ 2620| 0| is_word = IS_CODE_SB_WORD(reg->enc, i); ------------------ | | 891| 0| (ONIGENC_IS_CODE_ASCII(code) && ONIGENC_IS_CODE_WORD(enc,code)) | | ------------------ | | | | 321| 0|#define ONIGENC_IS_CODE_ASCII(code) ((code) < 128) | | | | ------------------ | | | | | Branch (321:43): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | (ONIGENC_IS_CODE_ASCII(code) && ONIGENC_IS_CODE_WORD(enc,code)) | | ------------------ | | | | 404| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | | | ------------------ | | | | | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | | | ------------------ | | | | | | | Branch (375:48): [True: 0, False: 0] | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 2621| 0| else 2622| 0| is_word = ONIGENC_IS_CODE_WORD(reg->enc, i); ------------------ | | 404| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | ------------------ | | | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | ------------------ ------------------ 2623| 0| if (! is_word) { ------------------ | Branch (2623:12): [True: 0, False: 0] ------------------ 2624| 0| if (!IS_NCCLASS_NOT(xc)) { ------------------ | | 809| 0|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 802| 0|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 799| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ | Branch (2624:7): [True: 0, False: 0] ------------------ 2625| 0| if (BITSET_AT(xc->bs, i)) ------------------ | | 448| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (448:36): [True: 0, False: 0] | | ------------------ ------------------ 2626| 0| return 0; 2627| 0| } 2628| 0| else { 2629| 0| if (! BITSET_AT(xc->bs, i)) ------------------ | | 448| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ | Branch (2629:9): [True: 0, False: 0] ------------------ 2630| 0| return 0; 2631| 0| } 2632| 0| } 2633| 0| } 2634| 0| return 1; 2635| 0| } 2636| 0| break; 2637| | 2638| 0| default: ------------------ | Branch (2638:2): [True: 0, False: 0] ------------------ 2639| 0| break; 2640| 0| } 2641| 0| break; 2642| | 2643| 0| case NT_CCLASS: ------------------ | | 39| 0|#define NT_CCLASS 1 ------------------ | Branch (2643:7): [True: 0, False: 24.5k] ------------------ 2644| 0| { 2645| 0| int v; 2646| 0| CClassNode* yc = NCCLASS(y); ------------------ | | 77| 0|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 2647| | 2648| 0| for (i = 0; i < SINGLE_BYTE_SIZE; i++) { ------------------ | | 426| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 425| 0|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (2648:16): [True: 0, False: 0] ------------------ 2649| 0| v = BITSET_AT(xc->bs, i); ------------------ | | 448| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 2650| 0| if ((v != 0 && !IS_NCCLASS_NOT(xc)) || ------------------ | | 809| 0|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 802| 0|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 799| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ | Branch (2650:11): [True: 0, False: 0] | Branch (2650:21): [True: 0, False: 0] ------------------ 2651| 0| (v == 0 && IS_NCCLASS_NOT(xc))) { ------------------ | | 809| 0|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 802| 0|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 799| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | | | | Branch (802:37): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ | Branch (2651:4): [True: 0, False: 0] ------------------ 2652| 0| v = BITSET_AT(yc->bs, i); ------------------ | | 448| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 2653| 0| if ((v != 0 && !IS_NCCLASS_NOT(yc)) || ------------------ | | 809| 0|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 802| 0|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 799| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ | Branch (2653:13): [True: 0, False: 0] | Branch (2653:23): [True: 0, False: 0] ------------------ 2654| 0| (v == 0 && IS_NCCLASS_NOT(yc))) ------------------ | | 809| 0|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 802| 0|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 799| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | | | | Branch (802:37): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ | Branch (2654:6): [True: 0, False: 0] ------------------ 2655| 0| return 0; 2656| 0| } 2657| 0| } 2658| 0| if ((IS_NULL(xc->mbuf) && !IS_NCCLASS_NOT(xc)) || ------------------ | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 0] | | ------------------ ------------------ if ((IS_NULL(xc->mbuf) && !IS_NCCLASS_NOT(xc)) || ------------------ | | 809| 0|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 802| 0|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 799| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ | Branch (2658:30): [True: 0, False: 0] ------------------ 2659| 0| (IS_NULL(yc->mbuf) && !IS_NCCLASS_NOT(yc))) ------------------ | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 0] | | ------------------ ------------------ (IS_NULL(yc->mbuf) && !IS_NCCLASS_NOT(yc))) ------------------ | | 809| 0|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 802| 0|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 799| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ | Branch (2659:30): [True: 0, False: 0] ------------------ 2660| 0| return 1; 2661| 0| return 0; 2662| 0| } 2663| 0| break; 2664| | 2665| 24.5k| case NT_STR: ------------------ | | 38| 24.5k|#define NT_STR 0 ------------------ | Branch (2665:7): [True: 24.5k, False: 0] ------------------ 2666| 24.5k| goto swap; 2667| 0| break; 2668| | 2669| 0| default: ------------------ | Branch (2669:7): [True: 0, False: 24.5k] ------------------ 2670| 0| break; 2671| 24.5k| } 2672| 24.5k| } 2673| 0| break; 2674| | 2675| 24.5k| case NT_STR: ------------------ | | 38| 24.5k|#define NT_STR 0 ------------------ | Branch (2675:3): [True: 24.5k, False: 24.5k] ------------------ 2676| 24.5k| { 2677| 24.5k| StrNode* xs = NSTR(x); ------------------ | | 76| 24.5k|#define NSTR(node) (&((node)->u.str)) ------------------ 2678| 24.5k| if (NSTRING_LEN(x) == 0) ------------------ | | 108| 24.5k|#define NSTRING_LEN(node) (OnigDistance )((node)->u.str.end - (node)->u.str.s) ------------------ | Branch (2678:11): [True: 0, False: 24.5k] ------------------ 2679| 0| break; 2680| | 2681| 24.5k| switch (ytype) { 2682| 0| case NT_CTYPE: ------------------ | | 40| 0|#define NT_CTYPE 2 ------------------ | Branch (2682:7): [True: 0, False: 24.5k] ------------------ 2683| 0| switch (NCTYPE(y)->ctype) { ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ 2684| 0| case ONIGENC_CTYPE_WORD: ------------------ | | 306| 0|#define ONIGENC_CTYPE_WORD 12 ------------------ | Branch (2684:2): [True: 0, False: 0] ------------------ 2685| 0| if (NCTYPE(y)->ascii_range) { ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ | Branch (2685:8): [True: 0, False: 0] ------------------ 2686| 0| if (ONIGENC_IS_MBC_ASCII_WORD(reg->enc, xs->s, xs->end)) ------------------ | | 325| 0| onigenc_ascii_is_code_ctype( \ | | ------------------ | | | Branch (325:4): [True: 0, False: 0] | | ------------------ | | 326| 0| ONIGENC_MBC_TO_CODE(enc,s,end),ONIGENC_CTYPE_WORD,enc) | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | ONIGENC_MBC_TO_CODE(enc,s,end),ONIGENC_CTYPE_WORD,enc) | | ------------------ | | | | 306| 0|#define ONIGENC_CTYPE_WORD 12 | | ------------------ ------------------ 2687| 0| return NCTYPE(y)->not; ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ 2688| 0| else 2689| 0| return !(NCTYPE(y)->not); ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ 2690| 0| } 2691| 0| else { 2692| 0| if (ONIGENC_IS_MBC_WORD(reg->enc, xs->s, xs->end)) ------------------ | | 323| 0| ONIGENC_IS_CODE_WORD(enc,ONIGENC_MBC_TO_CODE(enc,s,end)) | | ------------------ | | | | 404| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | | | ------------------ | | | | | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | | | ------------------ | | | | | | | Branch (375:48): [True: 0, False: 0] | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 2693| 0| return NCTYPE(y)->not; ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ 2694| 0| else 2695| 0| return !(NCTYPE(y)->not); ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ 2696| 0| } 2697| 0| break; 2698| 0| default: ------------------ | Branch (2698:2): [True: 0, False: 0] ------------------ 2699| 0| break; 2700| 0| } 2701| 0| break; 2702| | 2703| 24.5k| case NT_CCLASS: ------------------ | | 39| 24.5k|#define NT_CCLASS 1 ------------------ | Branch (2703:7): [True: 24.5k, False: 0] ------------------ 2704| 24.5k| { 2705| 24.5k| CClassNode* cc = NCCLASS(y); ------------------ | | 77| 24.5k|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 2706| | 2707| 24.5k| code = ONIGENC_MBC_TO_CODE(reg->enc, xs->s, ------------------ | | 369| 24.5k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) ------------------ 2708| 24.5k| xs->s + ONIGENC_MBC_MAXLEN(reg->enc)); 2709| 24.5k| return (onig_is_code_in_cc(reg->enc, code, cc) != 0 ? 0 : 1); ------------------ | Branch (2709:12): [True: 0, False: 24.5k] ------------------ 2710| 0| } 2711| 0| break; 2712| | 2713| 0| case NT_STR: ------------------ | | 38| 0|#define NT_STR 0 ------------------ | Branch (2713:7): [True: 0, False: 24.5k] ------------------ 2714| 0| { 2715| 0| UChar *q; ------------------ | | 76| 0|# define UChar OnigUChar ------------------ 2716| 0| StrNode* ys = NSTR(y); ------------------ | | 76| 0|#define NSTR(node) (&((node)->u.str)) ------------------ 2717| 0| len = NSTRING_LEN(x); ------------------ | | 108| 0|#define NSTRING_LEN(node) (OnigDistance )((node)->u.str.end - (node)->u.str.s) ------------------ 2718| 0| if (len > NSTRING_LEN(y)) len = NSTRING_LEN(y); ------------------ | | 108| 0|#define NSTRING_LEN(node) (OnigDistance )((node)->u.str.end - (node)->u.str.s) ------------------ if (len > NSTRING_LEN(y)) len = NSTRING_LEN(y); ------------------ | | 108| 0|#define NSTRING_LEN(node) (OnigDistance )((node)->u.str.end - (node)->u.str.s) ------------------ | Branch (2718:8): [True: 0, False: 0] ------------------ 2719| 0| if (NSTRING_IS_AMBIG(x) || NSTRING_IS_AMBIG(y)) { ------------------ | | 115| 0|#define NSTRING_IS_AMBIG(node) (((node)->u.str.flag & NSTR_AMBIG) != 0) | | ------------------ | | | | 105| 0|#define NSTR_AMBIG (1<<1) | | ------------------ | | | Branch (115:39): [True: 0, False: 0] | | ------------------ ------------------ if (NSTRING_IS_AMBIG(x) || NSTRING_IS_AMBIG(y)) { ------------------ | | 115| 0|#define NSTRING_IS_AMBIG(node) (((node)->u.str.flag & NSTR_AMBIG) != 0) | | ------------------ | | | | 105| 0|#define NSTR_AMBIG (1<<1) | | ------------------ | | | Branch (115:39): [True: 0, False: 0] | | ------------------ ------------------ 2720| | /* tiny version */ 2721| 0| return 0; 2722| 0| } 2723| 0| else { 2724| 0| for (i = 0, p = ys->s, q = xs->s; (OnigDistance )i < len; i++, p++, q++) { ------------------ | Branch (2724:40): [True: 0, False: 0] ------------------ 2725| 0| if (*p != *q) return 1; ------------------ | Branch (2725:12): [True: 0, False: 0] ------------------ 2726| 0| } 2727| 0| } 2728| 0| } 2729| 0| break; 2730| | 2731| 0| default: ------------------ | Branch (2731:7): [True: 0, False: 24.5k] ------------------ 2732| 0| break; 2733| 24.5k| } 2734| 24.5k| } 2735| 0| break; 2736| | 2737| 0| default: ------------------ | Branch (2737:3): [True: 0, False: 49.1k] ------------------ 2738| 0| break; 2739| 49.1k| } 2740| | 2741| 0| return 0; 2742| 49.1k|} regcomp.c:swap_node: 72| 24.5k|{ 73| 24.5k| Node c; 74| 24.5k| c = *a; *a = *b; *b = c; 75| | 76| 24.5k| if (NTYPE(a) == NT_STR) { ------------------ | | 69| 24.5k|#define NTYPE(node) ((node)->u.base.type) ------------------ if (NTYPE(a) == NT_STR) { ------------------ | | 38| 24.5k|#define NT_STR 0 ------------------ | Branch (76:7): [True: 0, False: 24.5k] ------------------ 77| 0| StrNode* sn = NSTR(a); ------------------ | | 76| 0|#define NSTR(node) (&((node)->u.str)) ------------------ 78| 0| if (sn->capa == 0) { ------------------ | Branch (78:9): [True: 0, False: 0] ------------------ 79| 0| size_t len = sn->end - sn->s; 80| 0| sn->s = sn->buf; 81| 0| sn->end = sn->s + len; 82| 0| } 83| 0| } 84| | 85| 24.5k| if (NTYPE(b) == NT_STR) { ------------------ | | 69| 24.5k|#define NTYPE(node) ((node)->u.base.type) ------------------ if (NTYPE(b) == NT_STR) { ------------------ | | 38| 24.5k|#define NT_STR 0 ------------------ | Branch (85:7): [True: 0, False: 24.5k] ------------------ 86| 0| StrNode* sn = NSTR(b); ------------------ | | 76| 0|#define NSTR(node) (&((node)->u.str)) ------------------ 87| 0| if (sn->capa == 0) { ------------------ | Branch (87:9): [True: 0, False: 0] ------------------ 88| 0| size_t len = sn->end - sn->s; 89| 0| sn->s = sn->buf; 90| 0| sn->end = sn->s + len; 91| 0| } 92| 0| } 93| 24.5k|} regcomp.c:distance_add: 97| 759k|{ 98| 759k| if (d1 == ONIG_INFINITE_DISTANCE || d2 == ONIG_INFINITE_DISTANCE) ------------------ | | 85| 1.51M|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ if (d1 == ONIG_INFINITE_DISTANCE || d2 == ONIG_INFINITE_DISTANCE) ------------------ | | 85| 579k|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ | Branch (98:7): [True: 180k, False: 579k] | Branch (98:39): [True: 57.4k, False: 521k] ------------------ 99| 237k| return ONIG_INFINITE_DISTANCE; ------------------ | | 85| 237k|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ 100| 521k| else { 101| 521k| if (d1 <= ONIG_INFINITE_DISTANCE - d2) return d1 + d2; ------------------ | | 85| 521k|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ | Branch (101:9): [True: 521k, False: 0] ------------------ 102| 0| else return ONIG_INFINITE_DISTANCE; ------------------ | | 85| 0|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ 103| 521k| } 104| 759k|} regcomp.c:clear_optimize_info: 5363| 44.0k|{ 5364| 44.0k| reg->optimize = ONIG_OPTIMIZE_NONE; ------------------ | | 355| 44.0k|#define ONIG_OPTIMIZE_NONE 0 ------------------ 5365| 44.0k| reg->anchor = 0; 5366| 44.0k| reg->anchor_dmin = 0; 5367| 44.0k| reg->anchor_dmax = 0; 5368| 44.0k| reg->sub_anchor = 0; 5369| 44.0k| reg->exact_end = (UChar* )NULL; 5370| 44.0k| reg->threshold_len = 0; 5371| 44.0k| if (IS_NOT_NULL(reg->exact)) { ------------------ | | 312| 44.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 44.0k] | | ------------------ ------------------ 5372| 0| xfree(reg->exact); ------------------ | | 145| 0|# define xfree free ------------------ 5373| 0| reg->exact = (UChar* )NULL; 5374| 0| } 5375| 44.0k|} regcomp.c:set_optimize_info_from_tree: 5303| 44.0k|{ 5304| | 5305| 44.0k| int r; 5306| 44.0k| NodeOptInfo opt; 5307| 44.0k| OptEnv env; 5308| | 5309| 44.0k| env.enc = reg->enc; 5310| 44.0k| env.options = reg->options; 5311| 44.0k| env.case_fold_flag = reg->case_fold_flag; 5312| 44.0k| env.scan_env = scan_env; 5313| 44.0k| clear_mml(&env.mmd); 5314| | 5315| 44.0k| r = optimize_node_left(node, &opt, &env); 5316| 44.0k| if (r) return r; ------------------ | Branch (5316:7): [True: 0, False: 44.0k] ------------------ 5317| | 5318| 44.0k| reg->anchor = opt.anc.left_anchor & (ANCHOR_BEGIN_BUF | ------------------ | | 540| 44.0k|#define ANCHOR_BEGIN_BUF (1<<0) ------------------ 5319| 44.0k| ANCHOR_BEGIN_POSITION | ANCHOR_ANYCHAR_STAR | ANCHOR_ANYCHAR_STAR_ML | ------------------ | | 542| 44.0k|#define ANCHOR_BEGIN_POSITION (1<<2) ------------------ ANCHOR_BEGIN_POSITION | ANCHOR_ANYCHAR_STAR | ANCHOR_ANYCHAR_STAR_ML | ------------------ | | 556| 44.0k|#define ANCHOR_ANYCHAR_STAR (1<<14) /* ".*" optimize info */ ------------------ ANCHOR_BEGIN_POSITION | ANCHOR_ANYCHAR_STAR | ANCHOR_ANYCHAR_STAR_ML | ------------------ | | 557| 44.0k|#define ANCHOR_ANYCHAR_STAR_ML (1<<15) /* ".*" optimize info (multi-line) */ ------------------ 5320| 44.0k| ANCHOR_LOOK_BEHIND); ------------------ | | 553| 44.0k|#define ANCHOR_LOOK_BEHIND (1<<12) ------------------ 5321| | 5322| 44.0k| if ((opt.anc.left_anchor & (ANCHOR_LOOK_BEHIND | ANCHOR_PREC_READ_NOT)) != 0) ------------------ | | 553| 44.0k|#define ANCHOR_LOOK_BEHIND (1<<12) ------------------ if ((opt.anc.left_anchor & (ANCHOR_LOOK_BEHIND | ANCHOR_PREC_READ_NOT)) != 0) ------------------ | | 552| 44.0k|#define ANCHOR_PREC_READ_NOT (1<<11) ------------------ | Branch (5322:7): [True: 0, False: 44.0k] ------------------ 5323| 0| reg->anchor &= ~ANCHOR_ANYCHAR_STAR_ML; ------------------ | | 557| 0|#define ANCHOR_ANYCHAR_STAR_ML (1<<15) /* ".*" optimize info (multi-line) */ ------------------ 5324| | 5325| 44.0k| reg->anchor |= opt.anc.right_anchor & (ANCHOR_END_BUF | ANCHOR_SEMI_END_BUF | ------------------ | | 543| 44.0k|#define ANCHOR_END_BUF (1<<3) ------------------ reg->anchor |= opt.anc.right_anchor & (ANCHOR_END_BUF | ANCHOR_SEMI_END_BUF | ------------------ | | 544| 44.0k|#define ANCHOR_SEMI_END_BUF (1<<4) ------------------ 5326| 44.0k| ANCHOR_PREC_READ_NOT); ------------------ | | 552| 44.0k|#define ANCHOR_PREC_READ_NOT (1<<11) ------------------ 5327| | 5328| 44.0k| if (reg->anchor & (ANCHOR_END_BUF | ANCHOR_SEMI_END_BUF)) { ------------------ | | 543| 44.0k|#define ANCHOR_END_BUF (1<<3) ------------------ if (reg->anchor & (ANCHOR_END_BUF | ANCHOR_SEMI_END_BUF)) { ------------------ | | 544| 44.0k|#define ANCHOR_SEMI_END_BUF (1<<4) ------------------ | Branch (5328:7): [True: 0, False: 44.0k] ------------------ 5329| 0| reg->anchor_dmin = opt.len.min; 5330| 0| reg->anchor_dmax = opt.len.max; 5331| 0| } 5332| | 5333| 44.0k| if (opt.exb.len > 0 || opt.exm.len > 0) { ------------------ | Branch (5333:7): [True: 1.91k, False: 42.1k] | Branch (5333:26): [True: 28.7k, False: 13.3k] ------------------ 5334| 30.6k| select_opt_exact_info(reg->enc, &opt.exb, &opt.exm); 5335| 30.6k| if (opt.map.value > 0 && ------------------ | Branch (5335:9): [True: 30.6k, False: 0] ------------------ 5336| 30.6k| comp_opt_exact_or_map_info(&opt.exb, &opt.map) > 0) { ------------------ | Branch (5336:2): [True: 9.59k, False: 21.0k] ------------------ 5337| 9.59k| goto set_map; 5338| 9.59k| } 5339| 21.0k| else { 5340| 21.0k| r = set_optimize_exact_info(reg, &opt.exb); 5341| 21.0k| set_sub_anchor(reg, &opt.exb.anc); 5342| 21.0k| } 5343| 30.6k| } 5344| 13.3k| else if (opt.map.value > 0) { ------------------ | Branch (5344:12): [True: 5.75k, False: 7.62k] ------------------ 5345| 15.3k| set_map: 5346| 15.3k| set_optimize_map_info(reg, &opt.map); 5347| 15.3k| set_sub_anchor(reg, &opt.map.anc); 5348| 15.3k| } 5349| 7.62k| else { 5350| 7.62k| reg->sub_anchor |= opt.anc.left_anchor & ANCHOR_BEGIN_LINE; ------------------ | | 541| 7.62k|#define ANCHOR_BEGIN_LINE (1<<1) ------------------ 5351| 7.62k| if (opt.len.max == 0) ------------------ | Branch (5351:9): [True: 3.80k, False: 3.81k] ------------------ 5352| 3.80k| reg->sub_anchor |= opt.anc.right_anchor & ANCHOR_END_LINE; ------------------ | | 545| 3.80k|#define ANCHOR_END_LINE (1<<5) ------------------ 5353| 7.62k| } 5354| | 5355| |#if defined(ONIG_DEBUG_COMPILE) || defined(ONIG_DEBUG_MATCH) 5356| | print_optimize_info(stderr, reg); 5357| |#endif 5358| 44.0k| return r; 5359| 44.0k|} regcomp.c:clear_mml: 4385| 1.50M|{ 4386| 1.50M| mml->min = mml->max = 0; 4387| 1.50M|} regcomp.c:optimize_node_left: 4866| 355k|{ 4867| 355k| int type; 4868| 355k| int r = 0; 4869| | 4870| 355k| clear_node_opt_info(opt); 4871| 355k| set_bound_node_opt_info(opt, &env->mmd); 4872| | 4873| 355k| type = NTYPE(node); ------------------ | | 69| 355k|#define NTYPE(node) ((node)->u.base.type) ------------------ 4874| 355k| switch (type) { 4875| 45.9k| case NT_LIST: ------------------ | | 46| 45.9k|#define NT_LIST 8 ------------------ | Branch (4875:3): [True: 45.9k, False: 309k] ------------------ 4876| 45.9k| { 4877| 45.9k| OptEnv nenv; 4878| 45.9k| NodeOptInfo nopt; 4879| 45.9k| Node* nd = node; 4880| | 4881| 45.9k| copy_opt_env(&nenv, env); 4882| 189k| do { 4883| 189k| r = optimize_node_left(NCAR(nd), &nopt, &nenv); ------------------ | | 86| 189k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 189k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 4884| 189k| if (r == 0) { ------------------ | Branch (4884:6): [True: 189k, False: 0] ------------------ 4885| 189k| add_mml(&nenv.mmd, &nopt.len); 4886| 189k| concat_left_node_opt_info(env->enc, opt, &nopt); 4887| 189k| } 4888| 189k| } while (r == 0 && IS_NOT_NULL(nd = NCDR(nd))); ------------------ | | 312| 189k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 144k, False: 45.9k] | | ------------------ ------------------ | Branch (4888:16): [True: 189k, False: 0] ------------------ 4889| 45.9k| } 4890| 45.9k| break; 4891| | 4892| 11.8k| case NT_ALT: ------------------ | | 47| 11.8k|#define NT_ALT 9 ------------------ | Branch (4892:3): [True: 11.8k, False: 343k] ------------------ 4893| 11.8k| { 4894| 11.8k| NodeOptInfo nopt; 4895| 11.8k| Node* nd = node; 4896| | 4897| 27.6k| do { 4898| 27.6k| r = optimize_node_left(NCAR(nd), &nopt, env); ------------------ | | 86| 27.6k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 27.6k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 4899| 27.6k| if (r == 0) { ------------------ | Branch (4899:6): [True: 27.6k, False: 0] ------------------ 4900| 27.6k| if (nd == node) copy_node_opt_info(opt, &nopt); ------------------ | Branch (4900:8): [True: 11.8k, False: 15.8k] ------------------ 4901| 15.8k| else alt_merge_node_opt_info(opt, &nopt, env); 4902| 27.6k| } 4903| 27.6k| } while ((r == 0) && IS_NOT_NULL(nd = NCDR(nd))); ------------------ | | 312| 27.6k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 15.8k, False: 11.8k] | | ------------------ ------------------ | Branch (4903:16): [True: 27.6k, False: 0] ------------------ 4904| 11.8k| } 4905| 11.8k| break; 4906| | 4907| 83.2k| case NT_STR: ------------------ | | 38| 83.2k|#define NT_STR 0 ------------------ | Branch (4907:3): [True: 83.2k, False: 272k] ------------------ 4908| 83.2k| { 4909| 83.2k| StrNode* sn = NSTR(node); ------------------ | | 76| 83.2k|#define NSTR(node) (&((node)->u.str)) ------------------ 4910| 83.2k| OnigDistance slen = sn->end - sn->s; 4911| 83.2k| int is_raw = NSTRING_IS_RAW(node); ------------------ | | 114| 83.2k|#define NSTRING_IS_RAW(node) (((node)->u.str.flag & NSTR_RAW) != 0) | | ------------------ | | | | 104| 83.2k|#define NSTR_RAW (1<<0) /* by backslashed number */ | | ------------------ ------------------ 4912| | 4913| 83.2k| if (! NSTRING_IS_AMBIG(node)) { ------------------ | | 115| 83.2k|#define NSTRING_IS_AMBIG(node) (((node)->u.str.flag & NSTR_AMBIG) != 0) | | ------------------ | | | | 105| 83.2k|#define NSTR_AMBIG (1<<1) | | ------------------ ------------------ | Branch (4913:11): [True: 83.2k, False: 0] ------------------ 4914| 83.2k| concat_opt_exact_info_str(&opt->exb, sn->s, sn->end, 4915| 83.2k| is_raw, env->enc); 4916| 83.2k| opt->exb.ignore_case = 0; 4917| 83.2k| if (slen > 0) { ------------------ | Branch (4917:6): [True: 81.2k, False: 1.95k] ------------------ 4918| 81.2k| add_char_opt_map_info(&opt->map, *(sn->s), env->enc); 4919| 81.2k| } 4920| 83.2k| set_mml(&opt->len, slen, slen); 4921| 83.2k| } 4922| 0| else { 4923| 0| OnigDistance max; 4924| | 4925| 0| if (NSTRING_IS_DONT_GET_OPT_INFO(node)) { ------------------ | | 117| 0| (((node)->u.str.flag & NSTR_DONT_GET_OPT_INFO) != 0) | | ------------------ | | | | 106| 0|#define NSTR_DONT_GET_OPT_INFO (1<<2) | | ------------------ | | | Branch (117:3): [True: 0, False: 0] | | ------------------ ------------------ 4926| 0| int n = onigenc_strlen(env->enc, sn->s, sn->end); 4927| 0| max = (OnigDistance )ONIGENC_MBC_MAXLEN_DIST(env->enc) * n; ------------------ | | 366| 0|#define ONIGENC_MBC_MAXLEN_DIST(enc) ONIGENC_MBC_MAXLEN(enc) | | ------------------ | | | | 365| 0|#define ONIGENC_MBC_MAXLEN(enc) ((enc)->max_enc_len) | | ------------------ ------------------ 4928| 0| } 4929| 0| else { 4930| 0| concat_opt_exact_info_str(&opt->exb, sn->s, sn->end, 4931| 0| is_raw, env->enc); 4932| 0| opt->exb.ignore_case = 1; 4933| | 4934| 0| if (slen > 0) { ------------------ | Branch (4934:8): [True: 0, False: 0] ------------------ 4935| 0| r = add_char_amb_opt_map_info(&opt->map, sn->s, sn->end, 4936| 0| env->enc, env->case_fold_flag); 4937| 0| if (r != 0) break; ------------------ | Branch (4937:10): [True: 0, False: 0] ------------------ 4938| 0| } 4939| | 4940| 0| max = slen; 4941| 0| } 4942| | 4943| 0| set_mml(&opt->len, slen, max); 4944| 0| } 4945| | 4946| 83.2k| if ((OnigDistance )opt->exb.len == slen) ------------------ | Branch (4946:11): [True: 75.5k, False: 7.73k] ------------------ 4947| 75.5k| opt->exb.reach_end = 1; 4948| 83.2k| } 4949| 0| break; 4950| | 4951| 45.6k| case NT_CCLASS: ------------------ | | 39| 45.6k|#define NT_CCLASS 1 ------------------ | Branch (4951:3): [True: 45.6k, False: 309k] ------------------ 4952| 45.6k| { 4953| 45.6k| int i, z; 4954| 45.6k| CClassNode* cc = NCCLASS(node); ------------------ | | 77| 45.6k|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 4955| | 4956| | /* no need to check ignore case. (set in setup_tree()) */ 4957| | 4958| 45.6k| if (IS_NOT_NULL(cc->mbuf) || IS_NCCLASS_NOT(cc)) { ------------------ | | 312| 91.3k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 45.6k] | | ------------------ ------------------ if (IS_NOT_NULL(cc->mbuf) || IS_NCCLASS_NOT(cc)) { ------------------ | | 809| 45.6k|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 802| 45.6k|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 799| 45.6k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | | | | Branch (802:37): [True: 11.1k, False: 34.5k] | | | | ------------------ | | ------------------ ------------------ 4959| 11.1k| OnigDistance min = ONIGENC_MBC_MINLEN(env->enc); ------------------ | | 367| 11.1k|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) ------------------ 4960| 11.1k| OnigDistance max = ONIGENC_MBC_MAXLEN_DIST(env->enc); ------------------ | | 366| 11.1k|#define ONIGENC_MBC_MAXLEN_DIST(enc) ONIGENC_MBC_MAXLEN(enc) | | ------------------ | | | | 365| 11.1k|#define ONIGENC_MBC_MAXLEN(enc) ((enc)->max_enc_len) | | ------------------ ------------------ 4961| | 4962| 11.1k| set_mml(&opt->len, min, max); 4963| 11.1k| } 4964| 34.5k| else { 4965| 8.87M| for (i = 0; i < SINGLE_BYTE_SIZE; i++) { ------------------ | | 426| 8.87M|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 425| 8.87M|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (4965:14): [True: 8.83M, False: 34.5k] ------------------ 4966| 8.83M| z = BITSET_AT(cc->bs, i); ------------------ | | 448| 8.83M|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 445| 8.83M|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 8.83M|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 8.83M|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 446| 8.83M|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 8.83M|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 8.83M|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 4967| 8.83M| if ((z && !IS_NCCLASS_NOT(cc)) || (!z && IS_NCCLASS_NOT(cc))) { ------------------ | | 809| 168k|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 802| 168k|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 799| 168k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ if ((z && !IS_NCCLASS_NOT(cc)) || (!z && IS_NCCLASS_NOT(cc))) { ------------------ | | 809| 8.66M|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 802| 8.66M|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 799| 8.66M|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | | | | Branch (802:37): [True: 0, False: 8.66M] | | | | ------------------ | | ------------------ ------------------ | Branch (4967:9): [True: 168k, False: 8.66M] | Branch (4967:14): [True: 168k, False: 0] | Branch (4967:39): [True: 8.66M, False: 0] ------------------ 4968| 168k| add_char_opt_map_info(&opt->map, (UChar )i, env->enc); 4969| 168k| } 4970| 8.83M| } 4971| 34.5k| set_mml(&opt->len, 1, 1); 4972| 34.5k| } 4973| 45.6k| } 4974| 45.6k| break; 4975| | 4976| 0| case NT_CTYPE: ------------------ | | 40| 0|#define NT_CTYPE 2 ------------------ | Branch (4976:3): [True: 0, False: 355k] ------------------ 4977| 0| { 4978| 0| int i, min, max; 4979| 0| int maxcode; 4980| | 4981| 0| max = ONIGENC_MBC_MAXLEN_DIST(env->enc); ------------------ | | 366| 0|#define ONIGENC_MBC_MAXLEN_DIST(enc) ONIGENC_MBC_MAXLEN(enc) | | ------------------ | | | | 365| 0|#define ONIGENC_MBC_MAXLEN(enc) ((enc)->max_enc_len) | | ------------------ ------------------ 4982| | 4983| 0| if (max == 1) { ------------------ | Branch (4983:11): [True: 0, False: 0] ------------------ 4984| 0| min = 1; 4985| | 4986| 0| maxcode = NCTYPE(node)->ascii_range ? 0x80 : SINGLE_BYTE_SIZE; ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ maxcode = NCTYPE(node)->ascii_range ? 0x80 : SINGLE_BYTE_SIZE; ------------------ | | 426| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 425| 0|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (4986:12): [True: 0, False: 0] ------------------ 4987| 0| switch (NCTYPE(node)->ctype) { ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ | Branch (4987:10): [True: 0, False: 0] ------------------ 4988| 0| case ONIGENC_CTYPE_WORD: ------------------ | | 306| 0|#define ONIGENC_CTYPE_WORD 12 ------------------ | Branch (4988:2): [True: 0, False: 0] ------------------ 4989| 0| if (NCTYPE(node)->not != 0) { ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ | Branch (4989:8): [True: 0, False: 0] ------------------ 4990| 0| for (i = 0; i < SINGLE_BYTE_SIZE; i++) { ------------------ | | 426| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 425| 0|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (4990:18): [True: 0, False: 0] ------------------ 4991| 0| if (! ONIGENC_IS_CODE_WORD(env->enc, i) || i >= maxcode) { ------------------ | | 404| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | ------------------ | | | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | ------------------ ------------------ | Branch (4991:12): [True: 0, False: 0] | Branch (4991:51): [True: 0, False: 0] ------------------ 4992| 0| add_char_opt_map_info(&opt->map, (UChar )i, env->enc); 4993| 0| } 4994| 0| } 4995| 0| } 4996| 0| else { 4997| 0| for (i = 0; i < maxcode; i++) { ------------------ | Branch (4997:18): [True: 0, False: 0] ------------------ 4998| 0| if (ONIGENC_IS_CODE_WORD(env->enc, i)) { ------------------ | | 404| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | ------------------ | | | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (375:48): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 4999| 0| add_char_opt_map_info(&opt->map, (UChar )i, env->enc); 5000| 0| } 5001| 0| } 5002| 0| } 5003| 0| break; 5004| 0| } 5005| 0| } 5006| 0| else { 5007| 0| min = ONIGENC_MBC_MINLEN(env->enc); ------------------ | | 367| 0|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) ------------------ 5008| 0| } 5009| 0| set_mml(&opt->len, min, max); 5010| 0| } 5011| 0| break; 5012| | 5013| 19.3k| case NT_CANY: ------------------ | | 41| 19.3k|#define NT_CANY 3 ------------------ | Branch (5013:3): [True: 19.3k, False: 336k] ------------------ 5014| 19.3k| { 5015| 19.3k| OnigDistance min = ONIGENC_MBC_MINLEN(env->enc); ------------------ | | 367| 19.3k|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) ------------------ 5016| 19.3k| OnigDistance max = ONIGENC_MBC_MAXLEN_DIST(env->enc); ------------------ | | 366| 19.3k|#define ONIGENC_MBC_MAXLEN_DIST(enc) ONIGENC_MBC_MAXLEN(enc) | | ------------------ | | | | 365| 19.3k|#define ONIGENC_MBC_MAXLEN(enc) ((enc)->max_enc_len) | | ------------------ ------------------ 5017| 19.3k| set_mml(&opt->len, min, max); 5018| 19.3k| } 5019| 19.3k| break; 5020| | 5021| 55.6k| case NT_ANCHOR: ------------------ | | 45| 55.6k|#define NT_ANCHOR 7 ------------------ | Branch (5021:3): [True: 55.6k, False: 299k] ------------------ 5022| 55.6k| switch (NANCHOR(node)->type) { ------------------ | | 82| 55.6k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ | Branch (5022:13): [True: 1.91k, False: 53.7k] ------------------ 5023| 0| case ANCHOR_BEGIN_BUF: ------------------ | | 540| 0|#define ANCHOR_BEGIN_BUF (1<<0) ------------------ | Branch (5023:5): [True: 0, False: 55.6k] ------------------ 5024| 0| case ANCHOR_BEGIN_POSITION: ------------------ | | 542| 0|#define ANCHOR_BEGIN_POSITION (1<<2) ------------------ | Branch (5024:5): [True: 0, False: 55.6k] ------------------ 5025| 38.2k| case ANCHOR_BEGIN_LINE: ------------------ | | 541| 38.2k|#define ANCHOR_BEGIN_LINE (1<<1) ------------------ | Branch (5025:5): [True: 38.2k, False: 17.3k] ------------------ 5026| 38.2k| case ANCHOR_END_BUF: ------------------ | | 543| 38.2k|#define ANCHOR_END_BUF (1<<3) ------------------ | Branch (5026:5): [True: 0, False: 55.6k] ------------------ 5027| 38.2k| case ANCHOR_SEMI_END_BUF: ------------------ | | 544| 38.2k|#define ANCHOR_SEMI_END_BUF (1<<4) ------------------ | Branch (5027:5): [True: 0, False: 55.6k] ------------------ 5028| 53.7k| case ANCHOR_END_LINE: ------------------ | | 545| 53.7k|#define ANCHOR_END_LINE (1<<5) ------------------ | Branch (5028:5): [True: 15.4k, False: 40.1k] ------------------ 5029| 53.7k| case ANCHOR_LOOK_BEHIND: /* just for (?<=x).* */ ------------------ | | 553| 53.7k|#define ANCHOR_LOOK_BEHIND (1<<12) ------------------ | Branch (5029:5): [True: 0, False: 55.6k] ------------------ 5030| 53.7k| case ANCHOR_PREC_READ_NOT: /* just for (?!x).* */ ------------------ | | 552| 53.7k|#define ANCHOR_PREC_READ_NOT (1<<11) ------------------ | Branch (5030:5): [True: 0, False: 55.6k] ------------------ 5031| 53.7k| add_opt_anc_info(&opt->anc, NANCHOR(node)->type); ------------------ | | 82| 53.7k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 5032| 53.7k| break; 5033| | 5034| 0| case ANCHOR_PREC_READ: ------------------ | | 551| 0|#define ANCHOR_PREC_READ (1<<10) ------------------ | Branch (5034:5): [True: 0, False: 55.6k] ------------------ 5035| 0| { 5036| 0| NodeOptInfo nopt; 5037| | 5038| 0| r = optimize_node_left(NANCHOR(node)->target, &nopt, env); ------------------ | | 82| 0|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 5039| 0| if (r == 0) { ------------------ | Branch (5039:6): [True: 0, False: 0] ------------------ 5040| 0| if (nopt.exb.len > 0) ------------------ | Branch (5040:8): [True: 0, False: 0] ------------------ 5041| 0| copy_opt_exact_info(&opt->expr, &nopt.exb); 5042| 0| else if (nopt.exm.len > 0) ------------------ | Branch (5042:13): [True: 0, False: 0] ------------------ 5043| 0| copy_opt_exact_info(&opt->expr, &nopt.exm); 5044| | 5045| 0| opt->expr.reach_end = 0; 5046| | 5047| 0| if (nopt.map.value > 0) ------------------ | Branch (5047:8): [True: 0, False: 0] ------------------ 5048| 0| copy_opt_map_info(&opt->map, &nopt.map); 5049| 0| } 5050| 0| } 5051| 0| break; 5052| | 5053| 0| case ANCHOR_LOOK_BEHIND_NOT: ------------------ | | 554| 0|#define ANCHOR_LOOK_BEHIND_NOT (1<<13) ------------------ | Branch (5053:5): [True: 0, False: 55.6k] ------------------ 5054| 0| break; 5055| 55.6k| } 5056| 55.6k| break; 5057| | 5058| 55.6k| case NT_BREF: ------------------ | | 42| 0|#define NT_BREF 4 ------------------ | Branch (5058:3): [True: 0, False: 355k] ------------------ 5059| 0| { 5060| 0| int i; 5061| 0| int* backs; 5062| 0| OnigDistance min, max, tmin, tmax; 5063| 0| Node** nodes = SCANENV_MEM_NODES(env->scan_env); ------------------ | | 287| 0| (IS_NOT_NULL((senv)->mem_nodes_dynamic) ? \ | | ------------------ | | | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | | | ------------------ | | | | | Branch (312:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 288| 0| (senv)->mem_nodes_dynamic : (senv)->mem_nodes_static) ------------------ 5064| 0| BRefNode* br = NBREF(node); ------------------ | | 79| 0|#define NBREF(node) (&((node)->u.bref)) ------------------ 5065| | 5066| 0| if (br->state & NST_RECURSION) { ------------------ | | 135| 0|#define NST_RECURSION (1<<7) ------------------ | Branch (5066:11): [True: 0, False: 0] ------------------ 5067| 0| set_mml(&opt->len, 0, ONIG_INFINITE_DISTANCE); ------------------ | | 85| 0|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ 5068| 0| break; 5069| 0| } 5070| 0| backs = BACKREFS_P(br); ------------------ | | 120| 0| (IS_NOT_NULL((br)->back_dynamic) ? (br)->back_dynamic : (br)->back_static); | | ------------------ | | | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | | | ------------------ | | | | | Branch (312:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 5071| 0| r = get_min_match_length(nodes[backs[0]], &min, env->scan_env); 5072| 0| if (r != 0) break; ------------------ | Branch (5072:11): [True: 0, False: 0] ------------------ 5073| 0| r = get_max_match_length(nodes[backs[0]], &max, env->scan_env); 5074| 0| if (r != 0) break; ------------------ | Branch (5074:11): [True: 0, False: 0] ------------------ 5075| 0| for (i = 1; i < br->back_num; i++) { ------------------ | Branch (5075:19): [True: 0, False: 0] ------------------ 5076| 0| r = get_min_match_length(nodes[backs[i]], &tmin, env->scan_env); 5077| 0| if (r != 0) break; ------------------ | Branch (5077:6): [True: 0, False: 0] ------------------ 5078| 0| r = get_max_match_length(nodes[backs[i]], &tmax, env->scan_env); 5079| 0| if (r != 0) break; ------------------ | Branch (5079:6): [True: 0, False: 0] ------------------ 5080| 0| if (min > tmin) min = tmin; ------------------ | Branch (5080:6): [True: 0, False: 0] ------------------ 5081| 0| if (max < tmax) max = tmax; ------------------ | Branch (5081:6): [True: 0, False: 0] ------------------ 5082| 0| } 5083| 0| if (r == 0) set_mml(&opt->len, min, max); ------------------ | Branch (5083:11): [True: 0, False: 0] ------------------ 5084| 0| } 5085| 0| break; 5086| | 5087| 0|#ifdef USE_SUBEXP_CALL 5088| 0| case NT_CALL: ------------------ | | 48| 0|#define NT_CALL 10 ------------------ | Branch (5088:3): [True: 0, False: 355k] ------------------ 5089| 0| if (IS_CALL_RECURSION(NCALL(node))) ------------------ | | 161| 0|#define IS_CALL_RECURSION(cn) (((cn)->state & NST_RECURSION) != 0) | | ------------------ | | | | 135| 0|#define NST_RECURSION (1<<7) | | ------------------ | | | Branch (161:40): [True: 0, False: 0] | | ------------------ ------------------ 5090| 0| set_mml(&opt->len, 0, ONIG_INFINITE_DISTANCE); ------------------ | | 85| 0|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ 5091| 0| else { 5092| 0| OnigOptionType save = env->options; 5093| 0| env->options = NENCLOSE(NCALL(node)->target)->option; ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 5094| 0| r = optimize_node_left(NCALL(node)->target, opt, env); ------------------ | | 84| 0|#define NCALL(node) (&((node)->u.call)) ------------------ 5095| 0| env->options = save; 5096| 0| } 5097| 0| break; 5098| 0|#endif 5099| | 5100| 57.1k| case NT_QTFR: ------------------ | | 43| 57.1k|#define NT_QTFR 5 ------------------ | Branch (5100:3): [True: 57.1k, False: 298k] ------------------ 5101| 57.1k| { 5102| 57.1k| int i; 5103| 57.1k| OnigDistance min, max; 5104| 57.1k| NodeOptInfo nopt; 5105| 57.1k| QtfrNode* qn = NQTFR(node); ------------------ | | 80| 57.1k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 5106| | 5107| 57.1k| r = optimize_node_left(qn->target, &nopt, env); 5108| 57.1k| if (r) break; ------------------ | Branch (5108:11): [True: 0, False: 57.1k] ------------------ 5109| | 5110| 57.1k| if (qn->lower == 0 && IS_REPEAT_INFINITE(qn->upper)) { ------------------ | | 422| 23.1k|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 421| 23.1k|#define REPEAT_INFINITE -1 | | ------------------ | | | Branch (422:33): [True: 21.1k, False: 1.96k] | | ------------------ ------------------ | Branch (5110:11): [True: 23.1k, False: 34.0k] ------------------ 5111| 21.1k| if (env->mmd.max == 0 && ------------------ | Branch (5111:6): [True: 11.5k, False: 9.59k] ------------------ 5112| 21.1k| NTYPE(qn->target) == NT_CANY && qn->greedy) { ------------------ | | 69| 11.5k|#define NTYPE(node) ((node)->u.base.type) ------------------ NTYPE(qn->target) == NT_CANY && qn->greedy) { ------------------ | | 41| 32.7k|#define NT_CANY 3 ------------------ | Branch (5112:6): [True: 0, False: 11.5k] | Branch (5112:38): [True: 0, False: 0] ------------------ 5113| 0| if (IS_MULTILINE(env->options)) ------------------ | | 395| 0|#define IS_MULTILINE(option) ((option) & ONIG_OPTION_MULTILINE) | | ------------------ | | | | 456| 0|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | ------------------ | | | | | | 455| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | ------------------ | | | | | | | | 454| 0|#define ONIG_OPTION_IGNORECASE 1U | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (395:35): [True: 0, False: 0] | | ------------------ ------------------ 5114| | /* implicit anchor: /.*a/ ==> /\A.*a/ */ 5115| 0| add_opt_anc_info(&opt->anc, ANCHOR_ANYCHAR_STAR_ML); ------------------ | | 557| 0|#define ANCHOR_ANYCHAR_STAR_ML (1<<15) /* ".*" optimize info (multi-line) */ ------------------ 5116| 0| else 5117| 0| add_opt_anc_info(&opt->anc, ANCHOR_ANYCHAR_STAR); ------------------ | | 556| 0|#define ANCHOR_ANYCHAR_STAR (1<<14) /* ".*" optimize info */ ------------------ 5118| 0| } 5119| 21.1k| } 5120| 35.9k| else { 5121| 35.9k| if (qn->lower > 0) { ------------------ | Branch (5121:6): [True: 34.0k, False: 1.96k] ------------------ 5122| 34.0k| copy_node_opt_info(opt, &nopt); 5123| 34.0k| if (nopt.exb.len > 0) { ------------------ | Branch (5123:8): [True: 0, False: 34.0k] ------------------ 5124| 0| if (nopt.exb.reach_end) { ------------------ | Branch (5124:10): [True: 0, False: 0] ------------------ 5125| 0| for (i = 2; i <= qn->lower && ------------------ | Branch (5125:20): [True: 0, False: 0] ------------------ 5126| 0| ! is_full_opt_exact_info(&opt->exb); i++) { ------------------ | Branch (5126:6): [True: 0, False: 0] ------------------ 5127| 0| concat_opt_exact_info(&opt->exb, &nopt.exb, env->enc); 5128| 0| } 5129| 0| if (i < qn->lower) { ------------------ | Branch (5129:12): [True: 0, False: 0] ------------------ 5130| 0| opt->exb.reach_end = 0; 5131| 0| } 5132| 0| } 5133| 0| } 5134| | 5135| 34.0k| if (qn->lower != qn->upper) { ------------------ | Branch (5135:8): [True: 34.0k, False: 0] ------------------ 5136| 34.0k| opt->exb.reach_end = 0; 5137| 34.0k| opt->exm.reach_end = 0; 5138| 34.0k| } 5139| 34.0k| if (qn->lower > 1) ------------------ | Branch (5139:8): [True: 0, False: 34.0k] ------------------ 5140| 0| opt->exm.reach_end = 0; 5141| 34.0k| } 5142| 35.9k| } 5143| | 5144| 57.1k| min = distance_multiply(nopt.len.min, qn->lower); 5145| 57.1k| if (IS_REPEAT_INFINITE(qn->upper)) ------------------ | | 422| 57.1k|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 421| 57.1k|#define REPEAT_INFINITE -1 | | ------------------ | | | Branch (422:33): [True: 55.1k, False: 1.96k] | | ------------------ ------------------ 5146| 55.1k| max = (nopt.len.max > 0 ? ONIG_INFINITE_DISTANCE : 0); ------------------ | | 85| 55.1k|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ | Branch (5146:9): [True: 55.1k, False: 0] ------------------ 5147| 1.96k| else 5148| 1.96k| max = distance_multiply(nopt.len.max, qn->upper); 5149| | 5150| 57.1k| set_mml(&opt->len, min, max); 5151| 57.1k| } 5152| 0| break; 5153| | 5154| 36.5k| case NT_ENCLOSE: ------------------ | | 44| 36.5k|#define NT_ENCLOSE 6 ------------------ | Branch (5154:3): [True: 36.5k, False: 318k] ------------------ 5155| 36.5k| { 5156| 36.5k| EncloseNode* en = NENCLOSE(node); ------------------ | | 81| 36.5k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 5157| | 5158| 36.5k| switch (en->type) { ------------------ | Branch (5158:15): [True: 0, False: 36.5k] ------------------ 5159| 1.95k| case ENCLOSE_OPTION: ------------------ | | 95| 1.95k|#define ENCLOSE_OPTION (1<<1) ------------------ | Branch (5159:7): [True: 1.95k, False: 34.6k] ------------------ 5160| 1.95k| { 5161| 1.95k| OnigOptionType save = env->options; 5162| | 5163| 1.95k| env->options = en->option; 5164| 1.95k| r = optimize_node_left(en->target, opt, env); 5165| 1.95k| env->options = save; 5166| 1.95k| } 5167| 1.95k| break; 5168| | 5169| 10.0k| case ENCLOSE_MEMORY: ------------------ | | 94| 10.0k|#define ENCLOSE_MEMORY (1<<0) ------------------ | Branch (5169:7): [True: 10.0k, False: 26.5k] ------------------ 5170| 10.0k|#ifdef USE_SUBEXP_CALL 5171| 10.0k| en->opt_count++; 5172| 10.0k| if (en->opt_count > MAX_NODE_OPT_INFO_REF_COUNT) { ------------------ | | 4862| 10.0k|#define MAX_NODE_OPT_INFO_REF_COUNT 5 ------------------ | Branch (5172:6): [True: 0, False: 10.0k] ------------------ 5173| 0| OnigDistance min, max; 5174| | 5175| 0| min = 0; 5176| 0| max = ONIG_INFINITE_DISTANCE; ------------------ | | 85| 0|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ 5177| 0| if (IS_ENCLOSE_MIN_FIXED(en)) min = en->min_len; ------------------ | | 152| 0|#define IS_ENCLOSE_MIN_FIXED(en) (((en)->state & NST_MIN_FIXED) != 0) | | ------------------ | | | | 128| 0|#define NST_MIN_FIXED (1<<0) | | ------------------ | | | Branch (152:40): [True: 0, False: 0] | | ------------------ ------------------ 5178| 0| if (IS_ENCLOSE_MAX_FIXED(en)) max = en->max_len; ------------------ | | 153| 0|#define IS_ENCLOSE_MAX_FIXED(en) (((en)->state & NST_MAX_FIXED) != 0) | | ------------------ | | | | 129| 0|#define NST_MAX_FIXED (1<<1) | | ------------------ | | | Branch (153:40): [True: 0, False: 0] | | ------------------ ------------------ 5179| 0| set_mml(&opt->len, min, max); 5180| 0| } 5181| 10.0k| else 5182| 10.0k|#endif 5183| 10.0k| { 5184| 10.0k| r = optimize_node_left(en->target, opt, env); 5185| | 5186| 10.0k| if (is_set_opt_anc_info(&opt->anc, ANCHOR_ANYCHAR_STAR_MASK)) { ------------------ | | 91| 10.0k|#define ANCHOR_ANYCHAR_STAR_MASK (ANCHOR_ANYCHAR_STAR | ANCHOR_ANYCHAR_STAR_ML) | | ------------------ | | | | 556| 10.0k|#define ANCHOR_ANYCHAR_STAR (1<<14) /* ".*" optimize info */ | | ------------------ | | #define ANCHOR_ANYCHAR_STAR_MASK (ANCHOR_ANYCHAR_STAR | ANCHOR_ANYCHAR_STAR_ML) | | ------------------ | | | | 557| 10.0k|#define ANCHOR_ANYCHAR_STAR_ML (1<<15) /* ".*" optimize info (multi-line) */ | | ------------------ ------------------ | Branch (5186:8): [True: 0, False: 10.0k] ------------------ 5187| 0| if (BIT_STATUS_AT(env->scan_env->backrefed_mem, en->regnum)) ------------------ | | 371| 0| ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1)) | | ------------------ | | | | 367| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (371:3): [True: 0, False: 0] | | | Branch (371:4): [True: 0, False: 0] | | ------------------ ------------------ 5188| 0| remove_opt_anc_info(&opt->anc, ANCHOR_ANYCHAR_STAR_MASK); ------------------ | | 91| 0|#define ANCHOR_ANYCHAR_STAR_MASK (ANCHOR_ANYCHAR_STAR | ANCHOR_ANYCHAR_STAR_ML) | | ------------------ | | | | 556| 0|#define ANCHOR_ANYCHAR_STAR (1<<14) /* ".*" optimize info */ | | ------------------ | | #define ANCHOR_ANYCHAR_STAR_MASK (ANCHOR_ANYCHAR_STAR | ANCHOR_ANYCHAR_STAR_ML) | | ------------------ | | | | 557| 0|#define ANCHOR_ANYCHAR_STAR_ML (1<<15) /* ".*" optimize info (multi-line) */ | | ------------------ ------------------ 5189| 0| } 5190| 10.0k| } 5191| 10.0k| break; 5192| | 5193| 24.5k| case ENCLOSE_STOP_BACKTRACK: ------------------ | | 96| 24.5k|#define ENCLOSE_STOP_BACKTRACK (1<<2) ------------------ | Branch (5193:7): [True: 24.5k, False: 12.0k] ------------------ 5194| 24.5k| case ENCLOSE_CONDITION: ------------------ | | 97| 24.5k|#define ENCLOSE_CONDITION (1<<3) ------------------ | Branch (5194:7): [True: 0, False: 36.5k] ------------------ 5195| 24.5k| r = optimize_node_left(en->target, opt, env); 5196| 24.5k| break; 5197| | 5198| 0| case ENCLOSE_ABSENT: ------------------ | | 98| 0|#define ENCLOSE_ABSENT (1<<4) ------------------ | Branch (5198:7): [True: 0, False: 36.5k] ------------------ 5199| 0| set_mml(&opt->len, 0, ONIG_INFINITE_DISTANCE); ------------------ | | 85| 0|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ 5200| 0| break; 5201| 36.5k| } 5202| 36.5k| } 5203| 36.5k| break; 5204| | 5205| 36.5k| default: ------------------ | Branch (5205:3): [True: 0, False: 355k] ------------------ 5206| |#ifdef ONIG_DEBUG 5207| | fprintf(stderr, "optimize_node_left: undefined node type %d\n", 5208| | NTYPE(node)); 5209| |#endif 5210| 0| r = ONIGERR_TYPE_BUG; ------------------ | | 633| 0|#define ONIGERR_TYPE_BUG -6 ------------------ 5211| 0| break; 5212| 355k| } 5213| | 5214| 355k| return r; 5215| 355k|} regcomp.c:clear_node_opt_info: 4775| 355k|{ 4776| 355k| clear_mml(&opt->len); 4777| 355k| clear_opt_anc_info(&opt->anc); 4778| 355k| clear_opt_exact_info(&opt->exb); 4779| 355k| clear_opt_exact_info(&opt->exm); 4780| 355k| clear_opt_exact_info(&opt->expr); 4781| 355k| clear_opt_map_info(&opt->map); 4782| 355k|} regcomp.c:clear_opt_anc_info: 4427| 1.66M|{ 4428| 1.66M| anc->left_anchor = 0; 4429| 1.66M| anc->right_anchor = 0; 4430| 1.66M|} regcomp.c:clear_opt_exact_info: 4510| 1.10M|{ 4511| 1.10M| clear_mml(&ex->mmd); 4512| 1.10M| clear_opt_anc_info(&ex->anc); 4513| 1.10M| ex->reach_end = 0; 4514| 1.10M| ex->ignore_case = -1; /* unset */ 4515| 1.10M| ex->len = 0; 4516| 1.10M| ex->s[0] = '\0'; 4517| 1.10M|} regcomp.c:clear_opt_map_info: 4643| 355k|{ 4644| 355k| static const OptMapInfo clean_info = { 4645| 355k| {0, 0}, {0, 0}, 0, 4646| 355k| { 4647| 355k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4648| 355k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4649| 355k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4650| 355k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4651| 355k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4652| 355k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4653| 355k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4654| 355k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4655| 355k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4656| 355k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4657| 355k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4658| 355k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4659| 355k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4660| 355k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4661| 355k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4662| 355k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 4663| 355k| } 4664| 355k| }; 4665| | 4666| 355k| xmemcpy(map, &clean_info, sizeof(OptMapInfo)); ------------------ | | 215| 355k|#define xmemcpy memcpy ------------------ 4667| 355k|} regcomp.c:set_bound_node_opt_info: 4767| 355k|{ 4768| 355k| copy_mml(&(opt->exb.mmd), mmd); 4769| 355k| copy_mml(&(opt->expr.mmd), mmd); 4770| 355k| copy_mml(&(opt->map.mmd), mmd); 4771| 355k|} regcomp.c:copy_mml: 4391| 1.06M|{ 4392| 1.06M| to->min = from->min; 4393| 1.06M| to->max = from->max; 4394| 1.06M|} regcomp.c:copy_opt_env: 4421| 45.9k|{ 4422| 45.9k| *to = *from; 4423| 45.9k|} regcomp.c:add_mml: 4398| 379k|{ 4399| 379k| to->min = distance_add(to->min, from->min); 4400| 379k| to->max = distance_add(to->max, from->max); 4401| 379k|} regcomp.c:concat_left_node_opt_info: 4792| 189k|{ 4793| 189k| int exb_reach, exm_reach; 4794| 189k| OptAncInfo tanc; 4795| | 4796| 189k| concat_opt_anc_info(&tanc, &to->anc, &add->anc, to->len.max, add->len.max); 4797| 189k| copy_opt_anc_info(&to->anc, &tanc); 4798| | 4799| 189k| if (add->exb.len > 0 && to->len.max == 0) { ------------------ | Branch (4799:7): [True: 55.5k, False: 134k] | Branch (4799:27): [True: 11.3k, False: 44.1k] ------------------ 4800| 11.3k| concat_opt_anc_info(&tanc, &to->anc, &add->exb.anc, 4801| 11.3k| to->len.max, add->len.max); 4802| 11.3k| copy_opt_anc_info(&add->exb.anc, &tanc); 4803| 11.3k| } 4804| | 4805| 189k| if (add->map.value > 0 && to->len.max == 0) { ------------------ | Branch (4805:7): [True: 88.1k, False: 101k] | Branch (4805:29): [True: 20.9k, False: 67.2k] ------------------ 4806| 20.9k| if (add->map.mmd.max == 0) ------------------ | Branch (4806:9): [True: 20.9k, False: 0] ------------------ 4807| 20.9k| add->map.anc.left_anchor |= to->anc.left_anchor; 4808| 20.9k| } 4809| | 4810| 189k| exb_reach = to->exb.reach_end; 4811| 189k| exm_reach = to->exm.reach_end; 4812| | 4813| 189k| if (add->len.max != 0) ------------------ | Branch (4813:7): [True: 132k, False: 57.6k] ------------------ 4814| 132k| to->exb.reach_end = to->exm.reach_end = 0; 4815| | 4816| 189k| if (add->exb.len > 0) { ------------------ | Branch (4816:7): [True: 55.5k, False: 134k] ------------------ 4817| 55.5k| if (exb_reach) { ------------------ | Branch (4817:9): [True: 0, False: 55.5k] ------------------ 4818| 0| concat_opt_exact_info(&to->exb, &add->exb, enc); 4819| 0| clear_opt_exact_info(&add->exb); 4820| 0| } 4821| 55.5k| else if (exm_reach) { ------------------ | Branch (4821:14): [True: 2.01k, False: 53.5k] ------------------ 4822| 2.01k| concat_opt_exact_info(&to->exm, &add->exb, enc); 4823| 2.01k| clear_opt_exact_info(&add->exb); 4824| 2.01k| } 4825| 55.5k| } 4826| 189k| select_opt_exact_info(enc, &to->exm, &add->exb); 4827| 189k| select_opt_exact_info(enc, &to->exm, &add->exm); 4828| | 4829| 189k| if (to->expr.len > 0) { ------------------ | Branch (4829:7): [True: 0, False: 189k] ------------------ 4830| 0| if (add->len.max > 0) { ------------------ | Branch (4830:9): [True: 0, False: 0] ------------------ 4831| 0| if (to->expr.len > (int )add->len.max) ------------------ | Branch (4831:11): [True: 0, False: 0] ------------------ 4832| 0| to->expr.len = (int )add->len.max; 4833| | 4834| 0| if (to->expr.mmd.max == 0) ------------------ | Branch (4834:11): [True: 0, False: 0] ------------------ 4835| 0| select_opt_exact_info(enc, &to->exb, &to->expr); 4836| 0| else 4837| 0| select_opt_exact_info(enc, &to->exm, &to->expr); 4838| 0| } 4839| 0| } 4840| 189k| else if (add->expr.len > 0) { ------------------ | Branch (4840:12): [True: 0, False: 189k] ------------------ 4841| 0| copy_opt_exact_info(&to->expr, &add->expr); 4842| 0| } 4843| | 4844| 189k| select_opt_map_info(&to->map, &add->map); 4845| | 4846| 189k| add_mml(&to->len, &add->len); 4847| 189k|} regcomp.c:concat_opt_anc_info: 4441| 203k|{ 4442| 203k| clear_opt_anc_info(to); 4443| | 4444| 203k| to->left_anchor = left->left_anchor; 4445| 203k| if (left_len == 0) { ------------------ | Branch (4445:7): [True: 97.4k, False: 105k] ------------------ 4446| 97.4k| to->left_anchor |= right->left_anchor; 4447| 97.4k| } 4448| | 4449| 203k| to->right_anchor = right->right_anchor; 4450| 203k| if (right_len == 0) { ------------------ | Branch (4450:7): [True: 57.6k, False: 145k] ------------------ 4451| 57.6k| to->right_anchor |= left->right_anchor; 4452| 57.6k| } 4453| 145k| else { 4454| 145k| to->right_anchor |= (left->right_anchor & ANCHOR_PREC_READ_NOT); ------------------ | | 552| 145k|#define ANCHOR_PREC_READ_NOT (1<<11) ------------------ 4455| 145k| } 4456| 203k|} regcomp.c:copy_opt_anc_info: 4434| 203k|{ 4435| 203k| *to = *from; 4436| 203k|} regcomp.c:select_opt_map_info: 4708| 189k|{ 4709| 189k| const int z = 1<<15; /* 32768: something big value */ 4710| | 4711| 189k| int v1, v2; 4712| | 4713| 189k| if (alt->value == 0) return ; ------------------ | Branch (4713:7): [True: 101k, False: 88.1k] ------------------ 4714| 88.1k| if (now->value == 0) { ------------------ | Branch (4714:7): [True: 40.1k, False: 48.0k] ------------------ 4715| 40.1k| copy_opt_map_info(now, alt); 4716| 40.1k| return ; 4717| 40.1k| } 4718| | 4719| 48.0k| v1 = z / now->value; 4720| 48.0k| v2 = z / alt->value; 4721| 48.0k| if (comp_distance_value(&now->mmd, &alt->mmd, v1, v2) > 0) ------------------ | Branch (4721:7): [True: 0, False: 48.0k] ------------------ 4722| 0| copy_opt_map_info(now, alt); 4723| 48.0k|} regcomp.c:comp_distance_value: 4354| 96.0k|{ 4355| 96.0k| if (v2 <= 0) return -1; ------------------ | Branch (4355:7): [True: 0, False: 96.0k] ------------------ 4356| 96.0k| if (v1 <= 0) return 1; ------------------ | Branch (4356:7): [True: 0, False: 96.0k] ------------------ 4357| | 4358| 96.0k| v1 *= distance_value(d1); 4359| 96.0k| v2 *= distance_value(d2); 4360| | 4361| 96.0k| if (v2 > v1) return 1; ------------------ | Branch (4361:7): [True: 7.63k, False: 88.3k] ------------------ 4362| 88.3k| if (v2 < v1) return -1; ------------------ | Branch (4362:7): [True: 41.7k, False: 46.6k] ------------------ 4363| | 4364| 46.6k| if (d2->min < d1->min) return 1; ------------------ | Branch (4364:7): [True: 1.95k, False: 44.6k] ------------------ 4365| 44.6k| if (d2->min > d1->min) return -1; ------------------ | Branch (4365:7): [True: 35.0k, False: 9.65k] ------------------ 4366| 9.65k| return 0; 4367| 44.6k|} regcomp.c:distance_value: 4325| 192k|{ 4326| | /* 1000 / (min-max-dist + 1) */ 4327| 192k| static const short int dist_vals[] = { 4328| 192k| 1000, 500, 333, 250, 200, 167, 143, 125, 111, 100, 4329| 192k| 91, 83, 77, 71, 67, 63, 59, 56, 53, 50, 4330| 192k| 48, 45, 43, 42, 40, 38, 37, 36, 34, 33, 4331| 192k| 32, 31, 30, 29, 29, 28, 27, 26, 26, 25, 4332| 192k| 24, 24, 23, 23, 22, 22, 21, 21, 20, 20, 4333| 192k| 20, 19, 19, 19, 18, 18, 18, 17, 17, 17, 4334| 192k| 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 4335| 192k| 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 4336| 192k| 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 4337| 192k| 11, 11, 11, 11, 11, 10, 10, 10, 10, 10 4338| 192k| }; 4339| | 4340| 192k| OnigDistance d; 4341| | 4342| 192k| if (mm->max == ONIG_INFINITE_DISTANCE) return 0; ------------------ | | 85| 192k|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ | Branch (4342:7): [True: 121k, False: 70.5k] ------------------ 4343| | 4344| 70.5k| d = mm->max - mm->min; 4345| 70.5k| if (d < numberof(dist_vals)) ------------------ | | 129| 70.5k|# define numberof(array) (int )(sizeof(array) / sizeof((array)[0])) ------------------ | Branch (4345:7): [True: 70.5k, False: 0] ------------------ 4346| | /* return dist_vals[d] * 16 / (mm->min + 12); */ 4347| 70.5k| return (int )dist_vals[d]; 4348| 0| else 4349| 0| return 1; 4350| 70.5k|} regcomp.c:copy_node_opt_info: 4786| 45.8k|{ 4787| 45.8k| *to = *from; 4788| 45.8k|} regcomp.c:alt_merge_node_opt_info: 4851| 15.8k|{ 4852| 15.8k| alt_merge_opt_anc_info (&to->anc, &add->anc); 4853| 15.8k| alt_merge_opt_exact_info(&to->exb, &add->exb, env); 4854| 15.8k| alt_merge_opt_exact_info(&to->exm, &add->exm, env); 4855| 15.8k| alt_merge_opt_exact_info(&to->expr, &add->expr, env); 4856| 15.8k| alt_merge_opt_map_info(env->enc, &to->map, &add->map); 4857| | 4858| 15.8k| alt_merge_mml(&to->len, &add->len); 4859| 15.8k|} regcomp.c:alt_merge_opt_anc_info: 4497| 43.5k|{ 4498| 43.5k| to->left_anchor &= add->left_anchor; 4499| 43.5k| to->right_anchor &= add->right_anchor; 4500| 43.5k|} regcomp.c:alt_merge_opt_exact_info: 4573| 47.4k|{ 4574| 47.4k| int i, j, len; 4575| | 4576| 47.4k| if (add->len == 0 || to->len == 0) { ------------------ | Branch (4576:7): [True: 31.6k, False: 15.8k] | Branch (4576:24): [True: 1.99k, False: 13.8k] ------------------ 4577| 33.6k| clear_opt_exact_info(to); 4578| 33.6k| return ; 4579| 33.6k| } 4580| | 4581| 13.8k| if (! is_equal_mml(&to->mmd, &add->mmd)) { ------------------ | Branch (4581:7): [True: 1.88k, False: 11.9k] ------------------ 4582| 1.88k| clear_opt_exact_info(to); 4583| 1.88k| return ; 4584| 1.88k| } 4585| | 4586| 19.9k| for (i = 0; i < to->len && i < add->len; ) { ------------------ | Branch (4586:15): [True: 19.9k, False: 0] | Branch (4586:30): [True: 19.9k, False: 0] ------------------ 4587| 19.9k| if (to->s[i] != add->s[i]) break; ------------------ | Branch (4587:9): [True: 11.9k, False: 8.04k] ------------------ 4588| 8.04k| len = enclen(env->enc, to->s + i, to->s + to->len); ------------------ | | 93| 8.04k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 364| 8.04k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 8.04k] | | ------------------ ------------------ 4589| | 4590| 8.04k| for (j = 1; j < len; j++) { ------------------ | Branch (4590:17): [True: 0, False: 8.04k] ------------------ 4591| 0| if (to->s[i+j] != add->s[i+j]) break; ------------------ | Branch (4591:11): [True: 0, False: 0] ------------------ 4592| 0| } 4593| 8.04k| if (j < len) break; ------------------ | Branch (4593:9): [True: 0, False: 8.04k] ------------------ 4594| 8.04k| i += len; 4595| 8.04k| } 4596| | 4597| 11.9k| if (! add->reach_end || i < add->len || i < to->len) { ------------------ | Branch (4597:7): [True: 0, False: 11.9k] | Branch (4597:27): [True: 11.9k, False: 0] | Branch (4597:43): [True: 0, False: 0] ------------------ 4598| 11.9k| to->reach_end = 0; 4599| 11.9k| } 4600| 11.9k| to->len = i; 4601| 11.9k| if (to->ignore_case < 0) ------------------ | Branch (4601:7): [True: 0, False: 11.9k] ------------------ 4602| 0| to->ignore_case = add->ignore_case; 4603| 11.9k| else if (add->ignore_case >= 0) ------------------ | Branch (4603:12): [True: 11.9k, False: 0] ------------------ 4604| 11.9k| to->ignore_case |= add->ignore_case; 4605| | 4606| 11.9k| alt_merge_opt_anc_info(&to->anc, &add->anc); 4607| 11.9k| if (! to->reach_end) to->anc.right_anchor = 0; ------------------ | Branch (4607:7): [True: 11.9k, False: 0] ------------------ 4608| 11.9k|} regcomp.c:is_equal_mml: 4371| 13.8k|{ 4372| 13.8k| return (a->min == b->min && a->max == b->max) ? 1 : 0; ------------------ | Branch (4372:11): [True: 11.9k, False: 1.88k] | Branch (4372:31): [True: 11.9k, False: 0] ------------------ 4373| 13.8k|} regcomp.c:alt_merge_opt_map_info: 4740| 15.8k|{ 4741| 15.8k| int i, val; 4742| | 4743| | /* if (! is_equal_mml(&to->mmd, &add->mmd)) return ; */ 4744| 15.8k| if (to->value == 0) return ; ------------------ | Branch (4744:7): [True: 0, False: 15.8k] ------------------ 4745| 15.8k| if (add->value == 0 || to->mmd.max < add->mmd.min) { ------------------ | Branch (4745:7): [True: 0, False: 15.8k] | Branch (4745:26): [True: 0, False: 15.8k] ------------------ 4746| 0| clear_opt_map_info(to); 4747| 0| return ; 4748| 0| } 4749| | 4750| 15.8k| alt_merge_mml(&to->mmd, &add->mmd); 4751| | 4752| 15.8k| val = 0; 4753| 4.06M| for (i = 0; i < ONIG_CHAR_TABLE_SIZE; i++) { ------------------ | | 756| 4.06M|#define ONIG_CHAR_TABLE_SIZE 256 ------------------ | Branch (4753:15): [True: 4.04M, False: 15.8k] ------------------ 4754| 4.04M| if (add->map[i]) ------------------ | Branch (4754:9): [True: 15.8k, False: 4.03M] ------------------ 4755| 15.8k| to->map[i] = 1; 4756| | 4757| 4.04M| if (to->map[i]) ------------------ | Branch (4757:9): [True: 29.6k, False: 4.01M] ------------------ 4758| 29.6k| val += map_position_value(enc, i); 4759| 4.04M| } 4760| 15.8k| to->value = val; 4761| | 4762| 15.8k| alt_merge_opt_anc_info(&to->anc, &add->anc); 4763| 15.8k|} regcomp.c:map_position_value: 4301| 283k|{ 4302| 283k| static const short int ByteValTable[] = { 4303| 283k| 5, 1, 1, 1, 1, 1, 1, 1, 1, 10, 10, 1, 1, 10, 1, 1, 4304| 283k| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4305| 283k| 12, 4, 7, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 4306| 283k| 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4307| 283k| 5, 6, 6, 6, 6, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4308| 283k| 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 6, 5, 5, 5, 4309| 283k| 5, 6, 6, 6, 6, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4310| 283k| 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1 4311| 283k| }; 4312| | 4313| 283k| if (i < numberof(ByteValTable)) { ------------------ | | 129| 283k|# define numberof(array) (int )(sizeof(array) / sizeof((array)[0])) ------------------ | Branch (4313:7): [True: 283k, False: 0] ------------------ 4314| 283k| if (i == 0 && ONIGENC_MBC_MINLEN(enc) > 1) ------------------ | | 367| 0|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) ------------------ | Branch (4314:9): [True: 0, False: 283k] | Branch (4314:19): [True: 0, False: 0] ------------------ 4315| 0| return 20; 4316| 283k| else 4317| 283k| return (int )ByteValTable[i]; 4318| 283k| } 4319| 0| else 4320| 0| return 4; /* Take it easy. */ 4321| 283k|} regcomp.c:alt_merge_mml: 4414| 31.6k|{ 4415| 31.6k| if (to->min > from->min) to->min = from->min; ------------------ | Branch (4415:7): [True: 3.88k, False: 27.7k] ------------------ 4416| 31.6k| if (to->max < from->max) to->max = from->max; ------------------ | Branch (4416:7): [True: 5.90k, False: 25.7k] ------------------ 4417| 31.6k|} regcomp.c:concat_opt_exact_info_str: 4557| 83.2k|{ 4558| 83.2k| int i, j, len; 4559| 83.2k| UChar *p; ------------------ | | 76| 83.2k|# define UChar OnigUChar ------------------ 4560| | 4561| 689k| for (i = to->len, p = s; p < end && i < OPT_EXACT_MAXLEN; ) { ------------------ | | 89| 613k|#define OPT_EXACT_MAXLEN 24 /* This must be smaller than ONIG_CHAR_TABLE_SIZE. */ ------------------ | Branch (4561:28): [True: 613k, False: 75.5k] | Branch (4561:39): [True: 605k, False: 7.73k] ------------------ 4562| 605k| len = enclen(enc, p, end); ------------------ | | 93| 605k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 364| 605k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 605k] | | ------------------ ------------------ 4563| 605k| if (i + len > OPT_EXACT_MAXLEN) break; ------------------ | | 89| 605k|#define OPT_EXACT_MAXLEN 24 /* This must be smaller than ONIG_CHAR_TABLE_SIZE. */ ------------------ | Branch (4563:9): [True: 0, False: 605k] ------------------ 4564| 1.21M| for (j = 0; j < len && p < end; j++) ------------------ | Branch (4564:17): [True: 605k, False: 605k] | Branch (4564:28): [True: 605k, False: 0] ------------------ 4565| 605k| to->s[i++] = *p++; 4566| 605k| } 4567| | 4568| 83.2k| to->len = i; 4569| 83.2k|} regcomp.c:add_char_opt_map_info: 4677| 250k|{ 4678| 250k| if (map->map[c] == 0) { ------------------ | Branch (4678:7): [True: 250k, False: 0] ------------------ 4679| 250k| map->map[c] = 1; 4680| 250k| map->value += map_position_value(enc, c); 4681| 250k| } 4682| 250k|} regcomp.c:set_mml: 4378| 205k|{ 4379| 205k| mml->min = min; 4380| 205k| mml->max = max; 4381| 205k|} regcomp.c:add_opt_anc_info: 4479| 53.7k|{ 4480| 53.7k| if (is_left_anchor(anc)) ------------------ | Branch (4480:7): [True: 38.2k, False: 15.4k] ------------------ 4481| 38.2k| to->left_anchor |= anc; 4482| 15.4k| else 4483| 15.4k| to->right_anchor |= anc; 4484| 53.7k|} regcomp.c:is_left_anchor: 4460| 53.7k|{ 4461| 53.7k| if (anc == ANCHOR_END_BUF || anc == ANCHOR_SEMI_END_BUF || ------------------ | | 543| 107k|#define ANCHOR_END_BUF (1<<3) ------------------ if (anc == ANCHOR_END_BUF || anc == ANCHOR_SEMI_END_BUF || ------------------ | | 544| 107k|#define ANCHOR_SEMI_END_BUF (1<<4) ------------------ | Branch (4461:7): [True: 0, False: 53.7k] | Branch (4461:32): [True: 0, False: 53.7k] ------------------ 4462| 53.7k| anc == ANCHOR_END_LINE || anc == ANCHOR_PREC_READ || ------------------ | | 545| 107k|#define ANCHOR_END_LINE (1<<5) ------------------ anc == ANCHOR_END_LINE || anc == ANCHOR_PREC_READ || ------------------ | | 551| 92.0k|#define ANCHOR_PREC_READ (1<<10) ------------------ | Branch (4462:7): [True: 15.4k, False: 38.2k] | Branch (4462:33): [True: 0, False: 38.2k] ------------------ 4463| 53.7k| anc == ANCHOR_PREC_READ_NOT) ------------------ | | 552| 38.2k|#define ANCHOR_PREC_READ_NOT (1<<11) ------------------ | Branch (4463:7): [True: 0, False: 38.2k] ------------------ 4464| 15.4k| return 0; 4465| | 4466| 38.2k| return 1; 4467| 53.7k|} regcomp.c:copy_opt_exact_info: 4521| 65.0k|{ 4522| 65.0k| *to = *from; 4523| 65.0k|} regcomp.c:copy_opt_map_info: 4671| 40.1k|{ 4672| 40.1k| *to = *from; 4673| 40.1k|} regcomp.c:concat_opt_exact_info: 4527| 2.01k|{ 4528| 2.01k| int i, j, len; 4529| 2.01k| UChar *p, *end; ------------------ | | 76| 2.01k|# define UChar OnigUChar ------------------ 4530| 2.01k| OptAncInfo tanc; 4531| | 4532| 2.01k| if (to->ignore_case < 0) ------------------ | Branch (4532:7): [True: 0, False: 2.01k] ------------------ 4533| 0| to->ignore_case = add->ignore_case; 4534| 2.01k| else if (to->ignore_case != add->ignore_case) ------------------ | Branch (4534:12): [True: 0, False: 2.01k] ------------------ 4535| 0| return ; /* avoid */ 4536| | 4537| 2.01k| p = add->s; 4538| 2.01k| end = p + add->len; 4539| 8.06k| for (i = to->len; p < end; ) { ------------------ | Branch (4539:21): [True: 6.05k, False: 2.01k] ------------------ 4540| 6.05k| len = enclen(enc, p, end); ------------------ | | 93| 6.05k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 364| 6.05k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 6.05k] | | ------------------ ------------------ 4541| 6.05k| if (i + len > OPT_EXACT_MAXLEN) break; ------------------ | | 89| 6.05k|#define OPT_EXACT_MAXLEN 24 /* This must be smaller than ONIG_CHAR_TABLE_SIZE. */ ------------------ | Branch (4541:9): [True: 0, False: 6.05k] ------------------ 4542| 12.1k| for (j = 0; j < len && p < end; j++) ------------------ | Branch (4542:17): [True: 6.05k, False: 6.05k] | Branch (4542:28): [True: 6.05k, False: 0] ------------------ 4543| 6.05k| to->s[i++] = *p++; 4544| 6.05k| } 4545| | 4546| 2.01k| to->len = i; 4547| 2.01k| to->reach_end = (p == end ? add->reach_end : 0); ------------------ | Branch (4547:20): [True: 2.01k, False: 0] ------------------ 4548| | 4549| 2.01k| concat_opt_anc_info(&tanc, &to->anc, &add->anc, 1, 1); 4550| 2.01k| if (! to->reach_end) tanc.right_anchor = 0; ------------------ | Branch (4550:7): [True: 2.01k, False: 0] ------------------ 4551| 2.01k| copy_opt_anc_info(&to->anc, &tanc); 4552| 2.01k|} regcomp.c:is_set_opt_anc_info: 4471| 10.0k|{ 4472| 10.0k| if ((to->left_anchor & anc) != 0) return 1; ------------------ | Branch (4472:7): [True: 0, False: 10.0k] ------------------ 4473| | 4474| 10.0k| return ((to->right_anchor & anc) != 0 ? 1 : 0); ------------------ | Branch (4474:11): [True: 0, False: 10.0k] ------------------ 4475| 10.0k|} regcomp.c:select_opt_exact_info: 4612| 410k|{ 4613| 410k| int v1, v2; 4614| | 4615| 410k| v1 = now->len; 4616| 410k| v2 = alt->len; 4617| | 4618| 410k| if (v2 == 0) { ------------------ | Branch (4618:7): [True: 328k, False: 82.3k] ------------------ 4619| 328k| return ; 4620| 328k| } 4621| 82.3k| else if (v1 == 0) { ------------------ | Branch (4621:12): [True: 65.0k, False: 17.3k] ------------------ 4622| 65.0k| copy_opt_exact_info(now, alt); 4623| 65.0k| return ; 4624| 65.0k| } 4625| 17.3k| else if (v1 <= 2 && v2 <= 2) { ------------------ | Branch (4625:12): [True: 3.81k, False: 13.4k] | Branch (4625:23): [True: 1.94k, False: 1.86k] ------------------ 4626| | /* ByteValTable[x] is big value --> low price */ 4627| 1.94k| v2 = map_position_value(enc, now->s[0]); 4628| 1.94k| v1 = map_position_value(enc, alt->s[0]); 4629| | 4630| 1.94k| if (now->len > 1) v1 += 5; ------------------ | Branch (4630:9): [True: 0, False: 1.94k] ------------------ 4631| 1.94k| if (alt->len > 1) v2 += 5; ------------------ | Branch (4631:9): [True: 0, False: 1.94k] ------------------ 4632| 1.94k| } 4633| | 4634| 17.3k| if (now->ignore_case <= 0) v1 *= 2; ------------------ | Branch (4634:7): [True: 17.3k, False: 0] ------------------ 4635| 17.3k| if (alt->ignore_case <= 0) v2 *= 2; ------------------ | Branch (4635:7): [True: 17.3k, False: 0] ------------------ 4636| | 4637| 17.3k| if (comp_distance_value(&now->mmd, &alt->mmd, v1, v2) > 0) ------------------ | Branch (4637:7): [True: 0, False: 17.3k] ------------------ 4638| 0| copy_opt_exact_info(now, alt); 4639| 17.3k|} regcomp.c:comp_opt_exact_or_map_info: 4727| 30.6k|{ 4728| 30.6k|#define COMP_EM_BASE 20 4729| 30.6k| int ve, vm; 4730| | 4731| 30.6k| if (m->value <= 0) return -1; ------------------ | Branch (4731:7): [True: 0, False: 30.6k] ------------------ 4732| | 4733| 30.6k| ve = COMP_EM_BASE * e->len * (e->ignore_case > 0 ? 1 : 2); ------------------ | | 4728| 30.6k|#define COMP_EM_BASE 20 ------------------ | Branch (4733:33): [True: 0, False: 30.6k] ------------------ 4734| 30.6k| vm = COMP_EM_BASE * 5 * 2 / m->value; ------------------ | | 4728| 30.6k|#define COMP_EM_BASE 20 ------------------ 4735| 30.6k| return comp_distance_value(&e->mmd, &m->mmd, ve, vm); 4736| 30.6k|} regcomp.c:set_optimize_exact_info: 5219| 21.0k|{ 5220| 21.0k| int allow_reverse; 5221| | 5222| 21.0k| if (e->len == 0) return 0; ------------------ | Branch (5222:7): [True: 0, False: 21.0k] ------------------ 5223| | 5224| 21.0k| reg->exact = (UChar* )xmalloc(e->len); ------------------ | | 142| 21.0k|# define xmalloc malloc ------------------ 5225| 21.0k| CHECK_NULL_RETURN_MEMERR(reg->exact); ------------------ | | 314| 21.0k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 21.0k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 21.0k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 5226| 21.0k| xmemcpy(reg->exact, e->s, e->len); ------------------ | | 215| 21.0k|#define xmemcpy memcpy ------------------ 5227| 21.0k| reg->exact_end = reg->exact + e->len; 5228| | 5229| 21.0k| allow_reverse = 5230| 21.0k| ONIGENC_IS_ALLOWED_REVERSE_MATCH(reg->enc, reg->exact, reg->exact_end); ------------------ | | 335| 21.0k| (enc)->is_allowed_reverse_match(s,end,enc) ------------------ 5231| | 5232| 21.0k| if (e->ignore_case > 0) { ------------------ | Branch (5232:7): [True: 0, False: 21.0k] ------------------ 5233| 0| if (e->len >= 3 || (e->len >= 2 && allow_reverse)) { ------------------ | Branch (5233:9): [True: 0, False: 0] | Branch (5233:25): [True: 0, False: 0] | Branch (5233:40): [True: 0, False: 0] ------------------ 5234| 0| e->len = set_bm_skip(reg->exact, reg->exact_end, reg, 5235| 0| reg->map, 1); 5236| 0| reg->exact_end = reg->exact + e->len; 5237| 0| if (e->len >= 3) { ------------------ | Branch (5237:11): [True: 0, False: 0] ------------------ 5238| 0| reg->optimize = (allow_reverse != 0 ------------------ | Branch (5238:19): [True: 0, False: 0] ------------------ 5239| 0| ? ONIG_OPTIMIZE_EXACT_BM_IC : ONIG_OPTIMIZE_EXACT_BM_NOT_REV_IC); ------------------ | | 361| 0|#define ONIG_OPTIMIZE_EXACT_BM_IC 6 /* BM (ignore case) */ ------------------ ? ONIG_OPTIMIZE_EXACT_BM_IC : ONIG_OPTIMIZE_EXACT_BM_NOT_REV_IC); ------------------ | | 362| 0|#define ONIG_OPTIMIZE_EXACT_BM_NOT_REV_IC 7 /* BM (applied to a multibyte string) (ignore case) */ ------------------ 5240| 0| } 5241| 0| else if (e->len > 0) { ------------------ | Branch (5241:16): [True: 0, False: 0] ------------------ 5242| 0| reg->optimize = ONIG_OPTIMIZE_EXACT_IC; ------------------ | | 359| 0|#define ONIG_OPTIMIZE_EXACT_IC 4 /* Slow Search (ignore case) */ ------------------ 5243| 0| } 5244| 0| else 5245| 0| return 0; 5246| 0| } 5247| 0| else { 5248| 0| reg->optimize = ONIG_OPTIMIZE_EXACT_IC; ------------------ | | 359| 0|#define ONIG_OPTIMIZE_EXACT_IC 4 /* Slow Search (ignore case) */ ------------------ 5249| 0| } 5250| 0| } 5251| 21.0k| else { 5252| 21.0k| if (e->len >= 3 || (e->len >= 2 && allow_reverse)) { ------------------ | Branch (5252:9): [True: 15.4k, False: 5.65k] | Branch (5252:25): [True: 0, False: 5.65k] | Branch (5252:40): [True: 0, False: 0] ------------------ 5253| 15.4k| set_bm_skip(reg->exact, reg->exact_end, reg, 5254| 15.4k| reg->map, 0); 5255| 15.4k| reg->optimize = (allow_reverse != 0 ------------------ | Branch (5255:24): [True: 15.4k, False: 0] ------------------ 5256| 15.4k| ? ONIG_OPTIMIZE_EXACT_BM : ONIG_OPTIMIZE_EXACT_BM_NOT_REV); ------------------ | | 357| 15.4k|#define ONIG_OPTIMIZE_EXACT_BM 2 /* Boyer Moore Search */ ------------------ ? ONIG_OPTIMIZE_EXACT_BM : ONIG_OPTIMIZE_EXACT_BM_NOT_REV); ------------------ | | 358| 0|#define ONIG_OPTIMIZE_EXACT_BM_NOT_REV 3 /* BM (applied to a multibyte string) */ ------------------ 5257| 15.4k| } 5258| 5.65k| else { 5259| 5.65k| reg->optimize = ONIG_OPTIMIZE_EXACT; ------------------ | | 356| 5.65k|#define ONIG_OPTIMIZE_EXACT 1 /* Slow Search */ ------------------ 5260| 5.65k| } 5261| 21.0k| } 5262| | 5263| 21.0k| reg->dmin = e->mmd.min; 5264| 21.0k| reg->dmax = e->mmd.max; 5265| | 5266| 21.0k| if (reg->dmin != ONIG_INFINITE_DISTANCE) { ------------------ | | 85| 21.0k|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ | Branch (5266:7): [True: 21.0k, False: 0] ------------------ 5267| 21.0k| reg->threshold_len = (int )(reg->dmin + (reg->exact_end - reg->exact)); 5268| 21.0k| } 5269| | 5270| 21.0k| return 0; 5271| 21.0k|} regcomp.c:set_bm_skip: 4187| 15.4k|{ 4188| 15.4k| OnigDistance i, len; 4189| 15.4k| int clen, flen, n, j, k; 4190| 15.4k| UChar *p, buf[ONIGENC_MBC_CASE_FOLD_MAXLEN]; ------------------ | | 76| 15.4k|# define UChar OnigUChar ------------------ 4191| 15.4k| OnigCaseFoldCodeItem items[ONIGENC_GET_CASE_FOLD_CODES_MAX_NUM]; 4192| 15.4k| OnigEncoding enc = reg->enc; 4193| | 4194| 15.4k| len = end - s; 4195| 15.4k| if (len >= ONIG_CHAR_TABLE_SIZE) { ------------------ | | 756| 15.4k|#define ONIG_CHAR_TABLE_SIZE 256 ------------------ | Branch (4195:7): [True: 0, False: 15.4k] ------------------ 4196| | /* This should not happen. */ 4197| 0| return ONIGERR_TYPE_BUG; ------------------ | | 633| 0|#define ONIGERR_TYPE_BUG -6 ------------------ 4198| 0| } 4199| | 4200| 15.4k| if (ignore_case) { ------------------ | Branch (4200:7): [True: 0, False: 15.4k] ------------------ 4201| 0| for (i = 0; i < len; i += clen) { ------------------ | Branch (4201:17): [True: 0, False: 0] ------------------ 4202| 0| p = s + i; 4203| 0| n = ONIGENC_GET_CASE_FOLD_CODES_BY_STR(enc, reg->case_fold_flag, ------------------ | | 341| 0| (enc)->get_case_fold_codes_by_str(case_fold_flag,p,end,acs,enc) ------------------ 4204| 0| p, end, items); 4205| 0| clen = enclen(enc, p, end); ------------------ | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 0] | | ------------------ ------------------ 4206| 0| if (p + clen > end) ------------------ | Branch (4206:11): [True: 0, False: 0] ------------------ 4207| 0| clen = (int )(end - p); 4208| | 4209| 0| for (j = 0; j < n; j++) { ------------------ | Branch (4209:19): [True: 0, False: 0] ------------------ 4210| 0| if ((items[j].code_len != 1) || (items[j].byte_len != clen)) { ------------------ | Branch (4210:6): [True: 0, False: 0] | Branch (4210:34): [True: 0, False: 0] ------------------ 4211| | /* Different length isn't supported. Stop optimization at here. */ 4212| 0| end = p; 4213| 0| goto endcheck; 4214| 0| } 4215| 0| flen = ONIGENC_CODE_TO_MBC(enc, items[j].code[0], buf); ------------------ | | 371| 0|#define ONIGENC_CODE_TO_MBC(enc,code,buf) (enc)->code_to_mbc(code,buf,enc) ------------------ 4216| 0| if (flen != clen) { ------------------ | Branch (4216:6): [True: 0, False: 0] ------------------ 4217| | /* Different length isn't supported. Stop optimization at here. */ 4218| 0| end = p; 4219| 0| goto endcheck; 4220| 0| } 4221| 0| } 4222| 0| } 4223| 0|endcheck: 4224| 0| len = end - s; 4225| 0| } 4226| | 4227| 3.96M| for (i = 0; i < ONIG_CHAR_TABLE_SIZE; i++) ------------------ | | 756| 3.96M|#define ONIG_CHAR_TABLE_SIZE 256 ------------------ | Branch (4227:15): [True: 3.94M, False: 15.4k] ------------------ 4228| 3.94M| skip[i] = (UChar )(len + 1); 4229| 15.4k| n = 0; 4230| 238k| for (i = 0; i < len; i += clen) { ------------------ | Branch (4230:15): [True: 223k, False: 15.4k] ------------------ 4231| 223k| p = s + i; 4232| 223k| if (ignore_case) ------------------ | Branch (4232:9): [True: 0, False: 223k] ------------------ 4233| 0| n = ONIGENC_GET_CASE_FOLD_CODES_BY_STR(enc, reg->case_fold_flag, ------------------ | | 341| 0| (enc)->get_case_fold_codes_by_str(case_fold_flag,p,end,acs,enc) ------------------ 4234| 223k| p, end, items); 4235| 223k| clen = enclen(enc, p, end); ------------------ | | 93| 223k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 364| 223k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 223k] | | ------------------ ------------------ 4236| 223k| if (p + clen > end) ------------------ | Branch (4236:9): [True: 0, False: 223k] ------------------ 4237| 0| clen = (int )(end - p); 4238| | 4239| 446k| for (j = 0; j < clen; j++) { ------------------ | Branch (4239:17): [True: 223k, False: 223k] ------------------ 4240| 223k| skip[s[i + j]] = (UChar )(len - i - j); 4241| 223k| for (k = 0; k < n; k++) { ------------------ | Branch (4241:19): [True: 0, False: 223k] ------------------ 4242| 0| ONIGENC_CODE_TO_MBC(enc, items[k].code[0], buf); ------------------ | | 371| 0|#define ONIGENC_CODE_TO_MBC(enc,code,buf) (enc)->code_to_mbc(code,buf,enc) ------------------ 4243| 0| skip[buf[j]] = (UChar )(len - i - j); 4244| 0| } 4245| 223k| } 4246| 223k| } 4247| | 4248| 15.4k| return (int )len; 4249| 15.4k|} regcomp.c:set_sub_anchor: 5292| 36.4k|{ 5293| 36.4k| reg->sub_anchor |= anc->left_anchor & ANCHOR_BEGIN_LINE; ------------------ | | 541| 36.4k|#define ANCHOR_BEGIN_LINE (1<<1) ------------------ 5294| 36.4k| reg->sub_anchor |= anc->right_anchor & ANCHOR_END_LINE; ------------------ | | 545| 36.4k|#define ANCHOR_END_LINE (1<<5) ------------------ 5295| 36.4k|} regcomp.c:set_optimize_map_info: 5275| 15.3k|{ 5276| 15.3k| int i; 5277| | 5278| 3.94M| for (i = 0; i < ONIG_CHAR_TABLE_SIZE; i++) ------------------ | | 756| 3.94M|#define ONIG_CHAR_TABLE_SIZE 256 ------------------ | Branch (5278:15): [True: 3.93M, False: 15.3k] ------------------ 5279| 3.93M| reg->map[i] = m->map[i]; 5280| | 5281| 15.3k| reg->optimize = ONIG_OPTIMIZE_MAP; ------------------ | | 360| 15.3k|#define ONIG_OPTIMIZE_MAP 5 /* char map */ ------------------ 5282| 15.3k| reg->dmin = m->mmd.min; 5283| 15.3k| reg->dmax = m->mmd.max; 5284| | 5285| 15.3k| if (reg->dmin != ONIG_INFINITE_DISTANCE) { ------------------ | | 85| 15.3k|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ | Branch (5285:7): [True: 15.3k, False: 0] ------------------ 5286| 15.3k| reg->threshold_len = (int )(reg->dmin + 1); 5287| 15.3k| } 5288| 15.3k|} regcomp.c:compile_tree: 1688| 355k|{ 1689| 355k| int n, type, len, pos, r = 0; 1690| | 1691| 355k| type = NTYPE(node); ------------------ | | 69| 355k|#define NTYPE(node) ((node)->u.base.type) ------------------ 1692| 355k| switch (type) { 1693| 45.9k| case NT_LIST: ------------------ | | 46| 45.9k|#define NT_LIST 8 ------------------ | Branch (1693:3): [True: 45.9k, False: 309k] ------------------ 1694| 189k| do { 1695| 189k| r = compile_tree(NCAR(node), reg); ------------------ | | 86| 189k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 189k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1696| 189k| } while (r == 0 && IS_NOT_NULL(node = NCDR(node))); ------------------ | | 312| 189k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 144k, False: 45.9k] | | ------------------ ------------------ | Branch (1696:14): [True: 189k, False: 0] ------------------ 1697| 45.9k| break; 1698| | 1699| 11.8k| case NT_ALT: ------------------ | | 47| 11.8k|#define NT_ALT 9 ------------------ | Branch (1699:3): [True: 11.8k, False: 343k] ------------------ 1700| 11.8k| { 1701| 11.8k| Node* x = node; 1702| 11.8k| len = 0; 1703| 27.6k| do { 1704| 27.6k| len += compile_length_tree(NCAR(x), reg); ------------------ | | 86| 27.6k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 27.6k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1705| 27.6k| if (NCDR(x) != NULL) { ------------------ | | 87| 27.6k|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 27.6k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ | Branch (1705:6): [True: 15.8k, False: 11.8k] ------------------ 1706| 15.8k| len += SIZE_OP_PUSH + SIZE_OP_JUMP; ------------------ | | 721| 15.8k|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 15.8k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 15.8k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ len += SIZE_OP_PUSH + SIZE_OP_JUMP; ------------------ | | 720| 15.8k|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 15.8k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 15.8k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1707| 15.8k| } 1708| 27.6k| } while (IS_NOT_NULL(x = NCDR(x))); ------------------ | | 312| 27.6k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 15.8k, False: 11.8k] | | ------------------ ------------------ 1709| 11.8k| pos = reg->used + len; /* goal position */ 1710| | 1711| 27.6k| do { 1712| 27.6k| len = compile_length_tree(NCAR(node), reg); ------------------ | | 86| 27.6k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 27.6k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1713| 27.6k| if (IS_NOT_NULL(NCDR(node))) { ------------------ | | 312| 27.6k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 15.8k, False: 11.8k] | | ------------------ ------------------ 1714| 15.8k| r = add_opcode_rel_addr(reg, OP_PUSH, len + SIZE_OP_JUMP); ------------------ | | 720| 15.8k|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 15.8k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 15.8k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1715| 15.8k| if (r) break; ------------------ | Branch (1715:8): [True: 0, False: 15.8k] ------------------ 1716| 15.8k| } 1717| 27.6k| r = compile_tree(NCAR(node), reg); ------------------ | | 86| 27.6k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 27.6k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1718| 27.6k| if (r) break; ------------------ | Branch (1718:6): [True: 0, False: 27.6k] ------------------ 1719| 27.6k| if (IS_NOT_NULL(NCDR(node))) { ------------------ | | 312| 27.6k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 15.8k, False: 11.8k] | | ------------------ ------------------ 1720| 15.8k| len = pos - (reg->used + SIZE_OP_JUMP); ------------------ | | 720| 15.8k|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 15.8k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 15.8k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1721| 15.8k| r = add_opcode_rel_addr(reg, OP_JUMP, len); 1722| 15.8k| if (r) break; ------------------ | Branch (1722:8): [True: 0, False: 15.8k] ------------------ 1723| 15.8k| } 1724| 27.6k| } while (IS_NOT_NULL(node = NCDR(node))); ------------------ | | 312| 27.6k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 15.8k, False: 11.8k] | | ------------------ ------------------ 1725| 11.8k| } 1726| 0| break; 1727| | 1728| 83.2k| case NT_STR: ------------------ | | 38| 83.2k|#define NT_STR 0 ------------------ | Branch (1728:3): [True: 83.2k, False: 272k] ------------------ 1729| 83.2k| if (NSTRING_IS_RAW(node)) ------------------ | | 114| 83.2k|#define NSTRING_IS_RAW(node) (((node)->u.str.flag & NSTR_RAW) != 0) | | ------------------ | | | | 104| 83.2k|#define NSTR_RAW (1<<0) /* by backslashed number */ | | ------------------ | | | Branch (114:39): [True: 0, False: 83.2k] | | ------------------ ------------------ 1730| 0| r = compile_string_raw_node(NSTR(node), reg); ------------------ | | 76| 0|#define NSTR(node) (&((node)->u.str)) ------------------ 1731| 83.2k| else 1732| 83.2k| r = compile_string_node(node, reg); 1733| 83.2k| break; 1734| | 1735| 75.8k| case NT_CCLASS: ------------------ | | 39| 75.8k|#define NT_CCLASS 1 ------------------ | Branch (1735:3): [True: 75.8k, False: 279k] ------------------ 1736| 75.8k| r = compile_cclass_node(NCCLASS(node), reg); ------------------ | | 77| 75.8k|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 1737| 75.8k| break; 1738| | 1739| 0| case NT_CTYPE: ------------------ | | 40| 0|#define NT_CTYPE 2 ------------------ | Branch (1739:3): [True: 0, False: 355k] ------------------ 1740| 0| { 1741| 0| int op; 1742| | 1743| 0| switch (NCTYPE(node)->ctype) { ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ 1744| 0| case ONIGENC_CTYPE_WORD: ------------------ | | 306| 0|#define ONIGENC_CTYPE_WORD 12 ------------------ | Branch (1744:7): [True: 0, False: 0] ------------------ 1745| 0| if (NCTYPE(node)->ascii_range != 0) { ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ | Branch (1745:6): [True: 0, False: 0] ------------------ 1746| 0| if (NCTYPE(node)->not != 0) op = OP_NOT_ASCII_WORD; ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ | Branch (1746:8): [True: 0, False: 0] ------------------ 1747| 0| else op = OP_ASCII_WORD; 1748| 0| } 1749| 0| else { 1750| 0| if (NCTYPE(node)->not != 0) op = OP_NOT_WORD; ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ | Branch (1750:8): [True: 0, False: 0] ------------------ 1751| 0| else op = OP_WORD; 1752| 0| } 1753| 0| break; 1754| 0| default: ------------------ | Branch (1754:7): [True: 0, False: 0] ------------------ 1755| 0| return ONIGERR_TYPE_BUG; ------------------ | | 633| 0|#define ONIGERR_TYPE_BUG -6 ------------------ 1756| 0| break; 1757| 0| } 1758| 0| r = add_opcode(reg, op); 1759| 0| } 1760| 0| break; 1761| | 1762| 13.7k| case NT_CANY: ------------------ | | 41| 13.7k|#define NT_CANY 3 ------------------ | Branch (1762:3): [True: 13.7k, False: 341k] ------------------ 1763| 13.7k| if (IS_MULTILINE(reg->options)) ------------------ | | 395| 13.7k|#define IS_MULTILINE(option) ((option) & ONIG_OPTION_MULTILINE) | | ------------------ | | | | 456| 13.7k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | ------------------ | | | | | | 455| 13.7k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | ------------------ | | | | | | | | 454| 13.7k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (395:35): [True: 0, False: 13.7k] | | ------------------ ------------------ 1764| 0| r = add_opcode(reg, OP_ANYCHAR_ML); 1765| 13.7k| else 1766| 13.7k| r = add_opcode(reg, OP_ANYCHAR); 1767| 13.7k| break; 1768| | 1769| 0| case NT_BREF: ------------------ | | 42| 0|#define NT_BREF 4 ------------------ | Branch (1769:3): [True: 0, False: 355k] ------------------ 1770| 0| { 1771| 0| BRefNode* br = NBREF(node); ------------------ | | 79| 0|#define NBREF(node) (&((node)->u.bref)) ------------------ 1772| | 1773| 0|#ifdef USE_BACKREF_WITH_LEVEL 1774| 0| if (IS_BACKREF_NEST_LEVEL(br)) { ------------------ | | 164| 0|#define IS_BACKREF_NEST_LEVEL(bn) (((bn)->state & NST_NEST_LEVEL) != 0) | | ------------------ | | | | 141| 0|#define NST_NEST_LEVEL (1<<13) | | ------------------ | | | Branch (164:40): [True: 0, False: 0] | | ------------------ ------------------ 1775| 0| r = add_opcode(reg, OP_BACKREF_WITH_LEVEL); 1776| 0| if (r) return r; ------------------ | Branch (1776:6): [True: 0, False: 0] ------------------ 1777| 0| r = add_option(reg, (reg->options & ONIG_OPTION_IGNORECASE)); ------------------ | | 454| 0|#define ONIG_OPTION_IGNORECASE 1U ------------------ 1778| 0| if (r) return r; ------------------ | Branch (1778:6): [True: 0, False: 0] ------------------ 1779| 0| r = add_length(reg, br->nest_level); 1780| 0| if (r) return r; ------------------ | Branch (1780:6): [True: 0, False: 0] ------------------ 1781| | 1782| 0| goto add_bacref_mems; 1783| 0| } 1784| 0| else 1785| 0|#endif 1786| 0| if (br->back_num == 1) { ------------------ | Branch (1786:11): [True: 0, False: 0] ------------------ 1787| 0| n = br->back_static[0]; 1788| 0| if (IS_IGNORECASE(reg->options)) { ------------------ | | 396| 0|#define IS_IGNORECASE(option) ((option) & ONIG_OPTION_IGNORECASE) | | ------------------ | | | | 454| 0|#define ONIG_OPTION_IGNORECASE 1U | | ------------------ | | | Branch (396:35): [True: 0, False: 0] | | ------------------ ------------------ 1789| 0| r = add_opcode(reg, OP_BACKREFN_IC); 1790| 0| if (r) return r; ------------------ | Branch (1790:8): [True: 0, False: 0] ------------------ 1791| 0| r = add_mem_num(reg, n); 1792| 0| } 1793| 0| else { 1794| 0| switch (n) { 1795| 0| case 1: r = add_opcode(reg, OP_BACKREF1); break; ------------------ | Branch (1795:4): [True: 0, False: 0] ------------------ 1796| 0| case 2: r = add_opcode(reg, OP_BACKREF2); break; ------------------ | Branch (1796:4): [True: 0, False: 0] ------------------ 1797| 0| default: ------------------ | Branch (1797:4): [True: 0, False: 0] ------------------ 1798| 0| r = add_opcode(reg, OP_BACKREFN); 1799| 0| if (r) return r; ------------------ | Branch (1799:10): [True: 0, False: 0] ------------------ 1800| 0| r = add_mem_num(reg, n); 1801| 0| break; 1802| 0| } 1803| 0| } 1804| 0| } 1805| 0| else { 1806| 0| int i; 1807| 0| int* p; 1808| | 1809| 0| if (IS_IGNORECASE(reg->options)) { ------------------ | | 396| 0|#define IS_IGNORECASE(option) ((option) & ONIG_OPTION_IGNORECASE) | | ------------------ | | | | 454| 0|#define ONIG_OPTION_IGNORECASE 1U | | ------------------ | | | Branch (396:35): [True: 0, False: 0] | | ------------------ ------------------ 1810| 0| r = add_opcode(reg, OP_BACKREF_MULTI_IC); 1811| 0| } 1812| 0| else { 1813| 0| r = add_opcode(reg, OP_BACKREF_MULTI); 1814| 0| } 1815| 0| if (r) return r; ------------------ | Branch (1815:6): [True: 0, False: 0] ------------------ 1816| | 1817| 0|#ifdef USE_BACKREF_WITH_LEVEL 1818| 0| add_bacref_mems: 1819| 0|#endif 1820| 0| r = add_length(reg, br->back_num); 1821| 0| if (r) return r; ------------------ | Branch (1821:6): [True: 0, False: 0] ------------------ 1822| 0| p = BACKREFS_P(br); ------------------ | | 120| 0| (IS_NOT_NULL((br)->back_dynamic) ? (br)->back_dynamic : (br)->back_static); | | ------------------ | | | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | | | ------------------ | | | | | Branch (312:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 1823| 0| for (i = br->back_num - 1; i >= 0; i--) { ------------------ | Branch (1823:29): [True: 0, False: 0] ------------------ 1824| 0| r = add_mem_num(reg, p[i]); 1825| 0| if (r) return r; ------------------ | Branch (1825:8): [True: 0, False: 0] ------------------ 1826| 0| } 1827| 0| } 1828| 0| } 1829| 0| break; 1830| | 1831| 0|#ifdef USE_SUBEXP_CALL 1832| 0| case NT_CALL: ------------------ | | 48| 0|#define NT_CALL 10 ------------------ | Branch (1832:3): [True: 0, False: 355k] ------------------ 1833| 0| r = compile_call(NCALL(node), reg); ------------------ | | 84| 0|#define NCALL(node) (&((node)->u.call)) ------------------ 1834| 0| break; 1835| 0|#endif 1836| | 1837| 32.6k| case NT_QTFR: ------------------ | | 43| 32.6k|#define NT_QTFR 5 ------------------ | Branch (1837:3): [True: 32.6k, False: 322k] ------------------ 1838| 32.6k| r = compile_quantifier_node(NQTFR(node), reg); ------------------ | | 80| 32.6k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1839| 32.6k| break; 1840| | 1841| 36.5k| case NT_ENCLOSE: ------------------ | | 44| 36.5k|#define NT_ENCLOSE 6 ------------------ | Branch (1841:3): [True: 36.5k, False: 318k] ------------------ 1842| 36.5k| r = compile_enclose_node(NENCLOSE(node), reg); ------------------ | | 81| 36.5k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1843| 36.5k| break; 1844| | 1845| 55.6k| case NT_ANCHOR: ------------------ | | 45| 55.6k|#define NT_ANCHOR 7 ------------------ | Branch (1845:3): [True: 55.6k, False: 299k] ------------------ 1846| 55.6k| r = compile_anchor_node(NANCHOR(node), reg); ------------------ | | 82| 55.6k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 1847| 55.6k| break; 1848| | 1849| 0| default: ------------------ | Branch (1849:3): [True: 0, False: 355k] ------------------ 1850| |#ifdef ONIG_DEBUG 1851| | fprintf(stderr, "compile_tree: undefined node type %d\n", NTYPE(node)); 1852| |#endif 1853| 0| break; 1854| 355k| } 1855| | 1856| 355k| return r; 1857| 355k|} regcomp.c:compile_length_tree: 1593| 187k|{ 1594| 187k| int len, type, r; 1595| | 1596| 187k| type = NTYPE(node); ------------------ | | 69| 187k|#define NTYPE(node) ((node)->u.base.type) ------------------ 1597| 187k| switch (type) { 1598| 15.0k| case NT_LIST: ------------------ | | 46| 15.0k|#define NT_LIST 8 ------------------ | Branch (1598:3): [True: 15.0k, False: 172k] ------------------ 1599| 15.0k| len = 0; 1600| 37.5k| do { 1601| 37.5k| r = compile_length_tree(NCAR(node), reg); ------------------ | | 86| 37.5k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 37.5k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1602| 37.5k| if (r < 0) return r; ------------------ | Branch (1602:11): [True: 0, False: 37.5k] ------------------ 1603| 37.5k| len += r; 1604| 37.5k| } while (IS_NOT_NULL(node = NCDR(node))); ------------------ | | 312| 37.5k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 22.5k, False: 15.0k] | | ------------------ ------------------ 1605| 15.0k| r = len; 1606| 15.0k| break; 1607| | 1608| 0| case NT_ALT: ------------------ | | 47| 0|#define NT_ALT 9 ------------------ | Branch (1608:3): [True: 0, False: 187k] ------------------ 1609| 0| { 1610| 0| int n = 0; 1611| 0| len = 0; 1612| 0| do { 1613| 0| r = compile_length_tree(NCAR(node), reg); ------------------ | | 86| 0|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1614| 0| if (r < 0) return r; ------------------ | Branch (1614:6): [True: 0, False: 0] ------------------ 1615| 0| len += r; 1616| 0| n++; 1617| 0| } while (IS_NOT_NULL(node = NCDR(node))); ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ 1618| 0| r = len; 1619| 0| r += (SIZE_OP_PUSH + SIZE_OP_JUMP) * (n - 1); ------------------ | | 721| 0|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ r += (SIZE_OP_PUSH + SIZE_OP_JUMP) * (n - 1); ------------------ | | 720| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1620| 0| } 1621| 0| break; 1622| | 1623| 64.7k| case NT_STR: ------------------ | | 38| 64.7k|#define NT_STR 0 ------------------ | Branch (1623:3): [True: 64.7k, False: 122k] ------------------ 1624| 64.7k| if (NSTRING_IS_RAW(node)) ------------------ | | 114| 64.7k|#define NSTRING_IS_RAW(node) (((node)->u.str.flag & NSTR_RAW) != 0) | | ------------------ | | | | 104| 64.7k|#define NSTR_RAW (1<<0) /* by backslashed number */ | | ------------------ | | | Branch (114:39): [True: 0, False: 64.7k] | | ------------------ ------------------ 1625| 0| r = compile_length_string_raw_node(NSTR(node), reg); ------------------ | | 76| 0|#define NSTR(node) (&((node)->u.str)) ------------------ 1626| 64.7k| else 1627| 64.7k| r = compile_length_string_node(node, reg); 1628| 64.7k| break; 1629| | 1630| 62.4k| case NT_CCLASS: ------------------ | | 39| 62.4k|#define NT_CCLASS 1 ------------------ | Branch (1630:3): [True: 62.4k, False: 125k] ------------------ 1631| 62.4k| r = compile_length_cclass_node(NCCLASS(node), reg); ------------------ | | 77| 62.4k|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 1632| 62.4k| break; 1633| | 1634| 0| case NT_CTYPE: ------------------ | | 40| 0|#define NT_CTYPE 2 ------------------ | Branch (1634:3): [True: 0, False: 187k] ------------------ 1635| 11.4k| case NT_CANY: ------------------ | | 41| 11.4k|#define NT_CANY 3 ------------------ | Branch (1635:3): [True: 11.4k, False: 176k] ------------------ 1636| 11.4k| r = SIZE_OPCODE; ------------------ | | 688| 11.4k|#define SIZE_OPCODE 1 ------------------ 1637| 11.4k| break; 1638| | 1639| 0| case NT_BREF: ------------------ | | 42| 0|#define NT_BREF 4 ------------------ | Branch (1639:3): [True: 0, False: 187k] ------------------ 1640| 0| { 1641| 0| BRefNode* br = NBREF(node); ------------------ | | 79| 0|#define NBREF(node) (&((node)->u.bref)) ------------------ 1642| | 1643| 0|#ifdef USE_BACKREF_WITH_LEVEL 1644| 0| if (IS_BACKREF_NEST_LEVEL(br)) { ------------------ | | 164| 0|#define IS_BACKREF_NEST_LEVEL(bn) (((bn)->state & NST_NEST_LEVEL) != 0) | | ------------------ | | | | 141| 0|#define NST_NEST_LEVEL (1<<13) | | ------------------ | | | Branch (164:40): [True: 0, False: 0] | | ------------------ ------------------ 1645| 0| r = SIZE_OPCODE + SIZE_OPTION + SIZE_LENGTH + ------------------ | | 688| 0|#define SIZE_OPCODE 1 ------------------ r = SIZE_OPCODE + SIZE_OPTION + SIZE_LENGTH + ------------------ | | 695| 0|#define SIZE_OPTION (int )sizeof(OnigOptionType) ------------------ r = SIZE_OPCODE + SIZE_OPTION + SIZE_LENGTH + ------------------ | | 691| 0|#define SIZE_LENGTH (int )sizeof(LengthType) ------------------ 1646| 0| SIZE_LENGTH + (SIZE_MEMNUM * br->back_num); ------------------ | | 691| 0|#define SIZE_LENGTH (int )sizeof(LengthType) ------------------ SIZE_LENGTH + (SIZE_MEMNUM * br->back_num); ------------------ | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) ------------------ 1647| 0| } 1648| 0| else 1649| 0|#endif 1650| 0| if (br->back_num == 1) { ------------------ | Branch (1650:11): [True: 0, False: 0] ------------------ 1651| 0| r = ((!IS_IGNORECASE(reg->options) && br->back_static[0] <= 2) ------------------ | | 396| 0|#define IS_IGNORECASE(option) ((option) & ONIG_OPTION_IGNORECASE) | | ------------------ | | | | 454| 0|#define ONIG_OPTION_IGNORECASE 1U | | ------------------ ------------------ | Branch (1651:8): [True: 0, False: 0] | Branch (1651:40): [True: 0, False: 0] ------------------ 1652| 0| ? SIZE_OPCODE : (SIZE_OPCODE + SIZE_MEMNUM)); ------------------ | | 688| 0|#define SIZE_OPCODE 1 ------------------ ? SIZE_OPCODE : (SIZE_OPCODE + SIZE_MEMNUM)); ------------------ | | 688| 0|#define SIZE_OPCODE 1 ------------------ ? SIZE_OPCODE : (SIZE_OPCODE + SIZE_MEMNUM)); ------------------ | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) ------------------ 1653| 0| } 1654| 0| else { 1655| 0| r = SIZE_OPCODE + SIZE_LENGTH + (SIZE_MEMNUM * br->back_num); ------------------ | | 688| 0|#define SIZE_OPCODE 1 ------------------ r = SIZE_OPCODE + SIZE_LENGTH + (SIZE_MEMNUM * br->back_num); ------------------ | | 691| 0|#define SIZE_LENGTH (int )sizeof(LengthType) ------------------ r = SIZE_OPCODE + SIZE_LENGTH + (SIZE_MEMNUM * br->back_num); ------------------ | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) ------------------ 1656| 0| } 1657| 0| } 1658| 0| break; 1659| | 1660| 0|#ifdef USE_SUBEXP_CALL 1661| 0| case NT_CALL: ------------------ | | 48| 0|#define NT_CALL 10 ------------------ | Branch (1661:3): [True: 0, False: 187k] ------------------ 1662| 0| r = SIZE_OP_CALL; ------------------ | | 747| 0|#define SIZE_OP_CALL (SIZE_OPCODE + SIZE_ABSADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_CALL (SIZE_OPCODE + SIZE_ABSADDR) | | ------------------ | | | | 690| 0|#define SIZE_ABSADDR (int )sizeof(AbsAddrType) | | ------------------ ------------------ 1663| 0| break; 1664| 0|#endif 1665| | 1666| 15.0k| case NT_QTFR: ------------------ | | 43| 15.0k|#define NT_QTFR 5 ------------------ | Branch (1666:3): [True: 15.0k, False: 172k] ------------------ 1667| 15.0k| r = compile_length_quantifier_node(NQTFR(node), reg); ------------------ | | 80| 15.0k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1668| 15.0k| break; 1669| | 1670| 11.2k| case NT_ENCLOSE: ------------------ | | 44| 11.2k|#define NT_ENCLOSE 6 ------------------ | Branch (1670:3): [True: 11.2k, False: 176k] ------------------ 1671| 11.2k| r = compile_length_enclose_node(NENCLOSE(node), reg); ------------------ | | 81| 11.2k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1672| 11.2k| break; 1673| | 1674| 7.53k| case NT_ANCHOR: ------------------ | | 45| 7.53k|#define NT_ANCHOR 7 ------------------ | Branch (1674:3): [True: 7.53k, False: 179k] ------------------ 1675| 7.53k| r = compile_length_anchor_node(NANCHOR(node), reg); ------------------ | | 82| 7.53k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 1676| 7.53k| break; 1677| | 1678| 0| default: ------------------ | Branch (1678:3): [True: 0, False: 187k] ------------------ 1679| 0| return ONIGERR_TYPE_BUG; ------------------ | | 633| 0|#define ONIGERR_TYPE_BUG -6 ------------------ 1680| 0| break; 1681| 187k| } 1682| | 1683| 187k| return r; 1684| 187k|} regcomp.c:add_compile_string_length: 427| 64.7k|{ 428| 64.7k| int len; 429| 64.7k| int op = select_str_opcode(mb_len, byte_len, ignore_case); 430| | 431| 64.7k| len = SIZE_OPCODE; ------------------ | | 688| 64.7k|#define SIZE_OPCODE 1 ------------------ 432| | 433| 64.7k| if (op == OP_EXACTMBN) len += SIZE_LENGTH; ------------------ | | 691| 0|#define SIZE_LENGTH (int )sizeof(LengthType) ------------------ | Branch (433:7): [True: 0, False: 64.7k] ------------------ 434| 64.7k| if (IS_NEED_STR_LEN_OP_EXACT(op)) ------------------ | | 316| 64.7k| ((op) == OP_EXACTN || (op) == OP_EXACTMB2N ||\ | | ------------------ | | | Branch (316:5): [True: 35.5k, False: 29.1k] | | | Branch (316:29): [True: 0, False: 29.1k] | | ------------------ | | 317| 64.7k| (op) == OP_EXACTMB3N || (op) == OP_EXACTMBN || (op) == OP_EXACTN_IC) | | ------------------ | | | Branch (317:5): [True: 0, False: 29.1k] | | | Branch (317:29): [True: 0, False: 29.1k] | | | Branch (317:53): [True: 0, False: 29.1k] | | ------------------ ------------------ 435| 35.5k| len += SIZE_LENGTH; ------------------ | | 691| 35.5k|#define SIZE_LENGTH (int )sizeof(LengthType) ------------------ 436| | 437| 64.7k| len += (int )byte_len; 438| 64.7k| return len; 439| 64.7k|} regcomp.c:select_str_opcode: 321| 146k|{ 322| 146k| int op; 323| 146k| OnigDistance str_len = (byte_len + mb_len - 1) / mb_len; 324| | 325| 146k| if (ignore_case) { ------------------ | Branch (325:7): [True: 0, False: 146k] ------------------ 326| 0| switch (str_len) { 327| 0| case 1: op = OP_EXACT1_IC; break; ------------------ | Branch (327:5): [True: 0, False: 0] ------------------ 328| 0| default: op = OP_EXACTN_IC; break; ------------------ | Branch (328:5): [True: 0, False: 0] ------------------ 329| 0| } 330| 0| } 331| 146k| else { 332| 146k| switch (mb_len) { 333| 146k| case 1: ------------------ | Branch (333:5): [True: 146k, False: 0] ------------------ 334| 146k| switch (str_len) { 335| 46.4k| case 1: op = OP_EXACT1; break; ------------------ | Branch (335:7): [True: 46.4k, False: 99.5k] ------------------ 336| 3.77k| case 2: op = OP_EXACT2; break; ------------------ | Branch (336:7): [True: 3.77k, False: 142k] ------------------ 337| 5.69k| case 3: op = OP_EXACT3; break; ------------------ | Branch (337:7): [True: 5.69k, False: 140k] ------------------ 338| 7.70k| case 4: op = OP_EXACT4; break; ------------------ | Branch (338:7): [True: 7.70k, False: 138k] ------------------ 339| 11.7k| case 5: op = OP_EXACT5; break; ------------------ | Branch (339:7): [True: 11.7k, False: 134k] ------------------ 340| 70.6k| default: op = OP_EXACTN; break; ------------------ | Branch (340:7): [True: 70.6k, False: 75.3k] ------------------ 341| 146k| } 342| 146k| break; 343| | 344| 146k| case 2: ------------------ | Branch (344:5): [True: 0, False: 146k] ------------------ 345| 0| switch (str_len) { 346| 0| case 1: op = OP_EXACTMB2N1; break; ------------------ | Branch (346:7): [True: 0, False: 0] ------------------ 347| 0| case 2: op = OP_EXACTMB2N2; break; ------------------ | Branch (347:7): [True: 0, False: 0] ------------------ 348| 0| case 3: op = OP_EXACTMB2N3; break; ------------------ | Branch (348:7): [True: 0, False: 0] ------------------ 349| 0| default: op = OP_EXACTMB2N; break; ------------------ | Branch (349:7): [True: 0, False: 0] ------------------ 350| 0| } 351| 0| break; 352| | 353| 0| case 3: ------------------ | Branch (353:5): [True: 0, False: 146k] ------------------ 354| 0| op = OP_EXACTMB3N; 355| 0| break; 356| | 357| 0| default: ------------------ | Branch (357:5): [True: 0, False: 146k] ------------------ 358| 0| op = OP_EXACTMBN; 359| 0| break; 360| 146k| } 361| 146k| } 362| 146k| return op; 363| 146k|} regcomp.c:compile_length_string_node: 465| 64.7k|{ 466| 64.7k| int rlen, r, len, prev_len, blen, ambig; 467| 64.7k| OnigEncoding enc = reg->enc; 468| 64.7k| UChar *p, *prev; ------------------ | | 76| 64.7k|# define UChar OnigUChar ------------------ 469| 64.7k| StrNode* sn; 470| | 471| 64.7k| sn = NSTR(node); ------------------ | | 76| 64.7k|#define NSTR(node) (&((node)->u.str)) ------------------ 472| 64.7k| if (sn->end <= sn->s) ------------------ | Branch (472:7): [True: 0, False: 64.7k] ------------------ 473| 0| return 0; 474| | 475| 64.7k| ambig = NSTRING_IS_AMBIG(node); ------------------ | | 115| 64.7k|#define NSTRING_IS_AMBIG(node) (((node)->u.str.flag & NSTR_AMBIG) != 0) | | ------------------ | | | | 105| 64.7k|#define NSTR_AMBIG (1<<1) | | ------------------ ------------------ 476| | 477| 64.7k| p = prev = sn->s; 478| 64.7k| prev_len = enclen(enc, p, sn->end); ------------------ | | 93| 64.7k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 364| 64.7k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 64.7k] | | ------------------ ------------------ 479| 64.7k| p += prev_len; 480| 64.7k| blen = prev_len; 481| 64.7k| rlen = 0; 482| | 483| 466k| for (; p < sn->end; ) { ------------------ | Branch (483:10): [True: 401k, False: 64.7k] ------------------ 484| 401k| len = enclen(enc, p, sn->end); ------------------ | | 93| 401k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 364| 401k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 401k] | | ------------------ ------------------ 485| 401k| if (len == prev_len || ambig) { ------------------ | Branch (485:9): [True: 401k, False: 0] | Branch (485:28): [True: 0, False: 0] ------------------ 486| 401k| blen += len; 487| 401k| } 488| 0| else { 489| 0| r = add_compile_string_length(prev, prev_len, blen, reg, ambig); 490| 0| rlen += r; 491| 0| prev = p; 492| 0| blen = len; 493| 0| prev_len = len; 494| 0| } 495| 401k| p += len; 496| 401k| } 497| 64.7k| r = add_compile_string_length(prev, prev_len, blen, reg, ambig); 498| 64.7k| rlen += r; 499| 64.7k| return rlen; 500| 64.7k|} regcomp.c:compile_length_cclass_node: 587| 62.4k|{ 588| 62.4k| int len; 589| | 590| 62.4k| if (IS_NULL(cc->mbuf)) { ------------------ | | 311| 62.4k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 62.4k, False: 0] | | ------------------ ------------------ 591| 62.4k| len = SIZE_OPCODE + SIZE_BITSET; ------------------ | | 688| 62.4k|#define SIZE_OPCODE 1 ------------------ len = SIZE_OPCODE + SIZE_BITSET; ------------------ | | 438| 62.4k|#define SIZE_BITSET (int )sizeof(BitSet) ------------------ 592| 62.4k| } 593| 0| else { 594| 0| if (ONIGENC_MBC_MINLEN(reg->enc) > 1 || bitset_is_empty(cc->bs)) { ------------------ | | 367| 0|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) ------------------ | Branch (594:9): [True: 0, False: 0] | Branch (594:45): [True: 0, False: 0] ------------------ 595| 0| len = SIZE_OPCODE; ------------------ | | 688| 0|#define SIZE_OPCODE 1 ------------------ 596| 0| } 597| 0| else { 598| 0| len = SIZE_OPCODE + SIZE_BITSET; ------------------ | | 688| 0|#define SIZE_OPCODE 1 ------------------ len = SIZE_OPCODE + SIZE_BITSET; ------------------ | | 438| 0|#define SIZE_BITSET (int )sizeof(BitSet) ------------------ 599| 0| } 600| 0|#ifdef PLATFORM_UNALIGNED_WORD_ACCESS 601| 0| len += SIZE_LENGTH + cc->mbuf->used; ------------------ | | 691| 0|#define SIZE_LENGTH (int )sizeof(LengthType) ------------------ 602| |#else 603| | len += SIZE_LENGTH + cc->mbuf->used + (WORD_ALIGNMENT_SIZE - 1); 604| |#endif 605| 0| } 606| | 607| 62.4k| return len; 608| 62.4k|} regcomp.c:compile_length_quantifier_node: 965| 15.0k|{ 966| 15.0k| int len, mod_tlen; 967| 15.0k| int infinite = IS_REPEAT_INFINITE(qn->upper); ------------------ | | 422| 15.0k|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 421| 15.0k|#define REPEAT_INFINITE -1 | | ------------------ ------------------ 968| 15.0k| int empty_info = qn->target_empty_info; 969| 15.0k| int tlen = compile_length_tree(qn->target, reg); 970| | 971| 15.0k| if (tlen < 0) return tlen; ------------------ | Branch (971:7): [True: 0, False: 15.0k] ------------------ 972| | 973| | /* anychar repeat */ 974| 15.0k| if (NTYPE(qn->target) == NT_CANY) { ------------------ | | 69| 15.0k|#define NTYPE(node) ((node)->u.base.type) ------------------ if (NTYPE(qn->target) == NT_CANY) { ------------------ | | 41| 15.0k|#define NT_CANY 3 ------------------ | Branch (974:7): [True: 0, False: 15.0k] ------------------ 975| 0| if (qn->greedy && infinite) { ------------------ | Branch (975:9): [True: 0, False: 0] | Branch (975:23): [True: 0, False: 0] ------------------ 976| 0| if (IS_NOT_NULL(qn->next_head_exact)) ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ 977| 0| return SIZE_OP_ANYCHAR_STAR_PEEK_NEXT + tlen * qn->lower; ------------------ | | 719| 0|#define SIZE_OP_ANYCHAR_STAR_PEEK_NEXT (SIZE_OPCODE + 1) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ 978| 0| else 979| 0| return SIZE_OP_ANYCHAR_STAR + tlen * qn->lower; ------------------ | | 718| 0|#define SIZE_OP_ANYCHAR_STAR SIZE_OPCODE | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ 980| 0| } 981| 0| } 982| | 983| 15.0k| if (empty_info != 0) ------------------ | Branch (983:7): [True: 0, False: 15.0k] ------------------ 984| 0| mod_tlen = tlen + (SIZE_OP_NULL_CHECK_START + SIZE_OP_NULL_CHECK_END); ------------------ | | 742| 0|#define SIZE_OP_NULL_CHECK_START (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_NULL_CHECK_START (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ mod_tlen = tlen + (SIZE_OP_NULL_CHECK_START + SIZE_OP_NULL_CHECK_END); ------------------ | | 743| 0|#define SIZE_OP_NULL_CHECK_END (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_NULL_CHECK_END (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ 985| 15.0k| else 986| 15.0k| mod_tlen = tlen; 987| | 988| 15.0k| if (infinite && ------------------ | Branch (988:7): [True: 15.0k, False: 0] ------------------ 989| 15.0k| (qn->lower <= 1 || tlen * qn->lower <= QUANTIFIER_EXPAND_LIMIT_SIZE)) { ------------------ | | 724| 0|#define QUANTIFIER_EXPAND_LIMIT_SIZE 50 ------------------ | Branch (989:8): [True: 15.0k, False: 0] | Branch (989:26): [True: 0, False: 0] ------------------ 990| 15.0k| if (qn->lower == 1 && tlen > QUANTIFIER_EXPAND_LIMIT_SIZE) { ------------------ | | 724| 11.2k|#define QUANTIFIER_EXPAND_LIMIT_SIZE 50 ------------------ | Branch (990:9): [True: 11.2k, False: 3.76k] | Branch (990:27): [True: 0, False: 11.2k] ------------------ 991| 0| len = SIZE_OP_JUMP; ------------------ | | 720| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 992| 0| } 993| 15.0k| else { 994| 15.0k| len = tlen * qn->lower; 995| 15.0k| } 996| | 997| 15.0k| if (qn->greedy) { ------------------ | Branch (997:9): [True: 15.0k, False: 0] ------------------ 998| |#ifdef USE_OP_PUSH_OR_JUMP_EXACT 999| | if (IS_NOT_NULL(qn->head_exact)) 1000| | len += SIZE_OP_PUSH_OR_JUMP_EXACT1 + mod_tlen + SIZE_OP_JUMP; 1001| | else 1002| |#endif 1003| 15.0k| if (IS_NOT_NULL(qn->next_head_exact)) ------------------ | | 312| 15.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 11.2k, False: 3.76k] | | ------------------ ------------------ 1004| 11.2k| len += SIZE_OP_PUSH_IF_PEEK_NEXT + mod_tlen + SIZE_OP_JUMP; ------------------ | | 724| 11.2k|#define SIZE_OP_PUSH_IF_PEEK_NEXT (SIZE_OPCODE + SIZE_RELADDR + 1) | | ------------------ | | | | 688| 11.2k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH_IF_PEEK_NEXT (SIZE_OPCODE + SIZE_RELADDR + 1) | | ------------------ | | | | 689| 11.2k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ len += SIZE_OP_PUSH_IF_PEEK_NEXT + mod_tlen + SIZE_OP_JUMP; ------------------ | | 720| 11.2k|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 11.2k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 11.2k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1005| 3.76k| else 1006| 3.76k| len += SIZE_OP_PUSH + mod_tlen + SIZE_OP_JUMP; ------------------ | | 721| 3.76k|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 3.76k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 3.76k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ len += SIZE_OP_PUSH + mod_tlen + SIZE_OP_JUMP; ------------------ | | 720| 3.76k|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 3.76k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 3.76k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1007| 15.0k| } 1008| 0| else 1009| 0| len += SIZE_OP_JUMP + mod_tlen + SIZE_OP_PUSH; ------------------ | | 720| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ len += SIZE_OP_JUMP + mod_tlen + SIZE_OP_PUSH; ------------------ | | 721| 0|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1010| 15.0k| } 1011| 0| else if (qn->upper == 0 && qn->is_referred != 0) { /* /(?..){0}/ */ ------------------ | Branch (1011:12): [True: 0, False: 0] | Branch (1011:30): [True: 0, False: 0] ------------------ 1012| 0| len = SIZE_OP_JUMP + tlen; ------------------ | | 720| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1013| 0| } 1014| 0| else if (!infinite && qn->greedy && ------------------ | Branch (1014:12): [True: 0, False: 0] | Branch (1014:25): [True: 0, False: 0] ------------------ 1015| 0| (qn->upper == 1 || (tlen + SIZE_OP_PUSH) * qn->upper ------------------ | | 721| 0|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ | Branch (1015:13): [True: 0, False: 0] | Branch (1015:31): [True: 0, False: 0] ------------------ 1016| 0| <= QUANTIFIER_EXPAND_LIMIT_SIZE)) { ------------------ | | 724| 0|#define QUANTIFIER_EXPAND_LIMIT_SIZE 50 ------------------ 1017| 0| len = tlen * qn->lower; 1018| 0| len += (SIZE_OP_PUSH + tlen) * (qn->upper - qn->lower); ------------------ | | 721| 0|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1019| 0| } 1020| 0| else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */ ------------------ | Branch (1020:12): [True: 0, False: 0] | Branch (1020:27): [True: 0, False: 0] | Branch (1020:45): [True: 0, False: 0] ------------------ 1021| 0| len = SIZE_OP_PUSH + SIZE_OP_JUMP + tlen; ------------------ | | 721| 0|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ len = SIZE_OP_PUSH + SIZE_OP_JUMP + tlen; ------------------ | | 720| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1022| 0| } 1023| 0| else { 1024| 0| len = SIZE_OP_REPEAT_INC ------------------ | | 725| 0|#define SIZE_OP_REPEAT_INC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_REPEAT_INC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ 1025| 0| + mod_tlen + SIZE_OPCODE + SIZE_RELADDR + SIZE_MEMNUM; ------------------ | | 688| 0|#define SIZE_OPCODE 1 ------------------ + mod_tlen + SIZE_OPCODE + SIZE_RELADDR + SIZE_MEMNUM; ------------------ | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) ------------------ + mod_tlen + SIZE_OPCODE + SIZE_RELADDR + SIZE_MEMNUM; ------------------ | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) ------------------ 1026| 0| } 1027| | 1028| 15.0k| return len; 1029| 15.0k|} regcomp.c:compile_length_enclose_node: 1213| 11.2k|{ 1214| 11.2k| int len; 1215| 11.2k| int tlen; 1216| | 1217| 11.2k| if (node->type == ENCLOSE_OPTION) ------------------ | | 95| 11.2k|#define ENCLOSE_OPTION (1<<1) ------------------ | Branch (1217:7): [True: 0, False: 11.2k] ------------------ 1218| 0| return compile_length_option_node(node, reg); 1219| | 1220| 11.2k| if (node->target) { ------------------ | Branch (1220:7): [True: 11.2k, False: 0] ------------------ 1221| 11.2k| tlen = compile_length_tree(node->target, reg); 1222| 11.2k| if (tlen < 0) return tlen; ------------------ | Branch (1222:9): [True: 0, False: 11.2k] ------------------ 1223| 11.2k| } 1224| 0| else 1225| 0| tlen = 0; 1226| | 1227| 11.2k| switch (node->type) { 1228| 0| case ENCLOSE_MEMORY: ------------------ | | 94| 0|#define ENCLOSE_MEMORY (1<<0) ------------------ | Branch (1228:3): [True: 0, False: 11.2k] ------------------ 1229| 0|#ifdef USE_SUBEXP_CALL 1230| 0| if (IS_ENCLOSE_CALLED(node)) { ------------------ | | 147| 0|#define IS_ENCLOSE_CALLED(en) (((en)->state & NST_CALLED) != 0) | | ------------------ | | | | 136| 0|#define NST_CALLED (1<<8) | | ------------------ | | | Branch (147:40): [True: 0, False: 0] | | ------------------ ------------------ 1231| 0| len = SIZE_OP_MEMORY_START_PUSH + tlen ------------------ | | 735| 0|#define SIZE_OP_MEMORY_START_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_START_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ 1232| 0| + SIZE_OP_CALL + SIZE_OP_JUMP + SIZE_OP_RETURN; ------------------ | | 747| 0|#define SIZE_OP_CALL (SIZE_OPCODE + SIZE_ABSADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_CALL (SIZE_OPCODE + SIZE_ABSADDR) | | ------------------ | | | | 690| 0|#define SIZE_ABSADDR (int )sizeof(AbsAddrType) | | ------------------ ------------------ + SIZE_OP_CALL + SIZE_OP_JUMP + SIZE_OP_RETURN; ------------------ | | 720| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ + SIZE_OP_CALL + SIZE_OP_JUMP + SIZE_OP_RETURN; ------------------ | | 748| 0|#define SIZE_OP_RETURN SIZE_OPCODE | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ 1233| 0| if (BIT_STATUS_AT(reg->bt_mem_end, node->regnum)) ------------------ | | 371| 0| ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1)) | | ------------------ | | | | 367| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (371:3): [True: 0, False: 0] | | | Branch (371:4): [True: 0, False: 0] | | ------------------ ------------------ 1234| 0| len += (IS_ENCLOSE_RECURSION(node) ------------------ | | 149| 0|#define IS_ENCLOSE_RECURSION(en) (((en)->state & NST_RECURSION) != 0) | | ------------------ | | | | 135| 0|#define NST_RECURSION (1<<7) | | ------------------ | | | Branch (149:40): [True: 0, False: 0] | | ------------------ ------------------ 1235| 0| ? SIZE_OP_MEMORY_END_PUSH_REC : SIZE_OP_MEMORY_END_PUSH); ------------------ | | 737| 0|#define SIZE_OP_MEMORY_END_PUSH_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END_PUSH_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ ? SIZE_OP_MEMORY_END_PUSH_REC : SIZE_OP_MEMORY_END_PUSH); ------------------ | | 736| 0|#define SIZE_OP_MEMORY_END_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ 1236| 0| else 1237| 0| len += (IS_ENCLOSE_RECURSION(node) ------------------ | | 149| 0|#define IS_ENCLOSE_RECURSION(en) (((en)->state & NST_RECURSION) != 0) | | ------------------ | | | | 135| 0|#define NST_RECURSION (1<<7) | | ------------------ | | | Branch (149:40): [True: 0, False: 0] | | ------------------ ------------------ 1238| 0| ? SIZE_OP_MEMORY_END_REC : SIZE_OP_MEMORY_END); ------------------ | | 739| 0|#define SIZE_OP_MEMORY_END_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ ? SIZE_OP_MEMORY_END_REC : SIZE_OP_MEMORY_END); ------------------ | | 738| 0|#define SIZE_OP_MEMORY_END (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ 1239| 0| } 1240| 0| else if (IS_ENCLOSE_RECURSION(node)) { ------------------ | | 149| 0|#define IS_ENCLOSE_RECURSION(en) (((en)->state & NST_RECURSION) != 0) | | ------------------ | | | | 135| 0|#define NST_RECURSION (1<<7) | | ------------------ | | | Branch (149:40): [True: 0, False: 0] | | ------------------ ------------------ 1241| 0| len = SIZE_OP_MEMORY_START_PUSH; ------------------ | | 735| 0|#define SIZE_OP_MEMORY_START_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_START_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ 1242| 0| len += tlen + (BIT_STATUS_AT(reg->bt_mem_end, node->regnum) ------------------ | | 371| 0| ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1)) | | ------------------ | | | | 367| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (371:3): [True: 0, False: 0] | | | Branch (371:4): [True: 0, False: 0] | | ------------------ ------------------ 1243| 0| ? SIZE_OP_MEMORY_END_PUSH_REC : SIZE_OP_MEMORY_END_REC); ------------------ | | 737| 0|#define SIZE_OP_MEMORY_END_PUSH_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END_PUSH_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ ? SIZE_OP_MEMORY_END_PUSH_REC : SIZE_OP_MEMORY_END_REC); ------------------ | | 739| 0|#define SIZE_OP_MEMORY_END_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ 1244| 0| } 1245| 0| else 1246| 0|#endif 1247| 0| { 1248| 0| if (BIT_STATUS_AT(reg->bt_mem_start, node->regnum)) ------------------ | | 371| 0| ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1)) | | ------------------ | | | | 367| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (371:3): [True: 0, False: 0] | | | Branch (371:4): [True: 0, False: 0] | | ------------------ ------------------ 1249| 0| len = SIZE_OP_MEMORY_START_PUSH; ------------------ | | 735| 0|#define SIZE_OP_MEMORY_START_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_START_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ 1250| 0| else 1251| 0| len = SIZE_OP_MEMORY_START; ------------------ | | 734| 0|#define SIZE_OP_MEMORY_START (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_START (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ 1252| | 1253| 0| len += tlen + (BIT_STATUS_AT(reg->bt_mem_end, node->regnum) ------------------ | | 371| 0| ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1)) | | ------------------ | | | | 367| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (371:3): [True: 0, False: 0] | | | Branch (371:4): [True: 0, False: 0] | | ------------------ ------------------ 1254| 0| ? SIZE_OP_MEMORY_END_PUSH : SIZE_OP_MEMORY_END); ------------------ | | 736| 0|#define SIZE_OP_MEMORY_END_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ ? SIZE_OP_MEMORY_END_PUSH : SIZE_OP_MEMORY_END); ------------------ | | 738| 0|#define SIZE_OP_MEMORY_END (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ 1255| 0| } 1256| 0| break; 1257| | 1258| 11.2k| case ENCLOSE_STOP_BACKTRACK: ------------------ | | 96| 11.2k|#define ENCLOSE_STOP_BACKTRACK (1<<2) ------------------ | Branch (1258:3): [True: 11.2k, False: 0] ------------------ 1259| 11.2k| if (IS_ENCLOSE_STOP_BT_SIMPLE_REPEAT(node)) { ------------------ | | 156| 11.2k| (((en)->state & NST_STOP_BT_SIMPLE_REPEAT) != 0) | | ------------------ | | | | 134| 11.2k|#define NST_STOP_BT_SIMPLE_REPEAT (1<<6) | | ------------------ | | | Branch (156:5): [True: 11.2k, False: 0] | | ------------------ ------------------ 1260| 11.2k| QtfrNode* qn = NQTFR(node->target); ------------------ | | 80| 11.2k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1261| 11.2k| tlen = compile_length_tree(qn->target, reg); 1262| 11.2k| if (tlen < 0) return tlen; ------------------ | Branch (1262:11): [True: 0, False: 11.2k] ------------------ 1263| | 1264| 11.2k| len = tlen * qn->lower 1265| 11.2k| + SIZE_OP_PUSH + tlen + SIZE_OP_POP + SIZE_OP_JUMP; ------------------ | | 721| 11.2k|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 11.2k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 11.2k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ + SIZE_OP_PUSH + tlen + SIZE_OP_POP + SIZE_OP_JUMP; ------------------ | | 722| 11.2k|#define SIZE_OP_POP SIZE_OPCODE | | ------------------ | | | | 688| 11.2k|#define SIZE_OPCODE 1 | | ------------------ ------------------ + SIZE_OP_PUSH + tlen + SIZE_OP_POP + SIZE_OP_JUMP; ------------------ | | 720| 11.2k|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 11.2k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 11.2k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1266| 11.2k| } 1267| 0| else { 1268| 0| len = SIZE_OP_PUSH_STOP_BT + tlen + SIZE_OP_POP_STOP_BT; ------------------ | | 740| 0|#define SIZE_OP_PUSH_STOP_BT SIZE_OPCODE | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ len = SIZE_OP_PUSH_STOP_BT + tlen + SIZE_OP_POP_STOP_BT; ------------------ | | 741| 0|#define SIZE_OP_POP_STOP_BT SIZE_OPCODE | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ 1269| 0| } 1270| 11.2k| break; 1271| | 1272| 11.2k| case ENCLOSE_CONDITION: ------------------ | | 97| 0|#define ENCLOSE_CONDITION (1<<3) ------------------ | Branch (1272:3): [True: 0, False: 11.2k] ------------------ 1273| 0| len = SIZE_OP_CONDITION; ------------------ | | 749| 0|#define SIZE_OP_CONDITION (SIZE_OPCODE + SIZE_MEMNUM + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_CONDITION (SIZE_OPCODE + SIZE_MEMNUM + SIZE_RELADDR) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ | | #define SIZE_OP_CONDITION (SIZE_OPCODE + SIZE_MEMNUM + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1274| 0| if (NTYPE(node->target) == NT_ALT) { ------------------ | | 69| 0|#define NTYPE(node) ((node)->u.base.type) ------------------ if (NTYPE(node->target) == NT_ALT) { ------------------ | | 47| 0|#define NT_ALT 9 ------------------ | Branch (1274:9): [True: 0, False: 0] ------------------ 1275| 0| Node* x = node->target; 1276| | 1277| 0| tlen = compile_length_tree(NCAR(x), reg); /* yes-node */ ------------------ | | 86| 0|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1278| 0| if (tlen < 0) return tlen; ------------------ | Branch (1278:11): [True: 0, False: 0] ------------------ 1279| 0| len += tlen + SIZE_OP_JUMP; ------------------ | | 720| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1280| 0| if (NCDR(x) == NULL) return ONIGERR_PARSER_BUG; ------------------ | | 87| 0|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ if (NCDR(x) == NULL) return ONIGERR_PARSER_BUG; ------------------ | | 634| 0|#define ONIGERR_PARSER_BUG -11 ------------------ | Branch (1280:11): [True: 0, False: 0] ------------------ 1281| 0| x = NCDR(x); ------------------ | | 87| 0|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1282| 0| tlen = compile_length_tree(NCAR(x), reg); /* no-node */ ------------------ | | 86| 0|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1283| 0| if (tlen < 0) return tlen; ------------------ | Branch (1283:11): [True: 0, False: 0] ------------------ 1284| 0| len += tlen; 1285| 0| if (NCDR(x) != NULL) return ONIGERR_INVALID_CONDITION_PATTERN; ------------------ | | 87| 0|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ if (NCDR(x) != NULL) return ONIGERR_INVALID_CONDITION_PATTERN; ------------------ | | 667| 0|#define ONIGERR_INVALID_CONDITION_PATTERN -124 ------------------ | Branch (1285:11): [True: 0, False: 0] ------------------ 1286| 0| } 1287| 0| else { 1288| 0| return ONIGERR_PARSER_BUG; ------------------ | | 634| 0|#define ONIGERR_PARSER_BUG -11 ------------------ 1289| 0| } 1290| 0| break; 1291| | 1292| 0| case ENCLOSE_ABSENT: ------------------ | | 98| 0|#define ENCLOSE_ABSENT (1<<4) ------------------ | Branch (1292:3): [True: 0, False: 11.2k] ------------------ 1293| 0| len = SIZE_OP_PUSH_ABSENT_POS + SIZE_OP_ABSENT + tlen + SIZE_OP_ABSENT_END; ------------------ | | 750| 0|#define SIZE_OP_PUSH_ABSENT_POS SIZE_OPCODE | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ len = SIZE_OP_PUSH_ABSENT_POS + SIZE_OP_ABSENT + tlen + SIZE_OP_ABSENT_END; ------------------ | | 751| 0|#define SIZE_OP_ABSENT (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_ABSENT (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ len = SIZE_OP_PUSH_ABSENT_POS + SIZE_OP_ABSENT + tlen + SIZE_OP_ABSENT_END; ------------------ | | 752| 0|#define SIZE_OP_ABSENT_END SIZE_OPCODE | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ 1294| 0| break; 1295| | 1296| 0| default: ------------------ | Branch (1296:3): [True: 0, False: 11.2k] ------------------ 1297| 0| return ONIGERR_TYPE_BUG; ------------------ | | 633| 0|#define ONIGERR_TYPE_BUG -6 ------------------ 1298| 0| break; 1299| 11.2k| } 1300| | 1301| 11.2k| return len; 1302| 11.2k|} regcomp.c:compile_length_anchor_node: 1463| 7.53k|{ 1464| 7.53k| int len; 1465| 7.53k| int tlen = 0; 1466| | 1467| 7.53k| if (node->target) { ------------------ | Branch (1467:7): [True: 0, False: 7.53k] ------------------ 1468| 0| tlen = compile_length_tree(node->target, reg); 1469| 0| if (tlen < 0) return tlen; ------------------ | Branch (1469:9): [True: 0, False: 0] ------------------ 1470| 0| } 1471| | 1472| 7.53k| switch (node->type) { 1473| 0| case ANCHOR_PREC_READ: ------------------ | | 551| 0|#define ANCHOR_PREC_READ (1<<10) ------------------ | Branch (1473:3): [True: 0, False: 7.53k] ------------------ 1474| 0| len = SIZE_OP_PUSH_POS + tlen + SIZE_OP_POP_POS; ------------------ | | 727| 0|#define SIZE_OP_PUSH_POS SIZE_OPCODE | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ len = SIZE_OP_PUSH_POS + tlen + SIZE_OP_POP_POS; ------------------ | | 729| 0|#define SIZE_OP_POP_POS SIZE_OPCODE | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ 1475| 0| break; 1476| 0| case ANCHOR_PREC_READ_NOT: ------------------ | | 552| 0|#define ANCHOR_PREC_READ_NOT (1<<11) ------------------ | Branch (1476:3): [True: 0, False: 7.53k] ------------------ 1477| 0| len = SIZE_OP_PUSH_POS_NOT + tlen + SIZE_OP_FAIL_POS; ------------------ | | 728| 0|#define SIZE_OP_PUSH_POS_NOT (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH_POS_NOT (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ len = SIZE_OP_PUSH_POS_NOT + tlen + SIZE_OP_FAIL_POS; ------------------ | | 730| 0|#define SIZE_OP_FAIL_POS SIZE_OPCODE | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ 1478| 0| break; 1479| 0| case ANCHOR_LOOK_BEHIND: ------------------ | | 553| 0|#define ANCHOR_LOOK_BEHIND (1<<12) ------------------ | Branch (1479:3): [True: 0, False: 7.53k] ------------------ 1480| 0| len = SIZE_OP_LOOK_BEHIND + tlen; ------------------ | | 744| 0|#define SIZE_OP_LOOK_BEHIND (SIZE_OPCODE + SIZE_LENGTH) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_LOOK_BEHIND (SIZE_OPCODE + SIZE_LENGTH) | | ------------------ | | | | 691| 0|#define SIZE_LENGTH (int )sizeof(LengthType) | | ------------------ ------------------ 1481| 0| break; 1482| 0| case ANCHOR_LOOK_BEHIND_NOT: ------------------ | | 554| 0|#define ANCHOR_LOOK_BEHIND_NOT (1<<13) ------------------ | Branch (1482:3): [True: 0, False: 7.53k] ------------------ 1483| 0| len = SIZE_OP_PUSH_LOOK_BEHIND_NOT + tlen + SIZE_OP_FAIL_LOOK_BEHIND_NOT; ------------------ | | 745| 0|#define SIZE_OP_PUSH_LOOK_BEHIND_NOT (SIZE_OPCODE + SIZE_RELADDR + SIZE_LENGTH) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH_LOOK_BEHIND_NOT (SIZE_OPCODE + SIZE_RELADDR + SIZE_LENGTH) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ | | #define SIZE_OP_PUSH_LOOK_BEHIND_NOT (SIZE_OPCODE + SIZE_RELADDR + SIZE_LENGTH) | | ------------------ | | | | 691| 0|#define SIZE_LENGTH (int )sizeof(LengthType) | | ------------------ ------------------ len = SIZE_OP_PUSH_LOOK_BEHIND_NOT + tlen + SIZE_OP_FAIL_LOOK_BEHIND_NOT; ------------------ | | 746| 0|#define SIZE_OP_FAIL_LOOK_BEHIND_NOT SIZE_OPCODE | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ 1484| 0| break; 1485| | 1486| 7.53k| default: ------------------ | Branch (1486:3): [True: 7.53k, False: 0] ------------------ 1487| 7.53k| len = SIZE_OPCODE; ------------------ | | 688| 7.53k|#define SIZE_OPCODE 1 ------------------ 1488| 7.53k| break; 1489| 7.53k| } 1490| | 1491| 7.53k| return len; 1492| 7.53k|} regcomp.c:add_opcode_rel_addr: 277| 125k|{ 278| 125k| int r; 279| | 280| 125k| r = add_opcode(reg, opcode); 281| 125k| if (r) return r; ------------------ | Branch (281:7): [True: 0, False: 125k] ------------------ 282| 125k| r = add_rel_addr(reg, addr); 283| 125k| return r; 284| 125k|} regcomp.c:add_rel_addr: 223| 125k|{ 224| 125k| RelAddrType ra = (RelAddrType )addr; 225| | 226| 125k| BBUF_ADD(reg, &ra, SIZE_RELADDR); ------------------ | | 504| 125k|#define BBUF_ADD(buf,bytes,n) BBUF_WRITE((buf),(buf)->used,(bytes),(n)) | | ------------------ | | | | 490| 125k|#define BBUF_WRITE(buf,pos,bytes,n) do{\ | | | | 491| 125k| int used = (pos) + (int )(n);\ | | | | 492| 125k| if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ | | | | ------------------ | | | | | | 470| 5.78k|#define BBUF_EXPAND(buf,low) do{\ | | | | | | 471| 5.78k| UChar *tmp;\ | | | | | | ------------------ | | | | | | | | 76| 5.78k|# define UChar OnigUChar | | | | | | ------------------ | | | | | | 472| 5.78k| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | | | ------------------ | | | | | | | Branch (472:36): [True: 0, False: 5.78k] | | | | | | ------------------ | | | | | | 473| 5.78k| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | | | ------------------ | | | | | | | | 143| 5.78k|# define xrealloc realloc | | | | | | ------------------ | | | | | | 474| 5.78k| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 311| 5.78k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | | | ------------------ | | | | | | | | | Branch (311:39): [True: 0, False: 5.78k] | | | | | | | | ------------------ | | | | | | ------------------ | | | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 632| 0|#define ONIGERR_MEMORY -5 | | | | | | ------------------ | | | | | | 475| 5.78k| (buf)->p = tmp;\ | | | | | | 476| 5.78k|} while (0) | | | | | | ------------------ | | | | | | | Branch (476:10): [Folded - Ignored] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (492:7): [True: 5.78k, False: 119k] | | | | ------------------ | | | | 493| 125k| xmemcpy((buf)->p + (pos), (bytes), (n));\ | | | | ------------------ | | | | | | 215| 125k|#define xmemcpy memcpy | | | | ------------------ | | | | 494| 125k| if ((buf)->used < (unsigned int )used) (buf)->used = used;\ | | | | ------------------ | | | | | Branch (494:7): [True: 125k, False: 0] | | | | ------------------ | | | | 495| 125k|} while (0) | | | | ------------------ | | | | | Branch (495:10): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 227| 125k| return 0; 228| 125k|} regcomp.c:add_compile_string: 444| 81.2k|{ 445| 81.2k| int op = select_str_opcode(mb_len, byte_len, ignore_case); 446| 81.2k| add_opcode(reg, op); 447| | 448| 81.2k| if (op == OP_EXACTMBN) ------------------ | Branch (448:7): [True: 0, False: 81.2k] ------------------ 449| 0| add_length(reg, mb_len); 450| | 451| 81.2k| if (IS_NEED_STR_LEN_OP_EXACT(op)) { ------------------ | | 316| 81.2k| ((op) == OP_EXACTN || (op) == OP_EXACTMB2N ||\ | | ------------------ | | | Branch (316:5): [True: 35.0k, False: 46.2k] | | | Branch (316:29): [True: 0, False: 46.2k] | | ------------------ | | 317| 81.2k| (op) == OP_EXACTMB3N || (op) == OP_EXACTMBN || (op) == OP_EXACTN_IC) | | ------------------ | | | Branch (317:5): [True: 0, False: 46.2k] | | | Branch (317:29): [True: 0, False: 46.2k] | | | Branch (317:53): [True: 0, False: 46.2k] | | ------------------ ------------------ 452| 35.0k| if (op == OP_EXACTN_IC) ------------------ | Branch (452:9): [True: 0, False: 35.0k] ------------------ 453| 0| add_length(reg, byte_len); 454| 35.0k| else 455| 35.0k| add_length(reg, byte_len / mb_len); 456| 35.0k| } 457| | 458| 81.2k| add_bytes(reg, s, byte_len); 459| 81.2k| return 0; 460| 81.2k|} regcomp.c:add_bytes: 288| 85.0k|{ 289| 85.0k| BBUF_ADD(reg, bytes, len); ------------------ | | 504| 85.0k|#define BBUF_ADD(buf,bytes,n) BBUF_WRITE((buf),(buf)->used,(bytes),(n)) | | ------------------ | | | | 490| 85.0k|#define BBUF_WRITE(buf,pos,bytes,n) do{\ | | | | 491| 85.0k| int used = (pos) + (int )(n);\ | | | | 492| 85.0k| if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ | | | | ------------------ | | | | | | 470| 3.94k|#define BBUF_EXPAND(buf,low) do{\ | | | | | | 471| 3.94k| UChar *tmp;\ | | | | | | ------------------ | | | | | | | | 76| 3.94k|# define UChar OnigUChar | | | | | | ------------------ | | | | | | 472| 3.94k| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | | | ------------------ | | | | | | | Branch (472:36): [True: 0, False: 3.94k] | | | | | | ------------------ | | | | | | 473| 3.94k| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | | | ------------------ | | | | | | | | 143| 3.94k|# define xrealloc realloc | | | | | | ------------------ | | | | | | 474| 3.94k| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 311| 3.94k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | | | ------------------ | | | | | | | | | Branch (311:39): [True: 0, False: 3.94k] | | | | | | | | ------------------ | | | | | | ------------------ | | | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 632| 0|#define ONIGERR_MEMORY -5 | | | | | | ------------------ | | | | | | 475| 3.94k| (buf)->p = tmp;\ | | | | | | 476| 3.94k|} while (0) | | | | | | ------------------ | | | | | | | Branch (476:10): [Folded - Ignored] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (492:7): [True: 3.94k, False: 81.0k] | | | | ------------------ | | | | 493| 85.0k| xmemcpy((buf)->p + (pos), (bytes), (n));\ | | | | ------------------ | | | | | | 215| 85.0k|#define xmemcpy memcpy | | | | ------------------ | | | | 494| 85.0k| if ((buf)->used < (unsigned int )used) (buf)->used = used;\ | | | | ------------------ | | | | | Branch (494:7): [True: 85.0k, False: 0] | | | | ------------------ | | | | 495| 85.0k|} while (0) | | | | ------------------ | | | | | Branch (495:10): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 290| 85.0k| return 0; 291| 85.0k|} regcomp.c:compile_string_node: 513| 83.2k|{ 514| 83.2k| int r, len, prev_len, blen, ambig; 515| 83.2k| OnigEncoding enc = reg->enc; 516| 83.2k| UChar *p, *prev, *end; ------------------ | | 76| 83.2k|# define UChar OnigUChar ------------------ 517| 83.2k| StrNode* sn; 518| | 519| 83.2k| sn = NSTR(node); ------------------ | | 76| 83.2k|#define NSTR(node) (&((node)->u.str)) ------------------ 520| 83.2k| if (sn->end <= sn->s) ------------------ | Branch (520:7): [True: 1.95k, False: 81.2k] ------------------ 521| 1.95k| return 0; 522| | 523| 81.2k| end = sn->end; 524| 81.2k| ambig = NSTRING_IS_AMBIG(node); ------------------ | | 115| 81.2k|#define NSTRING_IS_AMBIG(node) (((node)->u.str.flag & NSTR_AMBIG) != 0) | | ------------------ | | | | 105| 81.2k|#define NSTR_AMBIG (1<<1) | | ------------------ ------------------ 525| | 526| 81.2k| p = prev = sn->s; 527| 81.2k| prev_len = enclen(enc, p, end); ------------------ | | 93| 81.2k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 364| 81.2k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 81.2k] | | ------------------ ------------------ 528| 81.2k| p += prev_len; 529| 81.2k| blen = prev_len; 530| | 531| 714k| for (; p < end; ) { ------------------ | Branch (531:10): [True: 633k, False: 81.2k] ------------------ 532| 633k| len = enclen(enc, p, end); ------------------ | | 93| 633k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 364| 633k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 633k] | | ------------------ ------------------ 533| 633k| if (len == prev_len || ambig) { ------------------ | Branch (533:9): [True: 633k, False: 0] | Branch (533:28): [True: 0, False: 0] ------------------ 534| 633k| blen += len; 535| 633k| } 536| 0| else { 537| 0| r = add_compile_string(prev, prev_len, blen, reg, ambig); 538| 0| if (p + len > end) { ------------------ | Branch (538:11): [True: 0, False: 0] ------------------ 539| 0| return 0; 540| 0| } 541| 0| if (r) return r; ------------------ | Branch (541:11): [True: 0, False: 0] ------------------ 542| | 543| 0| prev = p; 544| 0| blen = len; 545| 0| prev_len = len; 546| 0| } 547| | 548| 633k| p += len; 549| 633k| } 550| 81.2k| return add_compile_string(prev, prev_len, blen, reg, ambig); 551| 81.2k|} regcomp.c:compile_cclass_node: 612| 75.8k|{ 613| 75.8k| int r; 614| | 615| 75.8k| if (IS_NULL(cc->mbuf)) { ------------------ | | 311| 75.8k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 75.8k, False: 0] | | ------------------ ------------------ 616| 75.8k| if (IS_NCCLASS_NOT(cc)) ------------------ | | 809| 75.8k|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 802| 75.8k|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 799| 75.8k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | | | | Branch (802:37): [True: 20.4k, False: 55.3k] | | | | ------------------ | | ------------------ ------------------ 617| 20.4k| add_opcode(reg, OP_CCLASS_NOT); 618| 55.3k| else 619| 55.3k| add_opcode(reg, OP_CCLASS); 620| | 621| 75.8k| r = add_bitset(reg, cc->bs); 622| 75.8k| } 623| 0| else { 624| 0| if (ONIGENC_MBC_MINLEN(reg->enc) > 1 || bitset_is_empty(cc->bs)) { ------------------ | | 367| 0|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) ------------------ | Branch (624:9): [True: 0, False: 0] | Branch (624:45): [True: 0, False: 0] ------------------ 625| 0| if (IS_NCCLASS_NOT(cc)) ------------------ | | 809| 0|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 802| 0|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 799| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | | | | Branch (802:37): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 626| 0| add_opcode(reg, OP_CCLASS_MB_NOT); 627| 0| else 628| 0| add_opcode(reg, OP_CCLASS_MB); 629| | 630| 0| r = add_multi_byte_cclass(cc->mbuf, reg); 631| 0| } 632| 0| else { 633| 0| if (IS_NCCLASS_NOT(cc)) ------------------ | | 809| 0|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 802| 0|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 799| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | | | | Branch (802:37): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 634| 0| add_opcode(reg, OP_CCLASS_MIX_NOT); 635| 0| else 636| 0| add_opcode(reg, OP_CCLASS_MIX); 637| | 638| 0| r = add_bitset(reg, cc->bs); 639| 0| if (r) return r; ------------------ | Branch (639:11): [True: 0, False: 0] ------------------ 640| 0| r = add_multi_byte_cclass(cc->mbuf, reg); 641| 0| } 642| 0| } 643| | 644| 75.8k| return r; 645| 75.8k|} regcomp.c:add_bitset: 295| 75.8k|{ 296| 75.8k| BBUF_ADD(reg, bs, SIZE_BITSET); ------------------ | | 504| 75.8k|#define BBUF_ADD(buf,bytes,n) BBUF_WRITE((buf),(buf)->used,(bytes),(n)) | | ------------------ | | | | 490| 75.8k|#define BBUF_WRITE(buf,pos,bytes,n) do{\ | | | | 491| 75.8k| int used = (pos) + (int )(n);\ | | | | 492| 75.8k| if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ | | | | ------------------ | | | | | | 470| 30.2k|#define BBUF_EXPAND(buf,low) do{\ | | | | | | 471| 30.2k| UChar *tmp;\ | | | | | | ------------------ | | | | | | | | 76| 30.2k|# define UChar OnigUChar | | | | | | ------------------ | | | | | | 472| 37.7k| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | | | ------------------ | | | | | | | Branch (472:36): [True: 7.57k, False: 30.2k] | | | | | | ------------------ | | | | | | 473| 30.2k| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | | | ------------------ | | | | | | | | 143| 30.2k|# define xrealloc realloc | | | | | | ------------------ | | | | | | 474| 30.2k| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 311| 30.2k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | | | ------------------ | | | | | | | | | Branch (311:39): [True: 0, False: 30.2k] | | | | | | | | ------------------ | | | | | | ------------------ | | | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 632| 0|#define ONIGERR_MEMORY -5 | | | | | | ------------------ | | | | | | 475| 30.2k| (buf)->p = tmp;\ | | | | | | 476| 30.2k|} while (0) | | | | | | ------------------ | | | | | | | Branch (476:10): [Folded - Ignored] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (492:7): [True: 30.2k, False: 45.6k] | | | | ------------------ | | | | 493| 75.8k| xmemcpy((buf)->p + (pos), (bytes), (n));\ | | | | ------------------ | | | | | | 215| 75.8k|#define xmemcpy memcpy | | | | ------------------ | | | | 494| 75.8k| if ((buf)->used < (unsigned int )used) (buf)->used = used;\ | | | | ------------------ | | | | | Branch (494:7): [True: 75.8k, False: 0] | | | | ------------------ | | | | 495| 75.8k|} while (0) | | | | ------------------ | | | | | Branch (495:10): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 297| 75.8k| return 0; 298| 75.8k|} regcomp.c:add_length: 241| 35.0k|{ 242| 35.0k| LengthType l = (LengthType )len; 243| | 244| 35.0k| BBUF_ADD(reg, &l, SIZE_LENGTH); ------------------ | | 504| 35.0k|#define BBUF_ADD(buf,bytes,n) BBUF_WRITE((buf),(buf)->used,(bytes),(n)) | | ------------------ | | | | 490| 35.0k|#define BBUF_WRITE(buf,pos,bytes,n) do{\ | | | | 491| 35.0k| int used = (pos) + (int )(n);\ | | | | 492| 35.0k| if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ | | | | ------------------ | | | | | | 470| 0|#define BBUF_EXPAND(buf,low) do{\ | | | | | | 471| 0| UChar *tmp;\ | | | | | | ------------------ | | | | | | | | 76| 0|# define UChar OnigUChar | | | | | | ------------------ | | | | | | 472| 0| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | | | ------------------ | | | | | | | Branch (472:36): [True: 0, False: 0] | | | | | | ------------------ | | | | | | 473| 0| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | | | ------------------ | | | | | | | | 143| 0|# define xrealloc realloc | | | | | | ------------------ | | | | | | 474| 0| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | | | ------------------ | | | | | | | | | Branch (311:39): [True: 0, False: 0] | | | | | | | | ------------------ | | | | | | ------------------ | | | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 632| 0|#define ONIGERR_MEMORY -5 | | | | | | ------------------ | | | | | | 475| 0| (buf)->p = tmp;\ | | | | | | 476| 0|} while (0) | | | | | | ------------------ | | | | | | | Branch (476:10): [Folded - Ignored] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (492:7): [True: 0, False: 35.0k] | | | | ------------------ | | | | 493| 35.0k| xmemcpy((buf)->p + (pos), (bytes), (n));\ | | | | ------------------ | | | | | | 215| 35.0k|#define xmemcpy memcpy | | | | ------------------ | | | | 494| 35.0k| if ((buf)->used < (unsigned int )used) (buf)->used = used;\ | | | | ------------------ | | | | | Branch (494:7): [True: 35.0k, False: 0] | | | | ------------------ | | | | 495| 35.0k|} while (0) | | | | ------------------ | | | | | Branch (495:10): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 245| 35.0k| return 0; 246| 35.0k|} regcomp.c:add_mem_num: 250| 20.1k|{ 251| 20.1k| MemNumType n = (MemNumType )num; 252| | 253| 20.1k| BBUF_ADD(reg, &n, SIZE_MEMNUM); ------------------ | | 504| 20.1k|#define BBUF_ADD(buf,bytes,n) BBUF_WRITE((buf),(buf)->used,(bytes),(n)) | | ------------------ | | | | 490| 20.1k|#define BBUF_WRITE(buf,pos,bytes,n) do{\ | | | | 491| 20.1k| int used = (pos) + (int )(n);\ | | | | 492| 20.1k| if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ | | | | ------------------ | | | | | | 470| 0|#define BBUF_EXPAND(buf,low) do{\ | | | | | | 471| 0| UChar *tmp;\ | | | | | | ------------------ | | | | | | | | 76| 0|# define UChar OnigUChar | | | | | | ------------------ | | | | | | 472| 0| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | | | ------------------ | | | | | | | Branch (472:36): [True: 0, False: 0] | | | | | | ------------------ | | | | | | 473| 0| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | | | ------------------ | | | | | | | | 143| 0|# define xrealloc realloc | | | | | | ------------------ | | | | | | 474| 0| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | | | ------------------ | | | | | | | | | Branch (311:39): [True: 0, False: 0] | | | | | | | | ------------------ | | | | | | ------------------ | | | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 632| 0|#define ONIGERR_MEMORY -5 | | | | | | ------------------ | | | | | | 475| 0| (buf)->p = tmp;\ | | | | | | 476| 0|} while (0) | | | | | | ------------------ | | | | | | | Branch (476:10): [Folded - Ignored] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (492:7): [True: 0, False: 20.1k] | | | | ------------------ | | | | 493| 20.1k| xmemcpy((buf)->p + (pos), (bytes), (n));\ | | | | ------------------ | | | | | | 215| 20.1k|#define xmemcpy memcpy | | | | ------------------ | | | | 494| 20.1k| if ((buf)->used < (unsigned int )used) (buf)->used = used;\ | | | | ------------------ | | | | | Branch (494:7): [True: 20.1k, False: 0] | | | | ------------------ | | | | 495| 20.1k|} while (0) | | | | ------------------ | | | | | Branch (495:10): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 254| 20.1k| return 0; 255| 20.1k|} regcomp.c:compile_quantifier_node: 1033| 32.6k|{ 1034| 32.6k| int i, r, mod_tlen; 1035| 32.6k| int infinite = IS_REPEAT_INFINITE(qn->upper); ------------------ | | 422| 32.6k|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 421| 32.6k|#define REPEAT_INFINITE -1 | | ------------------ ------------------ 1036| 32.6k| int empty_info = qn->target_empty_info; 1037| 32.6k| int tlen = compile_length_tree(qn->target, reg); 1038| | 1039| 32.6k| if (tlen < 0) return tlen; ------------------ | Branch (1039:7): [True: 0, False: 32.6k] ------------------ 1040| | 1041| 32.6k| if (is_anychar_star_quantifier(qn)) { ------------------ | Branch (1041:7): [True: 9.47k, False: 23.1k] ------------------ 1042| 9.47k| r = compile_tree_n_times(qn->target, qn->lower, reg); 1043| 9.47k| if (r) return r; ------------------ | Branch (1043:9): [True: 0, False: 9.47k] ------------------ 1044| 9.47k| if (IS_NOT_NULL(qn->next_head_exact)) { ------------------ | | 312| 9.47k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 3.72k, False: 5.74k] | | ------------------ ------------------ 1045| 3.72k| if (IS_MULTILINE(reg->options)) ------------------ | | 395| 3.72k|#define IS_MULTILINE(option) ((option) & ONIG_OPTION_MULTILINE) | | ------------------ | | | | 456| 3.72k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | ------------------ | | | | | | 455| 3.72k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | ------------------ | | | | | | | | 454| 3.72k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (395:35): [True: 0, False: 3.72k] | | ------------------ ------------------ 1046| 0| r = add_opcode(reg, OP_ANYCHAR_ML_STAR_PEEK_NEXT); 1047| 3.72k| else 1048| 3.72k| r = add_opcode(reg, OP_ANYCHAR_STAR_PEEK_NEXT); 1049| 3.72k| if (r) return r; ------------------ | Branch (1049:11): [True: 0, False: 3.72k] ------------------ 1050| 3.72k| return add_bytes(reg, NSTR(qn->next_head_exact)->s, 1); ------------------ | | 76| 3.72k|#define NSTR(node) (&((node)->u.str)) ------------------ 1051| 3.72k| } 1052| 5.74k| else { 1053| 5.74k| if (IS_MULTILINE(reg->options)) ------------------ | | 395| 5.74k|#define IS_MULTILINE(option) ((option) & ONIG_OPTION_MULTILINE) | | ------------------ | | | | 456| 5.74k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | ------------------ | | | | | | 455| 5.74k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | ------------------ | | | | | | | | 454| 5.74k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (395:35): [True: 0, False: 5.74k] | | ------------------ ------------------ 1054| 0| return add_opcode(reg, OP_ANYCHAR_ML_STAR); 1055| 5.74k| else 1056| 5.74k| return add_opcode(reg, OP_ANYCHAR_STAR); 1057| 5.74k| } 1058| 9.47k| } 1059| | 1060| 23.1k| if (empty_info != 0) ------------------ | Branch (1060:7): [True: 0, False: 23.1k] ------------------ 1061| 0| mod_tlen = tlen + (SIZE_OP_NULL_CHECK_START + SIZE_OP_NULL_CHECK_END); ------------------ | | 742| 0|#define SIZE_OP_NULL_CHECK_START (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_NULL_CHECK_START (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ mod_tlen = tlen + (SIZE_OP_NULL_CHECK_START + SIZE_OP_NULL_CHECK_END); ------------------ | | 743| 0|#define SIZE_OP_NULL_CHECK_END (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_NULL_CHECK_END (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ 1062| 23.1k| else 1063| 23.1k| mod_tlen = tlen; 1064| | 1065| 23.1k| if (infinite && ------------------ | Branch (1065:7): [True: 21.1k, False: 1.96k] ------------------ 1066| 23.1k| (qn->lower <= 1 || tlen * qn->lower <= QUANTIFIER_EXPAND_LIMIT_SIZE)) { ------------------ | | 724| 0|#define QUANTIFIER_EXPAND_LIMIT_SIZE 50 ------------------ | Branch (1066:8): [True: 21.1k, False: 0] | Branch (1066:26): [True: 0, False: 0] ------------------ 1067| 21.1k| if (qn->lower == 1 && tlen > QUANTIFIER_EXPAND_LIMIT_SIZE) { ------------------ | | 724| 9.57k|#define QUANTIFIER_EXPAND_LIMIT_SIZE 50 ------------------ | Branch (1067:9): [True: 9.57k, False: 11.5k] | Branch (1067:27): [True: 0, False: 9.57k] ------------------ 1068| 0| if (qn->greedy) { ------------------ | Branch (1068:11): [True: 0, False: 0] ------------------ 1069| |#ifdef USE_OP_PUSH_OR_JUMP_EXACT 1070| | if (IS_NOT_NULL(qn->head_exact)) 1071| | r = add_opcode_rel_addr(reg, OP_JUMP, SIZE_OP_PUSH_OR_JUMP_EXACT1); 1072| | else 1073| |#endif 1074| 0| if (IS_NOT_NULL(qn->next_head_exact)) ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ 1075| 0| r = add_opcode_rel_addr(reg, OP_JUMP, SIZE_OP_PUSH_IF_PEEK_NEXT); ------------------ | | 724| 0|#define SIZE_OP_PUSH_IF_PEEK_NEXT (SIZE_OPCODE + SIZE_RELADDR + 1) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH_IF_PEEK_NEXT (SIZE_OPCODE + SIZE_RELADDR + 1) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1076| 0| else 1077| 0| r = add_opcode_rel_addr(reg, OP_JUMP, SIZE_OP_PUSH); ------------------ | | 721| 0|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1078| 0| } 1079| 0| else { 1080| 0| r = add_opcode_rel_addr(reg, OP_JUMP, SIZE_OP_JUMP); ------------------ | | 720| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1081| 0| } 1082| 0| if (r) return r; ------------------ | Branch (1082:11): [True: 0, False: 0] ------------------ 1083| 0| } 1084| 21.1k| else { 1085| 21.1k| r = compile_tree_n_times(qn->target, qn->lower, reg); 1086| 21.1k| if (r) return r; ------------------ | Branch (1086:11): [True: 0, False: 21.1k] ------------------ 1087| 21.1k| } 1088| | 1089| 21.1k| if (qn->greedy) { ------------------ | Branch (1089:9): [True: 19.1k, False: 2.01k] ------------------ 1090| |#ifdef USE_OP_PUSH_OR_JUMP_EXACT 1091| | if (IS_NOT_NULL(qn->head_exact)) { 1092| | r = add_opcode_rel_addr(reg, OP_PUSH_OR_JUMP_EXACT1, 1093| | mod_tlen + SIZE_OP_JUMP); 1094| | if (r) return r; 1095| | add_bytes(reg, NSTR(qn->head_exact)->s, 1); 1096| | r = compile_tree_empty_check(qn->target, reg, empty_info); 1097| | if (r) return r; 1098| | r = add_opcode_rel_addr(reg, OP_JUMP, 1099| | -(mod_tlen + (int )SIZE_OP_JUMP + (int )SIZE_OP_PUSH_OR_JUMP_EXACT1)); 1100| | } 1101| | else 1102| |#endif 1103| 19.1k| if (IS_NOT_NULL(qn->next_head_exact)) { ------------------ | | 312| 19.1k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 19.1k] | | ------------------ ------------------ 1104| 0| r = add_opcode_rel_addr(reg, OP_PUSH_IF_PEEK_NEXT, 1105| 0| mod_tlen + SIZE_OP_JUMP); ------------------ | | 720| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1106| 0| if (r) return r; ------------------ | Branch (1106:6): [True: 0, False: 0] ------------------ 1107| 0| add_bytes(reg, NSTR(qn->next_head_exact)->s, 1); ------------------ | | 76| 0|#define NSTR(node) (&((node)->u.str)) ------------------ 1108| 0| r = compile_tree_empty_check(qn->target, reg, empty_info); 1109| 0| if (r) return r; ------------------ | Branch (1109:6): [True: 0, False: 0] ------------------ 1110| 0| r = add_opcode_rel_addr(reg, OP_JUMP, 1111| 0| -(mod_tlen + (int )SIZE_OP_JUMP + (int )SIZE_OP_PUSH_IF_PEEK_NEXT)); ------------------ | | 720| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ -(mod_tlen + (int )SIZE_OP_JUMP + (int )SIZE_OP_PUSH_IF_PEEK_NEXT)); ------------------ | | 724| 0|#define SIZE_OP_PUSH_IF_PEEK_NEXT (SIZE_OPCODE + SIZE_RELADDR + 1) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH_IF_PEEK_NEXT (SIZE_OPCODE + SIZE_RELADDR + 1) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1112| 0| } 1113| 19.1k| else { 1114| 19.1k| r = add_opcode_rel_addr(reg, OP_PUSH, mod_tlen + SIZE_OP_JUMP); ------------------ | | 720| 19.1k|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 19.1k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 19.1k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1115| 19.1k| if (r) return r; ------------------ | Branch (1115:6): [True: 0, False: 19.1k] ------------------ 1116| 19.1k| r = compile_tree_empty_check(qn->target, reg, empty_info); 1117| 19.1k| if (r) return r; ------------------ | Branch (1117:6): [True: 0, False: 19.1k] ------------------ 1118| 19.1k| r = add_opcode_rel_addr(reg, OP_JUMP, 1119| 19.1k| -(mod_tlen + (int )SIZE_OP_JUMP + (int )SIZE_OP_PUSH)); ------------------ | | 720| 19.1k|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 19.1k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 19.1k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ -(mod_tlen + (int )SIZE_OP_JUMP + (int )SIZE_OP_PUSH)); ------------------ | | 721| 19.1k|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 19.1k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 19.1k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1120| 19.1k| } 1121| 19.1k| } 1122| 2.01k| else { 1123| 2.01k| r = add_opcode_rel_addr(reg, OP_JUMP, mod_tlen); 1124| 2.01k| if (r) return r; ------------------ | Branch (1124:11): [True: 0, False: 2.01k] ------------------ 1125| 2.01k| r = compile_tree_empty_check(qn->target, reg, empty_info); 1126| 2.01k| if (r) return r; ------------------ | Branch (1126:11): [True: 0, False: 2.01k] ------------------ 1127| 2.01k| r = add_opcode_rel_addr(reg, OP_PUSH, -(mod_tlen + (int )SIZE_OP_PUSH)); ------------------ | | 721| 2.01k|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 2.01k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 2.01k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1128| 2.01k| } 1129| 21.1k| } 1130| 1.96k| else if (qn->upper == 0 && qn->is_referred != 0) { /* /(?..){0}/ */ ------------------ | Branch (1130:12): [True: 0, False: 1.96k] | Branch (1130:30): [True: 0, False: 0] ------------------ 1131| 0| r = add_opcode_rel_addr(reg, OP_JUMP, tlen); 1132| 0| if (r) return r; ------------------ | Branch (1132:9): [True: 0, False: 0] ------------------ 1133| 0| r = compile_tree(qn->target, reg); 1134| 0| } 1135| 1.96k| else if (!infinite && qn->greedy && ------------------ | Branch (1135:12): [True: 1.96k, False: 0] | Branch (1135:25): [True: 1.96k, False: 0] ------------------ 1136| 1.96k| (qn->upper == 1 || (tlen + SIZE_OP_PUSH) * qn->upper ------------------ | | 721| 0|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ | Branch (1136:13): [True: 1.96k, False: 0] | Branch (1136:31): [True: 0, False: 0] ------------------ 1137| 1.96k| <= QUANTIFIER_EXPAND_LIMIT_SIZE)) { ------------------ | | 724| 0|#define QUANTIFIER_EXPAND_LIMIT_SIZE 50 ------------------ 1138| 1.96k| int n = qn->upper - qn->lower; 1139| | 1140| 1.96k| r = compile_tree_n_times(qn->target, qn->lower, reg); 1141| 1.96k| if (r) return r; ------------------ | Branch (1141:9): [True: 0, False: 1.96k] ------------------ 1142| | 1143| 3.93k| for (i = 0; i < n; i++) { ------------------ | Branch (1143:17): [True: 1.96k, False: 1.96k] ------------------ 1144| 1.96k| r = add_opcode_rel_addr(reg, OP_PUSH, 1145| 1.96k| (n - i) * tlen + (n - i - 1) * SIZE_OP_PUSH); ------------------ | | 721| 1.96k|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 1.96k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 1.96k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1146| 1.96k| if (r) return r; ------------------ | Branch (1146:11): [True: 0, False: 1.96k] ------------------ 1147| 1.96k| r = compile_tree(qn->target, reg); 1148| 1.96k| if (r) return r; ------------------ | Branch (1148:11): [True: 0, False: 1.96k] ------------------ 1149| 1.96k| } 1150| 1.96k| } 1151| 0| else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */ ------------------ | Branch (1151:12): [True: 0, False: 0] | Branch (1151:27): [True: 0, False: 0] | Branch (1151:45): [True: 0, False: 0] ------------------ 1152| 0| r = add_opcode_rel_addr(reg, OP_PUSH, SIZE_OP_JUMP); ------------------ | | 720| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1153| 0| if (r) return r; ------------------ | Branch (1153:9): [True: 0, False: 0] ------------------ 1154| 0| r = add_opcode_rel_addr(reg, OP_JUMP, tlen); 1155| 0| if (r) return r; ------------------ | Branch (1155:9): [True: 0, False: 0] ------------------ 1156| 0| r = compile_tree(qn->target, reg); 1157| 0| } 1158| 0| else { 1159| 0| r = compile_range_repeat_node(qn, mod_tlen, empty_info, reg); 1160| 0| } 1161| 23.1k| return r; 1162| 23.1k|} regcomp.c:is_anychar_star_quantifier: 716| 32.6k|{ 717| 32.6k| if (qn->greedy && IS_REPEAT_INFINITE(qn->upper) && ------------------ | | 422| 63.1k|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 421| 30.5k|#define REPEAT_INFINITE -1 | | ------------------ | | | Branch (422:33): [True: 28.6k, False: 1.96k] | | ------------------ ------------------ | Branch (717:7): [True: 30.5k, False: 2.01k] ------------------ 718| 32.6k| NTYPE(qn->target) == NT_CANY) ------------------ | | 69| 28.6k|#define NTYPE(node) ((node)->u.base.type) ------------------ NTYPE(qn->target) == NT_CANY) ------------------ | | 41| 28.6k|#define NT_CANY 3 ------------------ | Branch (718:7): [True: 9.47k, False: 19.1k] ------------------ 719| 9.47k| return 1; 720| 23.1k| else 721| 23.1k| return 0; 722| 32.6k|} regcomp.c:compile_tree_n_times: 414| 57.1k|{ 415| 57.1k| int i, r; 416| | 417| 91.1k| for (i = 0; i < n; i++) { ------------------ | Branch (417:15): [True: 34.0k, False: 57.1k] ------------------ 418| 34.0k| r = compile_tree(node, reg); 419| 34.0k| if (r) return r; ------------------ | Branch (419:9): [True: 0, False: 34.0k] ------------------ 420| 34.0k| } 421| 57.1k| return 0; 422| 57.1k|} regcomp.c:compile_tree_empty_check: 367| 21.1k|{ 368| 21.1k| int r; 369| 21.1k| int saved_num_null_check = reg->num_null_check; 370| | 371| 21.1k| if (empty_info != 0) { ------------------ | Branch (371:7): [True: 0, False: 21.1k] ------------------ 372| 0| r = add_opcode(reg, OP_NULL_CHECK_START); 373| 0| if (r) return r; ------------------ | Branch (373:9): [True: 0, False: 0] ------------------ 374| 0| r = add_mem_num(reg, reg->num_null_check); /* NULL CHECK ID */ 375| 0| if (r) return r; ------------------ | Branch (375:9): [True: 0, False: 0] ------------------ 376| 0| reg->num_null_check++; 377| 0| } 378| | 379| 21.1k| r = compile_tree(node, reg); 380| 21.1k| if (r) return r; ------------------ | Branch (380:7): [True: 0, False: 21.1k] ------------------ 381| | 382| 21.1k| if (empty_info != 0) { ------------------ | Branch (382:7): [True: 0, False: 21.1k] ------------------ 383| 0| if (empty_info == NQ_TARGET_IS_EMPTY) ------------------ | | 123| 0|#define NQ_TARGET_IS_EMPTY 1 ------------------ | Branch (383:9): [True: 0, False: 0] ------------------ 384| 0| r = add_opcode(reg, OP_NULL_CHECK_END); 385| 0| else if (empty_info == NQ_TARGET_IS_EMPTY_MEM) ------------------ | | 124| 0|#define NQ_TARGET_IS_EMPTY_MEM 2 ------------------ | Branch (385:14): [True: 0, False: 0] ------------------ 386| 0| r = add_opcode(reg, OP_NULL_CHECK_END_MEMST); 387| 0| else if (empty_info == NQ_TARGET_IS_EMPTY_REC) ------------------ | | 125| 0|#define NQ_TARGET_IS_EMPTY_REC 3 ------------------ | Branch (387:14): [True: 0, False: 0] ------------------ 388| 0| r = add_opcode(reg, OP_NULL_CHECK_END_MEMST_PUSH); 389| | 390| 0| if (r) return r; ------------------ | Branch (390:9): [True: 0, False: 0] ------------------ 391| 0| r = add_mem_num(reg, saved_num_null_check); /* NULL CHECK ID */ 392| 0| } 393| 21.1k| return r; 394| 21.1k|} regcomp.c:compile_enclose_node: 1308| 36.5k|{ 1309| 36.5k| int r, len; 1310| | 1311| 36.5k| if (node->type == ENCLOSE_OPTION) ------------------ | | 95| 36.5k|#define ENCLOSE_OPTION (1<<1) ------------------ | Branch (1311:7): [True: 1.95k, False: 34.6k] ------------------ 1312| 1.95k| return compile_option_node(node, reg); 1313| | 1314| 34.6k| switch (node->type) { 1315| 10.0k| case ENCLOSE_MEMORY: ------------------ | | 94| 10.0k|#define ENCLOSE_MEMORY (1<<0) ------------------ | Branch (1315:3): [True: 10.0k, False: 24.5k] ------------------ 1316| 10.0k|#ifdef USE_SUBEXP_CALL 1317| 10.0k| if (IS_ENCLOSE_CALLED(node)) { ------------------ | | 147| 10.0k|#define IS_ENCLOSE_CALLED(en) (((en)->state & NST_CALLED) != 0) | | ------------------ | | | | 136| 10.0k|#define NST_CALLED (1<<8) | | ------------------ | | | Branch (147:40): [True: 0, False: 10.0k] | | ------------------ ------------------ 1318| 0| r = add_opcode(reg, OP_CALL); 1319| 0| if (r) return r; ------------------ | Branch (1319:11): [True: 0, False: 0] ------------------ 1320| 0| node->call_addr = BBUF_GET_OFFSET_POS(reg) + SIZE_ABSADDR + SIZE_OP_JUMP; ------------------ | | 507| 0|#define BBUF_GET_OFFSET_POS(buf) ((buf)->used) ------------------ node->call_addr = BBUF_GET_OFFSET_POS(reg) + SIZE_ABSADDR + SIZE_OP_JUMP; ------------------ | | 690| 0|#define SIZE_ABSADDR (int )sizeof(AbsAddrType) ------------------ node->call_addr = BBUF_GET_OFFSET_POS(reg) + SIZE_ABSADDR + SIZE_OP_JUMP; ------------------ | | 720| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1321| 0| node->state |= NST_ADDR_FIXED; ------------------ | | 137| 0|#define NST_ADDR_FIXED (1<<9) ------------------ 1322| 0| r = add_abs_addr(reg, (int )node->call_addr); 1323| 0| if (r) return r; ------------------ | Branch (1323:11): [True: 0, False: 0] ------------------ 1324| 0| len = compile_length_tree(node->target, reg); 1325| 0| len += (SIZE_OP_MEMORY_START_PUSH + SIZE_OP_RETURN); ------------------ | | 735| 0|#define SIZE_OP_MEMORY_START_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_START_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ len += (SIZE_OP_MEMORY_START_PUSH + SIZE_OP_RETURN); ------------------ | | 748| 0|#define SIZE_OP_RETURN SIZE_OPCODE | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ 1326| 0| if (BIT_STATUS_AT(reg->bt_mem_end, node->regnum)) ------------------ | | 371| 0| ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1)) | | ------------------ | | | | 367| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (371:3): [True: 0, False: 0] | | | Branch (371:4): [True: 0, False: 0] | | ------------------ ------------------ 1327| 0| len += (IS_ENCLOSE_RECURSION(node) ------------------ | | 149| 0|#define IS_ENCLOSE_RECURSION(en) (((en)->state & NST_RECURSION) != 0) | | ------------------ | | | | 135| 0|#define NST_RECURSION (1<<7) | | ------------------ | | | Branch (149:40): [True: 0, False: 0] | | ------------------ ------------------ 1328| 0| ? SIZE_OP_MEMORY_END_PUSH_REC : SIZE_OP_MEMORY_END_PUSH); ------------------ | | 737| 0|#define SIZE_OP_MEMORY_END_PUSH_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END_PUSH_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ ? SIZE_OP_MEMORY_END_PUSH_REC : SIZE_OP_MEMORY_END_PUSH); ------------------ | | 736| 0|#define SIZE_OP_MEMORY_END_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ 1329| 0| else 1330| 0| len += (IS_ENCLOSE_RECURSION(node) ------------------ | | 149| 0|#define IS_ENCLOSE_RECURSION(en) (((en)->state & NST_RECURSION) != 0) | | ------------------ | | | | 135| 0|#define NST_RECURSION (1<<7) | | ------------------ | | | Branch (149:40): [True: 0, False: 0] | | ------------------ ------------------ 1331| 0| ? SIZE_OP_MEMORY_END_REC : SIZE_OP_MEMORY_END); ------------------ | | 739| 0|#define SIZE_OP_MEMORY_END_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ ? SIZE_OP_MEMORY_END_REC : SIZE_OP_MEMORY_END); ------------------ | | 738| 0|#define SIZE_OP_MEMORY_END (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 692| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ 1332| | 1333| 0| r = add_opcode_rel_addr(reg, OP_JUMP, len); 1334| 0| if (r) return r; ------------------ | Branch (1334:11): [True: 0, False: 0] ------------------ 1335| 0| } 1336| 10.0k|#endif 1337| 10.0k| if (BIT_STATUS_AT(reg->bt_mem_start, node->regnum)) ------------------ | | 371| 10.0k| ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1)) | | ------------------ | | | | 367| 10.0k|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (371:3): [True: 0, False: 10.0k] | | | Branch (371:4): [True: 10.0k, False: 0] | | ------------------ ------------------ 1338| 0| r = add_opcode(reg, OP_MEMORY_START_PUSH); 1339| 10.0k| else 1340| 10.0k| r = add_opcode(reg, OP_MEMORY_START); 1341| 10.0k| if (r) return r; ------------------ | Branch (1341:9): [True: 0, False: 10.0k] ------------------ 1342| 10.0k| r = add_mem_num(reg, node->regnum); 1343| 10.0k| if (r) return r; ------------------ | Branch (1343:9): [True: 0, False: 10.0k] ------------------ 1344| 10.0k| r = compile_tree(node->target, reg); 1345| 10.0k| if (r) return r; ------------------ | Branch (1345:9): [True: 0, False: 10.0k] ------------------ 1346| 10.0k|#ifdef USE_SUBEXP_CALL 1347| 10.0k| if (IS_ENCLOSE_CALLED(node)) { ------------------ | | 147| 10.0k|#define IS_ENCLOSE_CALLED(en) (((en)->state & NST_CALLED) != 0) | | ------------------ | | | | 136| 10.0k|#define NST_CALLED (1<<8) | | ------------------ | | | Branch (147:40): [True: 0, False: 10.0k] | | ------------------ ------------------ 1348| 0| if (BIT_STATUS_AT(reg->bt_mem_end, node->regnum)) ------------------ | | 371| 0| ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1)) | | ------------------ | | | | 367| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (371:3): [True: 0, False: 0] | | | Branch (371:4): [True: 0, False: 0] | | ------------------ ------------------ 1349| 0| r = add_opcode(reg, (IS_ENCLOSE_RECURSION(node) ------------------ | | 149| 0|#define IS_ENCLOSE_RECURSION(en) (((en)->state & NST_RECURSION) != 0) | | ------------------ | | | | 135| 0|#define NST_RECURSION (1<<7) | | ------------------ | | | Branch (149:40): [True: 0, False: 0] | | ------------------ ------------------ 1350| 0| ? OP_MEMORY_END_PUSH_REC : OP_MEMORY_END_PUSH)); 1351| 0| else 1352| 0| r = add_opcode(reg, (IS_ENCLOSE_RECURSION(node) ------------------ | | 149| 0|#define IS_ENCLOSE_RECURSION(en) (((en)->state & NST_RECURSION) != 0) | | ------------------ | | | | 135| 0|#define NST_RECURSION (1<<7) | | ------------------ | | | Branch (149:40): [True: 0, False: 0] | | ------------------ ------------------ 1353| 0| ? OP_MEMORY_END_REC : OP_MEMORY_END)); 1354| | 1355| 0| if (r) return r; ------------------ | Branch (1355:11): [True: 0, False: 0] ------------------ 1356| 0| r = add_mem_num(reg, node->regnum); 1357| 0| if (r) return r; ------------------ | Branch (1357:11): [True: 0, False: 0] ------------------ 1358| 0| r = add_opcode(reg, OP_RETURN); 1359| 0| } 1360| 10.0k| else if (IS_ENCLOSE_RECURSION(node)) { ------------------ | | 149| 10.0k|#define IS_ENCLOSE_RECURSION(en) (((en)->state & NST_RECURSION) != 0) | | ------------------ | | | | 135| 10.0k|#define NST_RECURSION (1<<7) | | ------------------ | | | Branch (149:40): [True: 0, False: 10.0k] | | ------------------ ------------------ 1361| 0| if (BIT_STATUS_AT(reg->bt_mem_end, node->regnum)) ------------------ | | 371| 0| ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1)) | | ------------------ | | | | 367| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (371:3): [True: 0, False: 0] | | | Branch (371:4): [True: 0, False: 0] | | ------------------ ------------------ 1362| 0| r = add_opcode(reg, OP_MEMORY_END_PUSH_REC); 1363| 0| else 1364| 0| r = add_opcode(reg, OP_MEMORY_END_REC); 1365| 0| if (r) return r; ------------------ | Branch (1365:11): [True: 0, False: 0] ------------------ 1366| 0| r = add_mem_num(reg, node->regnum); 1367| 0| } 1368| 10.0k| else 1369| 10.0k|#endif 1370| 10.0k| { 1371| 10.0k| if (BIT_STATUS_AT(reg->bt_mem_end, node->regnum)) ------------------ | | 371| 10.0k| ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1)) | | ------------------ | | | | 367| 10.0k|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (371:3): [True: 0, False: 10.0k] | | | Branch (371:4): [True: 10.0k, False: 0] | | ------------------ ------------------ 1372| 0| r = add_opcode(reg, OP_MEMORY_END_PUSH); 1373| 10.0k| else 1374| 10.0k| r = add_opcode(reg, OP_MEMORY_END); 1375| 10.0k| if (r) return r; ------------------ | Branch (1375:11): [True: 0, False: 10.0k] ------------------ 1376| 10.0k| r = add_mem_num(reg, node->regnum); 1377| 10.0k| } 1378| 10.0k| break; 1379| | 1380| 24.5k| case ENCLOSE_STOP_BACKTRACK: ------------------ | | 96| 24.5k|#define ENCLOSE_STOP_BACKTRACK (1<<2) ------------------ | Branch (1380:3): [True: 24.5k, False: 10.0k] ------------------ 1381| 24.5k| if (IS_ENCLOSE_STOP_BT_SIMPLE_REPEAT(node)) { ------------------ | | 156| 24.5k| (((en)->state & NST_STOP_BT_SIMPLE_REPEAT) != 0) | | ------------------ | | | | 134| 24.5k|#define NST_STOP_BT_SIMPLE_REPEAT (1<<6) | | ------------------ | | | Branch (156:5): [True: 24.5k, False: 0] | | ------------------ ------------------ 1382| 24.5k| QtfrNode* qn = NQTFR(node->target); ------------------ | | 80| 24.5k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1383| 24.5k| r = compile_tree_n_times(qn->target, qn->lower, reg); 1384| 24.5k| if (r) return r; ------------------ | Branch (1384:11): [True: 0, False: 24.5k] ------------------ 1385| | 1386| 24.5k| len = compile_length_tree(qn->target, reg); 1387| 24.5k| if (len < 0) return len; ------------------ | Branch (1387:11): [True: 0, False: 24.5k] ------------------ 1388| | 1389| 24.5k| r = add_opcode_rel_addr(reg, OP_PUSH, len + SIZE_OP_POP + SIZE_OP_JUMP); ------------------ | | 722| 24.5k|#define SIZE_OP_POP SIZE_OPCODE | | ------------------ | | | | 688| 24.5k|#define SIZE_OPCODE 1 | | ------------------ ------------------ r = add_opcode_rel_addr(reg, OP_PUSH, len + SIZE_OP_POP + SIZE_OP_JUMP); ------------------ | | 720| 24.5k|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 24.5k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 24.5k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1390| 24.5k| if (r) return r; ------------------ | Branch (1390:11): [True: 0, False: 24.5k] ------------------ 1391| 24.5k| r = compile_tree(qn->target, reg); 1392| 24.5k| if (r) return r; ------------------ | Branch (1392:11): [True: 0, False: 24.5k] ------------------ 1393| 24.5k| r = add_opcode(reg, OP_POP); 1394| 24.5k| if (r) return r; ------------------ | Branch (1394:11): [True: 0, False: 24.5k] ------------------ 1395| 24.5k| r = add_opcode_rel_addr(reg, OP_JUMP, 1396| 24.5k| -((int )SIZE_OP_PUSH + len + (int )SIZE_OP_POP + (int )SIZE_OP_JUMP)); ------------------ | | 721| 24.5k|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 24.5k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 24.5k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ -((int )SIZE_OP_PUSH + len + (int )SIZE_OP_POP + (int )SIZE_OP_JUMP)); ------------------ | | 722| 24.5k|#define SIZE_OP_POP SIZE_OPCODE | | ------------------ | | | | 688| 24.5k|#define SIZE_OPCODE 1 | | ------------------ ------------------ -((int )SIZE_OP_PUSH + len + (int )SIZE_OP_POP + (int )SIZE_OP_JUMP)); ------------------ | | 720| 24.5k|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 24.5k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 24.5k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1397| 24.5k| } 1398| 0| else { 1399| 0| r = add_opcode(reg, OP_PUSH_STOP_BT); 1400| 0| if (r) return r; ------------------ | Branch (1400:11): [True: 0, False: 0] ------------------ 1401| 0| r = compile_tree(node->target, reg); 1402| 0| if (r) return r; ------------------ | Branch (1402:11): [True: 0, False: 0] ------------------ 1403| 0| r = add_opcode(reg, OP_POP_STOP_BT); 1404| 0| } 1405| 24.5k| break; 1406| | 1407| 24.5k| case ENCLOSE_CONDITION: ------------------ | | 97| 0|#define ENCLOSE_CONDITION (1<<3) ------------------ | Branch (1407:3): [True: 0, False: 34.6k] ------------------ 1408| 0| r = add_opcode(reg, OP_CONDITION); 1409| 0| if (r) return r; ------------------ | Branch (1409:9): [True: 0, False: 0] ------------------ 1410| 0| r = add_mem_num(reg, node->regnum); 1411| 0| if (r) return r; ------------------ | Branch (1411:9): [True: 0, False: 0] ------------------ 1412| | 1413| 0| if (NTYPE(node->target) == NT_ALT) { ------------------ | | 69| 0|#define NTYPE(node) ((node)->u.base.type) ------------------ if (NTYPE(node->target) == NT_ALT) { ------------------ | | 47| 0|#define NT_ALT 9 ------------------ | Branch (1413:9): [True: 0, False: 0] ------------------ 1414| 0| Node* x = node->target; 1415| 0| int len2; 1416| | 1417| 0| len = compile_length_tree(NCAR(x), reg); /* yes-node */ ------------------ | | 86| 0|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1418| 0| if (len < 0) return len; ------------------ | Branch (1418:11): [True: 0, False: 0] ------------------ 1419| 0| if (NCDR(x) == NULL) return ONIGERR_PARSER_BUG; ------------------ | | 87| 0|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ if (NCDR(x) == NULL) return ONIGERR_PARSER_BUG; ------------------ | | 634| 0|#define ONIGERR_PARSER_BUG -11 ------------------ | Branch (1419:11): [True: 0, False: 0] ------------------ 1420| 0| x = NCDR(x); ------------------ | | 87| 0|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1421| 0| len2 = compile_length_tree(NCAR(x), reg); /* no-node */ ------------------ | | 86| 0|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1422| 0| if (len2 < 0) return len2; ------------------ | Branch (1422:11): [True: 0, False: 0] ------------------ 1423| 0| if (NCDR(x) != NULL) return ONIGERR_INVALID_CONDITION_PATTERN; ------------------ | | 87| 0|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ if (NCDR(x) != NULL) return ONIGERR_INVALID_CONDITION_PATTERN; ------------------ | | 667| 0|#define ONIGERR_INVALID_CONDITION_PATTERN -124 ------------------ | Branch (1423:11): [True: 0, False: 0] ------------------ 1424| | 1425| 0| x = node->target; 1426| 0| r = add_rel_addr(reg, len + SIZE_OP_JUMP); ------------------ | | 720| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 689| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1427| 0| if (r) return r; ------------------ | Branch (1427:11): [True: 0, False: 0] ------------------ 1428| 0| r = compile_tree(NCAR(x), reg); /* yes-node */ ------------------ | | 86| 0|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1429| 0| if (r) return r; ------------------ | Branch (1429:11): [True: 0, False: 0] ------------------ 1430| 0| r = add_opcode_rel_addr(reg, OP_JUMP, len2); 1431| 0| if (r) return r; ------------------ | Branch (1431:11): [True: 0, False: 0] ------------------ 1432| 0| x = NCDR(x); ------------------ | | 87| 0|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1433| 0| r = compile_tree(NCAR(x), reg); /* no-node */ ------------------ | | 86| 0|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1434| 0| } 1435| 0| else { 1436| 0| return ONIGERR_PARSER_BUG; ------------------ | | 634| 0|#define ONIGERR_PARSER_BUG -11 ------------------ 1437| 0| } 1438| 0| break; 1439| | 1440| 0| case ENCLOSE_ABSENT: ------------------ | | 98| 0|#define ENCLOSE_ABSENT (1<<4) ------------------ | Branch (1440:3): [True: 0, False: 34.6k] ------------------ 1441| 0| len = compile_length_tree(node->target, reg); 1442| 0| if (len < 0) return len; ------------------ | Branch (1442:9): [True: 0, False: 0] ------------------ 1443| | 1444| 0| r = add_opcode(reg, OP_PUSH_ABSENT_POS); 1445| 0| if (r) return r; ------------------ | Branch (1445:9): [True: 0, False: 0] ------------------ 1446| 0| r = add_opcode_rel_addr(reg, OP_ABSENT, len + SIZE_OP_ABSENT_END); ------------------ | | 752| 0|#define SIZE_OP_ABSENT_END SIZE_OPCODE | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ 1447| 0| if (r) return r; ------------------ | Branch (1447:9): [True: 0, False: 0] ------------------ 1448| 0| r = compile_tree(node->target, reg); 1449| 0| if (r) return r; ------------------ | Branch (1449:9): [True: 0, False: 0] ------------------ 1450| 0| r = add_opcode(reg, OP_ABSENT_END); 1451| 0| break; 1452| | 1453| 0| default: ------------------ | Branch (1453:3): [True: 0, False: 34.6k] ------------------ 1454| 0| return ONIGERR_TYPE_BUG; ------------------ | | 633| 0|#define ONIGERR_TYPE_BUG -6 ------------------ 1455| 0| break; 1456| 34.6k| } 1457| | 1458| 34.6k| return r; 1459| 34.6k|} regcomp.c:compile_option_node: 1187| 1.95k|{ 1188| 1.95k| int r; 1189| 1.95k| OnigOptionType prev = reg->options; 1190| | 1191| 1.95k| if (IS_DYNAMIC_OPTION(prev ^ node->option)) { ------------------ | | 416| 1.95k|#define IS_DYNAMIC_OPTION(option) 0 | | ------------------ | | | Branch (416:36): [Folded - Ignored] | | ------------------ ------------------ 1192| 0| r = add_opcode_option(reg, OP_SET_OPTION_PUSH, node->option); 1193| 0| if (r) return r; ------------------ | Branch (1193:9): [True: 0, False: 0] ------------------ 1194| 0| r = add_opcode_option(reg, OP_SET_OPTION, prev); 1195| 0| if (r) return r; ------------------ | Branch (1195:9): [True: 0, False: 0] ------------------ 1196| 0| r = add_opcode(reg, OP_FAIL); 1197| 0| if (r) return r; ------------------ | Branch (1197:9): [True: 0, False: 0] ------------------ 1198| 0| } 1199| | 1200| 1.95k| reg->options = node->option; 1201| 1.95k| r = compile_tree(node->target, reg); 1202| 1.95k| reg->options = prev; 1203| | 1204| 1.95k| if (IS_DYNAMIC_OPTION(prev ^ node->option)) { ------------------ | | 416| 1.95k|#define IS_DYNAMIC_OPTION(option) 0 | | ------------------ | | | Branch (416:36): [Folded - Ignored] | | ------------------ ------------------ 1205| 0| if (r) return r; ------------------ | Branch (1205:9): [True: 0, False: 0] ------------------ 1206| 0| r = add_opcode_option(reg, OP_SET_OPTION, prev); 1207| 0| } 1208| 1.95k| return r; 1209| 1.95k|} regcomp.c:compile_anchor_node: 1496| 55.6k|{ 1497| 55.6k| int r, len; 1498| | 1499| 55.6k| switch (node->type) { 1500| 0| case ANCHOR_BEGIN_BUF: r = add_opcode(reg, OP_BEGIN_BUF); break; ------------------ | | 540| 0|#define ANCHOR_BEGIN_BUF (1<<0) ------------------ | Branch (1500:3): [True: 0, False: 55.6k] ------------------ 1501| 0| case ANCHOR_END_BUF: r = add_opcode(reg, OP_END_BUF); break; ------------------ | | 543| 0|#define ANCHOR_END_BUF (1<<3) ------------------ | Branch (1501:3): [True: 0, False: 55.6k] ------------------ 1502| 38.2k| case ANCHOR_BEGIN_LINE: r = add_opcode(reg, OP_BEGIN_LINE); break; ------------------ | | 541| 38.2k|#define ANCHOR_BEGIN_LINE (1<<1) ------------------ | Branch (1502:3): [True: 38.2k, False: 17.3k] ------------------ 1503| 15.4k| case ANCHOR_END_LINE: r = add_opcode(reg, OP_END_LINE); break; ------------------ | | 545| 15.4k|#define ANCHOR_END_LINE (1<<5) ------------------ | Branch (1503:3): [True: 15.4k, False: 40.1k] ------------------ 1504| 0| case ANCHOR_SEMI_END_BUF: r = add_opcode(reg, OP_SEMI_END_BUF); break; ------------------ | | 544| 0|#define ANCHOR_SEMI_END_BUF (1<<4) ------------------ | Branch (1504:3): [True: 0, False: 55.6k] ------------------ 1505| 0| case ANCHOR_BEGIN_POSITION: r = add_opcode(reg, OP_BEGIN_POSITION); break; ------------------ | | 542| 0|#define ANCHOR_BEGIN_POSITION (1<<2) ------------------ | Branch (1505:3): [True: 0, False: 55.6k] ------------------ 1506| | 1507| 1.91k| case ANCHOR_WORD_BOUND: ------------------ | | 547| 1.91k|#define ANCHOR_WORD_BOUND (1<<6) ------------------ | Branch (1507:3): [True: 1.91k, False: 53.7k] ------------------ 1508| 1.91k| if (node->ascii_range) r = add_opcode(reg, OP_ASCII_WORD_BOUND); ------------------ | Branch (1508:9): [True: 0, False: 1.91k] ------------------ 1509| 1.91k| else r = add_opcode(reg, OP_WORD_BOUND); 1510| 1.91k| break; 1511| 0| case ANCHOR_NOT_WORD_BOUND: ------------------ | | 548| 0|#define ANCHOR_NOT_WORD_BOUND (1<<7) ------------------ | Branch (1511:3): [True: 0, False: 55.6k] ------------------ 1512| 0| if (node->ascii_range) r = add_opcode(reg, OP_NOT_ASCII_WORD_BOUND); ------------------ | Branch (1512:9): [True: 0, False: 0] ------------------ 1513| 0| else r = add_opcode(reg, OP_NOT_WORD_BOUND); 1514| 0| break; 1515| 0|#ifdef USE_WORD_BEGIN_END 1516| 0| case ANCHOR_WORD_BEGIN: ------------------ | | 549| 0|#define ANCHOR_WORD_BEGIN (1<<8) ------------------ | Branch (1516:3): [True: 0, False: 55.6k] ------------------ 1517| 0| if (node->ascii_range) r = add_opcode(reg, OP_ASCII_WORD_BEGIN); ------------------ | Branch (1517:9): [True: 0, False: 0] ------------------ 1518| 0| else r = add_opcode(reg, OP_WORD_BEGIN); 1519| 0| break; 1520| 0| case ANCHOR_WORD_END: ------------------ | | 550| 0|#define ANCHOR_WORD_END (1<<9) ------------------ | Branch (1520:3): [True: 0, False: 55.6k] ------------------ 1521| 0| if (node->ascii_range) r = add_opcode(reg, OP_ASCII_WORD_END); ------------------ | Branch (1521:9): [True: 0, False: 0] ------------------ 1522| 0| else r = add_opcode(reg, OP_WORD_END); 1523| 0| break; 1524| 0|#endif 1525| 0| case ANCHOR_KEEP: r = add_opcode(reg, OP_KEEP); break; ------------------ | | 559| 0|#define ANCHOR_KEEP (1<<16) ------------------ | Branch (1525:3): [True: 0, False: 55.6k] ------------------ 1526| | 1527| 0| case ANCHOR_PREC_READ: ------------------ | | 551| 0|#define ANCHOR_PREC_READ (1<<10) ------------------ | Branch (1527:3): [True: 0, False: 55.6k] ------------------ 1528| 0| r = add_opcode(reg, OP_PUSH_POS); 1529| 0| if (r) return r; ------------------ | Branch (1529:9): [True: 0, False: 0] ------------------ 1530| 0| r = compile_tree(node->target, reg); 1531| 0| if (r) return r; ------------------ | Branch (1531:9): [True: 0, False: 0] ------------------ 1532| 0| r = add_opcode(reg, OP_POP_POS); 1533| 0| break; 1534| | 1535| 0| case ANCHOR_PREC_READ_NOT: ------------------ | | 552| 0|#define ANCHOR_PREC_READ_NOT (1<<11) ------------------ | Branch (1535:3): [True: 0, False: 55.6k] ------------------ 1536| 0| len = compile_length_tree(node->target, reg); 1537| 0| if (len < 0) return len; ------------------ | Branch (1537:9): [True: 0, False: 0] ------------------ 1538| 0| r = add_opcode_rel_addr(reg, OP_PUSH_POS_NOT, len + SIZE_OP_FAIL_POS); ------------------ | | 730| 0|#define SIZE_OP_FAIL_POS SIZE_OPCODE | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ 1539| 0| if (r) return r; ------------------ | Branch (1539:9): [True: 0, False: 0] ------------------ 1540| 0| r = compile_tree(node->target, reg); 1541| 0| if (r) return r; ------------------ | Branch (1541:9): [True: 0, False: 0] ------------------ 1542| 0| r = add_opcode(reg, OP_FAIL_POS); 1543| 0| break; 1544| | 1545| 0| case ANCHOR_LOOK_BEHIND: ------------------ | | 553| 0|#define ANCHOR_LOOK_BEHIND (1<<12) ------------------ | Branch (1545:3): [True: 0, False: 55.6k] ------------------ 1546| 0| { 1547| 0| int n; 1548| 0| r = add_opcode(reg, OP_LOOK_BEHIND); 1549| 0| if (r) return r; ------------------ | Branch (1549:11): [True: 0, False: 0] ------------------ 1550| 0| if (node->char_len < 0) { ------------------ | Branch (1550:11): [True: 0, False: 0] ------------------ 1551| 0| r = get_char_length_tree(node->target, reg, &n); 1552| 0| if (r) return ONIGERR_INVALID_LOOK_BEHIND_PATTERN; ------------------ | | 665| 0|#define ONIGERR_INVALID_LOOK_BEHIND_PATTERN -122 ------------------ | Branch (1552:6): [True: 0, False: 0] ------------------ 1553| 0| } 1554| 0| else 1555| 0| n = node->char_len; 1556| 0| r = add_length(reg, n); 1557| 0| if (r) return r; ------------------ | Branch (1557:11): [True: 0, False: 0] ------------------ 1558| 0| r = compile_tree(node->target, reg); 1559| 0| } 1560| 0| break; 1561| | 1562| 0| case ANCHOR_LOOK_BEHIND_NOT: ------------------ | | 554| 0|#define ANCHOR_LOOK_BEHIND_NOT (1<<13) ------------------ | Branch (1562:3): [True: 0, False: 55.6k] ------------------ 1563| 0| { 1564| 0| int n; 1565| 0| len = compile_length_tree(node->target, reg); 1566| 0| r = add_opcode_rel_addr(reg, OP_PUSH_LOOK_BEHIND_NOT, 1567| 0| len + SIZE_OP_FAIL_LOOK_BEHIND_NOT); ------------------ | | 746| 0|#define SIZE_OP_FAIL_LOOK_BEHIND_NOT SIZE_OPCODE | | ------------------ | | | | 688| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ 1568| 0| if (r) return r; ------------------ | Branch (1568:11): [True: 0, False: 0] ------------------ 1569| 0| if (node->char_len < 0) { ------------------ | Branch (1569:11): [True: 0, False: 0] ------------------ 1570| 0| r = get_char_length_tree(node->target, reg, &n); 1571| 0| if (r) return ONIGERR_INVALID_LOOK_BEHIND_PATTERN; ------------------ | | 665| 0|#define ONIGERR_INVALID_LOOK_BEHIND_PATTERN -122 ------------------ | Branch (1571:6): [True: 0, False: 0] ------------------ 1572| 0| } 1573| 0| else 1574| 0| n = node->char_len; 1575| 0| r = add_length(reg, n); 1576| 0| if (r) return r; ------------------ | Branch (1576:11): [True: 0, False: 0] ------------------ 1577| 0| r = compile_tree(node->target, reg); 1578| 0| if (r) return r; ------------------ | Branch (1578:11): [True: 0, False: 0] ------------------ 1579| 0| r = add_opcode(reg, OP_FAIL_LOOK_BEHIND_NOT); 1580| 0| } 1581| 0| break; 1582| | 1583| 0| default: ------------------ | Branch (1583:3): [True: 0, False: 55.6k] ------------------ 1584| 0| return ONIGERR_TYPE_BUG; ------------------ | | 633| 0|#define ONIGERR_TYPE_BUG -6 ------------------ 1585| 0| break; 1586| 55.6k| } 1587| | 1588| 55.6k| return r; 1589| 55.6k|} regcomp.c:add_opcode: 205| 449k|{ 206| 449k| BBUF_ADD1(reg, opcode); ------------------ | | 505| 449k|#define BBUF_ADD1(buf,byte) BBUF_WRITE1((buf),(buf)->used,(byte)) | | ------------------ | | | | 497| 449k|#define BBUF_WRITE1(buf,pos,byte) do{\ | | | | 498| 449k| int used = (pos) + 1;\ | | | | 499| 449k| if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ | | | | ------------------ | | | | | | 470| 5.64k|#define BBUF_EXPAND(buf,low) do{\ | | | | | | 471| 5.64k| UChar *tmp;\ | | | | | | ------------------ | | | | | | | | 76| 5.64k|# define UChar OnigUChar | | | | | | ------------------ | | | | | | 472| 5.64k| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | | | ------------------ | | | | | | | Branch (472:36): [True: 0, False: 5.64k] | | | | | | ------------------ | | | | | | 473| 5.64k| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | | | ------------------ | | | | | | | | 143| 5.64k|# define xrealloc realloc | | | | | | ------------------ | | | | | | 474| 5.64k| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 311| 5.64k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | | | ------------------ | | | | | | | | | Branch (311:39): [True: 0, False: 5.64k] | | | | | | | | ------------------ | | | | | | ------------------ | | | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 632| 0|#define ONIGERR_MEMORY -5 | | | | | | ------------------ | | | | | | 475| 5.64k| (buf)->p = tmp;\ | | | | | | 476| 5.64k|} while (0) | | | | | | ------------------ | | | | | | | Branch (476:10): [Folded - Ignored] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (499:7): [True: 5.64k, False: 444k] | | | | ------------------ | | | | 500| 449k| (buf)->p[(pos)] = (UChar )(byte);\ | | | | 501| 449k| if ((buf)->used < (unsigned int )used) (buf)->used = used;\ | | | | ------------------ | | | | | Branch (501:7): [True: 449k, False: 0] | | | | ------------------ | | | | 502| 449k|} while (0) | | | | ------------------ | | | | | Branch (502:10): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 207| 449k| return 0; 208| 449k|} onigenc_init: 37| 1|{ 38| 1| return 0; 39| 1|} onigenc_mbclen: 56| 3.32M|{ 57| 3.32M| int ret = ONIGENC_PRECISE_MBC_ENC_LEN(enc, p, e); ------------------ | | 356| 3.32M|#define ONIGENC_PRECISE_MBC_ENC_LEN(enc,p,e) (enc)->precise_mbc_enc_len(p,e,enc) ------------------ 58| 3.32M| if (ONIGENC_MBCLEN_CHARFOUND_P(ret)) { ------------------ | | 346| 3.32M|#define ONIGENC_MBCLEN_CHARFOUND_P(r) (0 < (r)) | | ------------------ | | | Branch (346:49): [True: 3.32M, False: 0] | | ------------------ ------------------ 59| 3.32M| ret = ONIGENC_MBCLEN_CHARFOUND_LEN(ret); ------------------ | | 347| 3.32M|#define ONIGENC_MBCLEN_CHARFOUND_LEN(r) (r) ------------------ 60| 3.32M| if (ret > (int)(e - p)) ret = (int)(e - p); // just for case ------------------ | Branch (60:9): [True: 0, False: 3.32M] ------------------ 61| 3.32M| return ret; 62| 3.32M| } 63| 0| else if (ONIGENC_MBCLEN_NEEDMORE_P(ret)) { ------------------ | | 353| 0|#define ONIGENC_MBCLEN_NEEDMORE_P(r) ((r) < -1) | | ------------------ | | | Branch (353:49): [True: 0, False: 0] | | ------------------ ------------------ 64| 0| return (int)(e - p); 65| 0| } 66| 0| return p < e ? 1 : 0; ------------------ | Branch (66:10): [True: 0, False: 0] ------------------ 67| 3.32M|} onigenc_always_true_is_allowed_reverse_match: 677| 21.0k|{ 678| 21.0k| return TRUE; ------------------ | | 73| 21.0k|# define TRUE 1 ------------------ 679| 21.0k|} onig_strcpy: 260| 722k|{ 261| 722k| ptrdiff_t len = end - src; 262| 722k| if (len > 0) { ------------------ | Branch (262:7): [True: 722k, False: 0] ------------------ 263| 722k| xmemcpy(dest, src, len); ------------------ | | 215| 722k|#define xmemcpy memcpy ------------------ 264| 722k| dest[len] = (UChar )0; 265| 722k| } 266| 722k|} onig_st_init_strend_table_with_size: 407| 2.01k|{ 408| 2.01k| static const struct st_hash_type hashType = { 409| 2.01k| str_end_cmp, 410| 2.01k| str_end_hash, 411| 2.01k| }; 412| | 413| 2.01k| return (hash_table_type* ) 414| 2.01k| onig_st_init_table_with_size(&hashType, size); 415| 2.01k|} onig_st_lookup_strend: 420| 6.05k|{ 421| 6.05k| st_str_end_key key; 422| | 423| 6.05k| key.s = (UChar* )str_key; 424| 6.05k| key.end = (UChar* )end_key; 425| | 426| 6.05k| return onig_st_lookup(table, (st_data_t )(&key), value); 427| 6.05k|} onig_st_insert_strend: 432| 8.06k|{ 433| 8.06k| st_str_end_key* key; 434| 8.06k| int result; 435| | 436| 8.06k| key = (st_str_end_key* )xmalloc(sizeof(st_str_end_key)); ------------------ | | 142| 8.06k|# define xmalloc malloc ------------------ 437| 8.06k| key->s = (UChar* )str_key; 438| 8.06k| key->end = (UChar* )end_key; 439| 8.06k| result = onig_st_insert(table, (st_data_t )key, value); 440| 8.06k| if (result) { ------------------ | Branch (440:7): [True: 0, False: 8.06k] ------------------ 441| 0| xfree(key); ------------------ | | 145| 0|# define xfree free ------------------ 442| 0| } 443| 8.06k| return result; 444| 8.06k|} onig_names_free: 526| 44.0k|{ 527| 44.0k| int r; 528| 44.0k| NameTable* t; 529| | 530| 44.0k| r = names_clear(reg); 531| 44.0k| if (r) return r; ------------------ | Branch (531:7): [True: 0, False: 44.0k] ------------------ 532| | 533| 44.0k| t = (NameTable* )reg->name_table; 534| 44.0k| if (IS_NOT_NULL(t)) onig_st_free_table(t); ------------------ | | 312| 44.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 2.01k, False: 42.0k] | | ------------------ ------------------ 535| 44.0k| reg->name_table = (void* )NULL; 536| 44.0k| return 0; 537| 44.0k|} onig_node_free: 1063| 384k|{ 1064| 601k| start: 1065| 601k| if (IS_NULL(node)) return ; ------------------ | | 311| 601k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 86.5k, False: 515k] | | ------------------ ------------------ 1066| | 1067| 515k| switch (NTYPE(node)) { ------------------ | | 69| 515k|#define NTYPE(node) ((node)->u.base.type) | | ------------------ | | | Branch (69:33): [True: 19.3k, False: 495k] | | ------------------ ------------------ 1068| 83.2k| case NT_STR: ------------------ | | 38| 83.2k|#define NT_STR 0 ------------------ | Branch (1068:3): [True: 83.2k, False: 432k] ------------------ 1069| 83.2k| if (NSTR(node)->capa != 0 && ------------------ | | 76| 83.2k|#define NSTR(node) (&((node)->u.str)) ------------------ | Branch (1069:9): [True: 7.73k, False: 75.5k] ------------------ 1070| 83.2k| IS_NOT_NULL(NSTR(node)->s) && NSTR(node)->s != NSTR(node)->buf) { ------------------ | | 312| 90.9k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 7.73k, False: 0] | | ------------------ ------------------ IS_NOT_NULL(NSTR(node)->s) && NSTR(node)->s != NSTR(node)->buf) { ------------------ | | 76| 7.73k|#define NSTR(node) (&((node)->u.str)) ------------------ IS_NOT_NULL(NSTR(node)->s) && NSTR(node)->s != NSTR(node)->buf) { ------------------ | | 76| 7.73k|#define NSTR(node) (&((node)->u.str)) ------------------ | Branch (1070:32): [True: 7.73k, False: 0] ------------------ 1071| 7.73k| xfree(NSTR(node)->s); ------------------ | | 145| 7.73k|# define xfree free ------------------ xfree(NSTR(node)->s); ------------------ | | 76| 7.73k|#define NSTR(node) (&((node)->u.str)) ------------------ 1072| 7.73k| } 1073| 83.2k| break; 1074| | 1075| 189k| case NT_LIST: ------------------ | | 46| 189k|#define NT_LIST 8 ------------------ | Branch (1075:3): [True: 189k, False: 325k] ------------------ 1076| 217k| case NT_ALT: ------------------ | | 47| 217k|#define NT_ALT 9 ------------------ | Branch (1076:3): [True: 27.6k, False: 487k] ------------------ 1077| 217k| onig_node_free(NCAR(node)); ------------------ | | 86| 217k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 217k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1078| 217k| { 1079| 217k| Node* next_node = NCDR(node); ------------------ | | 87| 217k|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 217k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1080| | 1081| 217k| xfree(node); ------------------ | | 145| 217k|# define xfree free ------------------ 1082| 217k| node = next_node; 1083| 217k| goto start; 1084| 189k| } 1085| 0| break; 1086| | 1087| 45.6k| case NT_CCLASS: ------------------ | | 39| 45.6k|#define NT_CCLASS 1 ------------------ | Branch (1087:3): [True: 45.6k, False: 469k] ------------------ 1088| 45.6k| { 1089| 45.6k| CClassNode* cc = NCCLASS(node); ------------------ | | 77| 45.6k|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 1090| | 1091| 45.6k| if (cc->mbuf) ------------------ | Branch (1091:11): [True: 0, False: 45.6k] ------------------ 1092| 0| bbuf_free(cc->mbuf); 1093| 45.6k| } 1094| 45.6k| break; 1095| | 1096| 57.1k| case NT_QTFR: ------------------ | | 43| 57.1k|#define NT_QTFR 5 ------------------ | Branch (1096:3): [True: 57.1k, False: 458k] ------------------ 1097| 57.1k| if (NQTFR(node)->target) ------------------ | | 80| 57.1k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ | Branch (1097:9): [True: 57.1k, False: 0] ------------------ 1098| 57.1k| onig_node_free(NQTFR(node)->target); ------------------ | | 80| 57.1k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1099| 57.1k| break; 1100| | 1101| 36.5k| case NT_ENCLOSE: ------------------ | | 44| 36.5k|#define NT_ENCLOSE 6 ------------------ | Branch (1101:3): [True: 36.5k, False: 478k] ------------------ 1102| 36.5k| if (NENCLOSE(node)->target) ------------------ | | 81| 36.5k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ | Branch (1102:9): [True: 36.5k, False: 0] ------------------ 1103| 36.5k| onig_node_free(NENCLOSE(node)->target); ------------------ | | 81| 36.5k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1104| 36.5k| break; 1105| | 1106| 0| case NT_BREF: ------------------ | | 42| 0|#define NT_BREF 4 ------------------ | Branch (1106:3): [True: 0, False: 515k] ------------------ 1107| 0| if (IS_NOT_NULL(NBREF(node)->back_dynamic)) ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ 1108| 0| xfree(NBREF(node)->back_dynamic); ------------------ | | 145| 0|# define xfree free ------------------ xfree(NBREF(node)->back_dynamic); ------------------ | | 79| 0|#define NBREF(node) (&((node)->u.bref)) ------------------ 1109| 0| break; 1110| | 1111| 55.6k| case NT_ANCHOR: ------------------ | | 45| 55.6k|#define NT_ANCHOR 7 ------------------ | Branch (1111:3): [True: 55.6k, False: 459k] ------------------ 1112| 55.6k| if (NANCHOR(node)->target) ------------------ | | 82| 55.6k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ | Branch (1112:9): [True: 0, False: 55.6k] ------------------ 1113| 0| onig_node_free(NANCHOR(node)->target); ------------------ | | 82| 0|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 1114| 55.6k| break; 1115| 515k| } 1116| | 1117| 297k| xfree(node); ------------------ | | 145| 297k|# define xfree free ------------------ 1118| 297k|} onig_node_new_alt: 1211| 27.6k|{ 1212| 27.6k| Node* node = node_new(); 1213| 27.6k| CHECK_NULL_RETURN(node); ------------------ | | 313| 27.6k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 311| 27.6k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 27.6k] | | | | ------------------ | | ------------------ ------------------ 1214| | 1215| 27.6k| SET_NTYPE(node, NT_ALT); ------------------ | | 71| 27.6k| do { \ | | 72| 27.6k| int value = ntype; \ | | 73| 27.6k| memcpy(&((node)->u.base.type), &value, sizeof(int)); \ | | 74| 27.6k| } while (0) | | ------------------ | | | Branch (74:14): [Folded - Ignored] | | ------------------ ------------------ 1216| 27.6k| NCAR(node) = left; ------------------ | | 86| 27.6k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 27.6k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1217| 27.6k| NCDR(node) = right; ------------------ | | 87| 27.6k|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 27.6k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1218| 27.6k| return node; 1219| 27.6k|} onig_node_new_anchor: 1223| 55.6k|{ 1224| 55.6k| Node* node = node_new(); 1225| 55.6k| CHECK_NULL_RETURN(node); ------------------ | | 313| 55.6k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 311| 55.6k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 55.6k] | | | | ------------------ | | ------------------ ------------------ 1226| | 1227| 55.6k| SET_NTYPE(node, NT_ANCHOR); ------------------ | | 71| 55.6k| do { \ | | 72| 55.6k| int value = ntype; \ | | 73| 55.6k| memcpy(&((node)->u.base.type), &value, sizeof(int)); \ | | 74| 55.6k| } while (0) | | ------------------ | | | Branch (74:14): [Folded - Ignored] | | ------------------ ------------------ 1228| 55.6k| NANCHOR(node)->type = type; ------------------ | | 82| 55.6k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 1229| 55.6k| NANCHOR(node)->target = NULL; ------------------ | | 82| 55.6k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 1230| 55.6k| NANCHOR(node)->char_len = -1; ------------------ | | 82| 55.6k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 1231| 55.6k| NANCHOR(node)->ascii_range = 0; ------------------ | | 82| 55.6k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 1232| 55.6k| return node; 1233| 55.6k|} onig_node_new_enclose: 1348| 24.5k|{ 1349| 24.5k| return node_new_enclose(type); 1350| 24.5k|} onig_node_str_cat: 1377| 716k|{ 1378| 716k| ptrdiff_t addlen = end - s; 1379| | 1380| 716k| if (addlen > 0) { ------------------ | Branch (1380:7): [True: 714k, False: 1.95k] ------------------ 1381| 714k| ptrdiff_t len = NSTR(node)->end - NSTR(node)->s; ------------------ | | 76| 714k|#define NSTR(node) (&((node)->u.str)) ------------------ ptrdiff_t len = NSTR(node)->end - NSTR(node)->s; ------------------ | | 76| 714k|#define NSTR(node) (&((node)->u.str)) ------------------ 1382| | 1383| 714k| if (NSTR(node)->capa > 0 || (len + addlen > NODE_STR_BUF_SIZE - 1)) { ------------------ | | 76| 714k|#define NSTR(node) (&((node)->u.str)) ------------------ if (NSTR(node)->capa > 0 || (len + addlen > NODE_STR_BUF_SIZE - 1)) { ------------------ | | 101| 605k|#define NODE_STR_BUF_SIZE 24 /* sizeof(CClassNode) - sizeof(int)*4 */ ------------------ | Branch (1383:9): [True: 108k, False: 605k] | Branch (1383:33): [True: 7.73k, False: 598k] ------------------ 1384| 116k| UChar* p; ------------------ | | 76| 116k|# define UChar OnigUChar ------------------ 1385| 116k| ptrdiff_t capa = len + addlen + NODE_STR_MARGIN; ------------------ | | 100| 116k|#define NODE_STR_MARGIN 16 ------------------ 1386| | 1387| 116k| if (capa <= NSTR(node)->capa) { ------------------ | | 76| 116k|#define NSTR(node) (&((node)->u.str)) ------------------ | Branch (1387:11): [True: 0, False: 116k] ------------------ 1388| 0| onig_strcpy(NSTR(node)->s + len, s, end); ------------------ | | 76| 0|#define NSTR(node) (&((node)->u.str)) ------------------ 1389| 0| } 1390| 116k| else { 1391| 116k| if (NSTR(node)->s == NSTR(node)->buf) ------------------ | | 76| 116k|#define NSTR(node) (&((node)->u.str)) ------------------ if (NSTR(node)->s == NSTR(node)->buf) ------------------ | | 76| 116k|#define NSTR(node) (&((node)->u.str)) ------------------ | Branch (1391:6): [True: 7.73k, False: 108k] ------------------ 1392| 7.73k| p = strcat_capa_from_static(NSTR(node)->s, NSTR(node)->end, ------------------ | | 76| 7.73k|#define NSTR(node) (&((node)->u.str)) ------------------ p = strcat_capa_from_static(NSTR(node)->s, NSTR(node)->end, ------------------ | | 76| 7.73k|#define NSTR(node) (&((node)->u.str)) ------------------ 1393| 7.73k| s, end, capa); 1394| 108k| else 1395| 108k| p = strcat_capa(NSTR(node)->s, NSTR(node)->end, s, end, capa); ------------------ | | 76| 108k|#define NSTR(node) (&((node)->u.str)) ------------------ p = strcat_capa(NSTR(node)->s, NSTR(node)->end, s, end, capa); ------------------ | | 76| 108k|#define NSTR(node) (&((node)->u.str)) ------------------ 1396| | 1397| 116k| CHECK_NULL_RETURN_MEMERR(p); ------------------ | | 314| 116k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 116k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 116k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 1398| 116k| NSTR(node)->s = p; ------------------ | | 76| 116k|#define NSTR(node) (&((node)->u.str)) ------------------ 1399| 116k| NSTR(node)->capa = (int )capa; ------------------ | | 76| 116k|#define NSTR(node) (&((node)->u.str)) ------------------ 1400| 116k| } 1401| 116k| } 1402| 598k| else { 1403| 598k| onig_strcpy(NSTR(node)->s + len, s, end); ------------------ | | 76| 598k|#define NSTR(node) (&((node)->u.str)) ------------------ 1404| 598k| } 1405| 714k| NSTR(node)->end = NSTR(node)->s + len + addlen; ------------------ | | 76| 714k|#define NSTR(node) (&((node)->u.str)) ------------------ NSTR(node)->end = NSTR(node)->s + len + addlen; ------------------ | | 76| 714k|#define NSTR(node) (&((node)->u.str)) ------------------ 1406| 714k| } 1407| | 1408| 716k| return 0; 1409| 716k|} onig_parse_make_tree: 6633| 44.0k|{ 6634| 44.0k| int r; 6635| 44.0k| UChar* p; ------------------ | | 76| 44.0k|# define UChar OnigUChar ------------------ 6636| | 6637| 44.0k|#ifdef USE_NAMED_GROUP 6638| 44.0k| names_clear(reg); 6639| 44.0k|#endif 6640| | 6641| 44.0k| scan_env_clear(env); 6642| 44.0k| env->option = reg->options; 6643| 44.0k| env->case_fold_flag = reg->case_fold_flag; 6644| 44.0k| env->enc = reg->enc; 6645| 44.0k| env->syntax = reg->syntax; 6646| 44.0k| env->pattern = (UChar* )pattern; 6647| 44.0k| env->pattern_end = (UChar* )end; 6648| 44.0k| env->reg = reg; 6649| | 6650| 44.0k| *root = NULL; 6651| 44.0k| p = (UChar* )pattern; 6652| 44.0k| r = parse_regexp(root, &p, (UChar* )end, env); 6653| 44.0k| reg->num_mem = env->num_mem; 6654| 44.0k| return r; 6655| 44.0k|} regparse.c:str_end_hash: 392| 14.1k|{ 393| 14.1k| const st_str_end_key *x = (const st_str_end_key *)xp; 394| 14.1k| const UChar *p; 395| 14.1k| st_index_t val = 0; 396| | 397| 14.1k| p = x->s; 398| 66.5k| while (p < x->end) { ------------------ | Branch (398:10): [True: 52.4k, False: 14.1k] ------------------ 399| 52.4k| val = val * 997 + (int )*p++; 400| 52.4k| } 401| | 402| 14.1k| return val + (val >> 5); 403| 14.1k|} regparse.c:names_clear: 515| 88.1k|{ 516| 88.1k| NameTable* t = (NameTable* )reg->name_table; 517| | 518| 88.1k| if (IS_NOT_NULL(t)) { ------------------ | | 312| 88.1k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 2.01k, False: 86.0k] | | ------------------ ------------------ 519| 2.01k| onig_st_foreach(t, i_free_name_entry, 0); 520| 2.01k| } 521| 88.1k| return 0; 522| 88.1k|} regparse.c:i_free_name_entry: 505| 8.06k|{ 506| 8.06k| xfree(e->name); ------------------ | | 145| 8.06k|# define xfree free ------------------ 507| 8.06k| if (IS_NOT_NULL(e->back_refs)) xfree(e->back_refs); ------------------ | | 312| 8.06k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 8.06k] | | ------------------ ------------------ if (IS_NOT_NULL(e->back_refs)) xfree(e->back_refs); ------------------ | | 145| 0|# define xfree free ------------------ 508| 8.06k| xfree(key); ------------------ | | 145| 8.06k|# define xfree free ------------------ 509| 8.06k| xfree(e); ------------------ | | 145| 8.06k|# define xfree free ------------------ 510| 8.06k| return ST_DELETE; 511| 8.06k|} regparse.c:name_find: 541| 8.06k|{ 542| 8.06k| NameEntry* e; 543| 8.06k| NameTable* t = (NameTable* )reg->name_table; 544| | 545| 8.06k| e = (NameEntry* )NULL; 546| 8.06k| if (IS_NOT_NULL(t)) { ------------------ | | 312| 8.06k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 6.05k, False: 2.01k] | | ------------------ ------------------ 547| 6.05k| onig_st_lookup_strend(t, name, name_end, (HashDataType* )((void* )(&e))); 548| 6.05k| } 549| 8.06k| return e; 550| 8.06k|} regparse.c:bbuf_free: 135| 48.6k|{ 136| 48.6k| if (IS_NOT_NULL(bbuf)) { ------------------ | | 312| 48.6k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 24.3k, False: 24.3k] | | ------------------ ------------------ 137| 24.3k| if (IS_NOT_NULL(bbuf->p)) xfree(bbuf->p); ------------------ | | 312| 24.3k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 24.3k, False: 0] | | ------------------ ------------------ if (IS_NOT_NULL(bbuf->p)) xfree(bbuf->p); ------------------ | | 145| 24.3k|# define xfree free ------------------ 138| 24.3k| xfree(bbuf); ------------------ | | 145| 24.3k|# define xfree free ------------------ 139| 24.3k| } 140| 48.6k|} regparse.c:node_new_list: 1175| 189k|{ 1176| 189k| Node* node = node_new(); 1177| 189k| CHECK_NULL_RETURN(node); ------------------ | | 313| 189k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 311| 189k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 189k] | | | | ------------------ | | ------------------ ------------------ 1178| | 1179| 189k| SET_NTYPE(node, NT_LIST); ------------------ | | 71| 189k| do { \ | | 72| 189k| int value = ntype; \ | | 73| 189k| memcpy(&((node)->u.base.type), &value, sizeof(int)); \ | | 74| 189k| } while (0) | | ------------------ | | | Branch (74:14): [Folded - Ignored] | | ------------------ ------------------ 1180| 189k| NCAR(node) = left; ------------------ | | 86| 189k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 189k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1181| 189k| NCDR(node) = right; ------------------ | | 87| 189k|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 189k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1182| 189k| return node; 1183| 189k|} regparse.c:node_new: 1122| 515k|{ 1123| 515k| Node* node; 1124| | 1125| 515k| node = (Node* )xmalloc(sizeof(Node)); ------------------ | | 142| 515k|# define xmalloc malloc ------------------ 1126| | /* xmemset(node, 0, sizeof(Node)); */ 1127| 515k| return node; 1128| 515k|} regparse.c:node_new_enclose: 1331| 36.5k|{ 1332| 36.5k| Node* node = node_new(); 1333| 36.5k| CHECK_NULL_RETURN(node); ------------------ | | 313| 36.5k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 311| 36.5k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 36.5k] | | | | ------------------ | | ------------------ ------------------ 1334| | 1335| 36.5k| SET_NTYPE(node, NT_ENCLOSE); ------------------ | | 71| 36.5k| do { \ | | 72| 36.5k| int value = ntype; \ | | 73| 36.5k| memcpy(&((node)->u.base.type), &value, sizeof(int)); \ | | 74| 36.5k| } while (0) | | ------------------ | | | Branch (74:14): [Folded - Ignored] | | ------------------ ------------------ 1336| 36.5k| NENCLOSE(node)->type = type; ------------------ | | 81| 36.5k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1337| 36.5k| NENCLOSE(node)->state = 0; ------------------ | | 81| 36.5k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1338| 36.5k| NENCLOSE(node)->regnum = 0; ------------------ | | 81| 36.5k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1339| 36.5k| NENCLOSE(node)->option = 0; ------------------ | | 81| 36.5k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1340| 36.5k| NENCLOSE(node)->target = NULL; ------------------ | | 81| 36.5k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1341| 36.5k| NENCLOSE(node)->call_addr = -1; ------------------ | | 81| 36.5k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1342| 36.5k| NENCLOSE(node)->opt_count = 0; ------------------ | | 81| 36.5k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1343| 36.5k| return node; 1344| 36.5k|} regparse.c:strcat_capa_from_static: 342| 7.73k|{ 343| 7.73k| UChar* r; ------------------ | | 76| 7.73k|# define UChar OnigUChar ------------------ 344| | 345| 7.73k| r = (UChar* )xmalloc(capa + 1); ------------------ | | 142| 7.73k|# define xmalloc malloc ------------------ 346| 7.73k| CHECK_NULL_RETURN(r); ------------------ | | 313| 7.73k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 311| 7.73k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 7.73k] | | | | ------------------ | | ------------------ ------------------ 347| 7.73k| onig_strcpy(r, dest, dest_end); 348| 7.73k| onig_strcpy(r + (dest_end - dest), src, src_end); 349| 7.73k| return r; 350| 7.73k|} regparse.c:strcat_capa: 325| 108k|{ 326| 108k| UChar* r; ------------------ | | 76| 108k|# define UChar OnigUChar ------------------ 327| | 328| 108k| if (dest) ------------------ | Branch (328:7): [True: 108k, False: 0] ------------------ 329| 108k| r = (UChar* )xrealloc(dest, capa + 1); ------------------ | | 143| 108k|# define xrealloc realloc ------------------ 330| 0| else 331| 0| r = (UChar* )xmalloc(capa + 1); ------------------ | | 142| 0|# define xmalloc malloc ------------------ 332| | 333| 108k| CHECK_NULL_RETURN(r); ------------------ | | 313| 108k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 311| 108k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 108k] | | | | ------------------ | | ------------------ ------------------ 334| 108k| onig_strcpy(r + (dest_end - dest), src, src_end); 335| 108k| return r; 336| 108k|} regparse.c:node_new_str: 1464| 83.2k|{ 1465| 83.2k| Node* node = node_new(); 1466| 83.2k| CHECK_NULL_RETURN(node); ------------------ | | 313| 83.2k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 311| 83.2k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 83.2k] | | | | ------------------ | | ------------------ ------------------ 1467| | 1468| 83.2k| SET_NTYPE(node, NT_STR); ------------------ | | 71| 83.2k| do { \ | | 72| 83.2k| int value = ntype; \ | | 73| 83.2k| memcpy(&((node)->u.base.type), &value, sizeof(int)); \ | | 74| 83.2k| } while (0) | | ------------------ | | | Branch (74:14): [Folded - Ignored] | | ------------------ ------------------ 1469| 83.2k| NSTR(node)->capa = 0; ------------------ | | 76| 83.2k|#define NSTR(node) (&((node)->u.str)) ------------------ 1470| 83.2k| NSTR(node)->flag = 0; ------------------ | | 76| 83.2k|#define NSTR(node) (&((node)->u.str)) ------------------ 1471| 83.2k| NSTR(node)->s = NSTR(node)->buf; ------------------ | | 76| 83.2k|#define NSTR(node) (&((node)->u.str)) ------------------ NSTR(node)->s = NSTR(node)->buf; ------------------ | | 76| 83.2k|#define NSTR(node) (&((node)->u.str)) ------------------ 1472| 83.2k| NSTR(node)->end = NSTR(node)->buf; ------------------ | | 76| 83.2k|#define NSTR(node) (&((node)->u.str)) ------------------ NSTR(node)->end = NSTR(node)->buf; ------------------ | | 76| 83.2k|#define NSTR(node) (&((node)->u.str)) ------------------ 1473| 83.2k| if (onig_node_str_cat(node, s, end)) { ------------------ | Branch (1473:7): [True: 0, False: 83.2k] ------------------ 1474| 0| onig_node_free(node); 1475| 0| return NULL; 1476| 0| } 1477| 83.2k| return node; 1478| 83.2k|} regparse.c:scan_env_clear: 984| 44.0k|{ 985| 44.0k| int i; 986| | 987| 44.0k| BIT_STATUS_CLEAR(env->capture_history); ------------------ | | 368| 44.0k|#define BIT_STATUS_CLEAR(stats) (stats) = 0 ------------------ 988| 44.0k| BIT_STATUS_CLEAR(env->bt_mem_start); ------------------ | | 368| 44.0k|#define BIT_STATUS_CLEAR(stats) (stats) = 0 ------------------ 989| 44.0k| BIT_STATUS_CLEAR(env->bt_mem_end); ------------------ | | 368| 44.0k|#define BIT_STATUS_CLEAR(stats) (stats) = 0 ------------------ 990| 44.0k| BIT_STATUS_CLEAR(env->backrefed_mem); ------------------ | | 368| 44.0k|#define BIT_STATUS_CLEAR(stats) (stats) = 0 ------------------ 991| 44.0k| env->error = (UChar* )NULL; 992| 44.0k| env->error_end = (UChar* )NULL; 993| 44.0k| env->num_call = 0; 994| 44.0k| env->num_mem = 0; 995| 44.0k|#ifdef USE_NAMED_GROUP 996| 44.0k| env->num_named = 0; 997| 44.0k|#endif 998| 44.0k| env->mem_alloc = 0; 999| 44.0k| env->mem_nodes_dynamic = (Node** )NULL; 1000| | 1001| 396k| for (i = 0; i < SCANENV_MEMNODES_SIZE; i++) ------------------ | | 285| 396k|#define SCANENV_MEMNODES_SIZE 8 ------------------ | Branch (1001:15): [True: 352k, False: 44.0k] ------------------ 1002| 352k| env->mem_nodes_static[i] = NULL_NODE; ------------------ | | 283| 352k|#define NULL_NODE ((Node* )0) ------------------ 1003| | 1004| |#ifdef USE_COMBINATION_EXPLOSION_CHECK 1005| | env->num_comb_exp_check = 0; 1006| | env->comb_exp_max_regnum = 0; 1007| | env->curr_max_regnum = 0; 1008| | env->has_recursion = 0; 1009| |#endif 1010| 44.0k| env->parse_depth = 0; 1011| 44.0k| env->warnings_flag = 0; 1012| 44.0k|} regparse.c:parse_regexp: 6601| 44.0k|{ 6602| 44.0k| int r; 6603| 44.0k| OnigToken tok; 6604| | 6605| 44.0k| r = fetch_token(&tok, src, end, env); 6606| 44.0k| if (r < 0) return r; ------------------ | Branch (6606:7): [True: 0, False: 44.0k] ------------------ 6607| 44.0k| r = parse_subexp(top, &tok, TK_EOT, src, end, env); 6608| 44.0k| if (r < 0) return r; ------------------ | Branch (6608:7): [True: 0, False: 44.0k] ------------------ 6609| | 6610| 44.0k|#ifdef USE_SUBEXP_CALL 6611| 44.0k| if (env->num_call > 0) { ------------------ | Branch (6611:7): [True: 0, False: 44.0k] ------------------ 6612| | /* Capture the pattern itself. It is used for (?R), (?0) and \g<0>. */ 6613| 0| const int num = 0; 6614| 0| Node* np; 6615| 0| np = node_new_enclose_memory(env->option, 0); 6616| 0| CHECK_NULL_RETURN_MEMERR(np); ------------------ | | 314| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6617| 0| NENCLOSE(np)->regnum = num; ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 6618| 0| NENCLOSE(np)->target = *top; ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 6619| 0| r = scan_env_set_mem_node(env, num, np); 6620| 0| if (r != 0) { ------------------ | Branch (6620:9): [True: 0, False: 0] ------------------ 6621| 0| onig_node_free(np); 6622| 0| return r; 6623| 0| } 6624| 0| *top = np; 6625| 0| } 6626| 44.0k|#endif 6627| 44.0k| return 0; 6628| 44.0k|} regparse.c:fetch_token: 3306| 999k|{ 3307| 999k| int r, num; 3308| 999k| OnigCodePoint c; 3309| 999k| OnigEncoding enc = env->enc; 3310| 999k| const OnigSyntaxType* syn = env->syntax; 3311| 999k| UChar* prev; ------------------ | | 76| 999k|# define UChar OnigUChar ------------------ 3312| 999k| UChar* p = *src; ------------------ | | 76| 999k|# define UChar OnigUChar ------------------ 3313| 999k| PFETCH_READY; ------------------ | | 295| 999k|# define PFETCH_READY UChar* pfetch_prev = NULL; (void)pfetch_prev | | ------------------ | | | | 76| 999k|# define UChar OnigUChar | | ------------------ ------------------ 3314| | 3315| 999k| start: 3316| 999k| if (PEND) { ------------------ | | 299| 999k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 44.0k, False: 955k] | | | Branch (299:23): [True: 955k, False: 44.0k] | | ------------------ ------------------ 3317| 44.0k| tok->type = TK_EOT; 3318| 44.0k| return tok->type; 3319| 44.0k| } 3320| | 3321| 955k| tok->type = TK_STRING; 3322| 955k| tok->base = 0; 3323| 955k| tok->backp = p; 3324| | 3325| 955k| PFETCH(c); ------------------ | | 305| 955k|#define PFETCH(c) do { \ | | 306| 955k| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 955k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 955k] | | ------------------ | | 307| 955k| pfetch_prev = p; \ | | 308| 955k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 955k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 955k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 955k] | | | | ------------------ | | ------------------ | | 309| 955k|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 3326| 955k| if (p > end) return ONIGERR_PREMATURE_END_OF_CHAR_CLASS; ------------------ | | 648| 0|#define ONIGERR_PREMATURE_END_OF_CHAR_CLASS -103 ------------------ | Branch (3326:6): [True: 0, False: 955k] ------------------ 3327| 955k| if (IS_MC_ESC_CODE(c, syn)) { ------------------ | | 769| 955k| ((code) == MC_ESC(syn) && \ | | ------------------ | | | | 761| 1.91M|#define MC_ESC(syn) (syn)->meta_char_table.esc | | ------------------ | | | Branch (769:4): [True: 33.7k, False: 921k] | | ------------------ | | 770| 955k| !IS_SYNTAX_OP2((syn), ONIG_SYN_OP2_INEFFECTIVE_ESCAPE)) | | ------------------ | | | | 331| 33.7k|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (770:4): [True: 33.7k, False: 0] | | ------------------ ------------------ 3328| 33.7k| if (PEND) return ONIGERR_END_PATTERN_AT_ESCAPE; ------------------ | | 299| 33.7k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 33.7k] | | | Branch (299:23): [True: 33.7k, False: 0] | | ------------------ ------------------ if (PEND) return ONIGERR_END_PATTERN_AT_ESCAPE; ------------------ | | 649| 0|#define ONIGERR_END_PATTERN_AT_ESCAPE -104 ------------------ 3329| | 3330| 33.7k| tok->backp = p; 3331| 33.7k| PFETCH(c); ------------------ | | 305| 33.7k|#define PFETCH(c) do { \ | | 306| 33.7k| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 33.7k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 33.7k] | | ------------------ | | 307| 33.7k| pfetch_prev = p; \ | | 308| 33.7k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 33.7k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 33.7k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 33.7k] | | | | ------------------ | | ------------------ | | 309| 33.7k|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 3332| | 3333| 33.7k| tok->u.c = c; 3334| 33.7k| tok->escaped = 1; 3335| 33.7k| switch (c) { 3336| 0| case '*': ------------------ | Branch (3336:5): [True: 0, False: 33.7k] ------------------ 3337| 0| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_ASTERISK_ZERO_INF)) break; ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3337:11): [True: 0, False: 0] ------------------ 3338| 0| tok->type = TK_OP_REPEAT; 3339| 0| tok->u.repeat.lower = 0; 3340| 0| tok->u.repeat.upper = REPEAT_INFINITE; ------------------ | | 421| 0|#define REPEAT_INFINITE -1 ------------------ 3341| 0| goto greedy_check; 3342| 0| break; 3343| | 3344| 0| case '+': ------------------ | Branch (3344:5): [True: 0, False: 33.7k] ------------------ 3345| 0| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_PLUS_ONE_INF)) break; ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3345:11): [True: 0, False: 0] ------------------ 3346| 0| tok->type = TK_OP_REPEAT; 3347| 0| tok->u.repeat.lower = 1; 3348| 0| tok->u.repeat.upper = REPEAT_INFINITE; ------------------ | | 421| 0|#define REPEAT_INFINITE -1 ------------------ 3349| 0| goto greedy_check; 3350| 0| break; 3351| | 3352| 0| case '?': ------------------ | Branch (3352:5): [True: 0, False: 33.7k] ------------------ 3353| 0| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_QMARK_ZERO_ONE)) break; ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3353:11): [True: 0, False: 0] ------------------ 3354| 0| tok->type = TK_OP_REPEAT; 3355| 0| tok->u.repeat.lower = 0; 3356| 0| tok->u.repeat.upper = 1; 3357| 57.1k| greedy_check: 3358| 57.1k| if (!PEND && PPEEK_IS('?') && ------------------ | | 299| 114k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 51.4k, False: 5.71k] | | ------------------ ------------------ if (!PEND && PPEEK_IS('?') && ------------------ | | 320| 108k|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 51.4k|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 369| 51.4k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | | | ------------------ | | | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 291| 0|#define PEND_VALUE 0 | | | | ------------------ | | | | | Branch (319:23): [True: 51.4k, False: 0] | | | | ------------------ | | ------------------ | | | Branch (320:22): [True: 2.01k, False: 49.4k] | | ------------------ ------------------ | Branch (3358:11): [True: 51.4k, False: 5.71k] ------------------ 3359| 57.1k| IS_SYNTAX_OP(syn, ONIG_SYN_OP_QMARK_NON_GREEDY)) { ------------------ | | 330| 2.01k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) | | ------------------ | | | Branch (330:35): [True: 2.01k, False: 0] | | ------------------ ------------------ 3360| 2.01k| PFETCH(c); ------------------ | | 305| 2.01k|#define PFETCH(c) do { \ | | 306| 2.01k| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 2.01k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 2.01k] | | ------------------ | | 307| 2.01k| pfetch_prev = p; \ | | 308| 2.01k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 2.01k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 2.01k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 2.01k] | | | | ------------------ | | ------------------ | | 309| 2.01k|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 3361| 2.01k| tok->u.repeat.greedy = 0; 3362| 2.01k| tok->u.repeat.possessive = 0; 3363| 2.01k| } 3364| 55.1k| else { 3365| 55.1k| possessive_check: 3366| 55.1k| if (!PEND && PPEEK_IS('+') && ------------------ | | 299| 110k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 49.4k, False: 5.71k] | | ------------------ ------------------ if (!PEND && PPEEK_IS('+') && ------------------ | | 320| 104k|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 49.4k|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 369| 49.4k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | | | ------------------ | | | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 291| 0|#define PEND_VALUE 0 | | | | ------------------ | | | | | Branch (319:23): [True: 49.4k, False: 0] | | | | ------------------ | | ------------------ | | | Branch (320:22): [True: 0, False: 49.4k] | | ------------------ ------------------ | Branch (3366:6): [True: 49.4k, False: 5.71k] ------------------ 3367| 55.1k| ((IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_PLUS_POSSESSIVE_REPEAT) && ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 3368| 0| tok->type != TK_INTERVAL) || ------------------ | Branch (3368:8): [True: 0, False: 0] ------------------ 3369| 0| (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_PLUS_POSSESSIVE_INTERVAL) && ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 3370| 0| tok->type == TK_INTERVAL))) { ------------------ | Branch (3370:8): [True: 0, False: 0] ------------------ 3371| 0| PFETCH(c); ------------------ | | 305| 0|#define PFETCH(c) do { \ | | 306| 0| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 0] | | ------------------ | | 307| 0| pfetch_prev = p; \ | | 308| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 309| 0|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 3372| 0| tok->u.repeat.greedy = 1; 3373| 0| tok->u.repeat.possessive = 1; 3374| 0| } 3375| 55.1k| else { 3376| 55.1k| tok->u.repeat.greedy = 1; 3377| 55.1k| tok->u.repeat.possessive = 0; 3378| 55.1k| } 3379| 55.1k| } 3380| 57.1k| break; 3381| | 3382| 57.1k| case '{': ------------------ | Branch (3382:5): [True: 0, False: 33.7k] ------------------ 3383| 0| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_BRACE_INTERVAL)) break; ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3383:11): [True: 0, False: 0] ------------------ 3384| 0| r = fetch_range_quantifier(&p, end, tok, env); 3385| 0| if (r < 0) return r; /* error */ ------------------ | Branch (3385:11): [True: 0, False: 0] ------------------ 3386| 0| if (r == 0) goto greedy_check; ------------------ | Branch (3386:11): [True: 0, False: 0] ------------------ 3387| 0| else if (r == 2) { /* {n} */ ------------------ | Branch (3387:16): [True: 0, False: 0] ------------------ 3388| 0| if (IS_SYNTAX_BV(syn, ONIG_SYN_FIXED_INTERVAL_IS_GREEDY_ONLY)) ------------------ | | 332| 0|#define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0) | | ------------------ | | | Branch (332:35): [True: 0, False: 0] | | ------------------ ------------------ 3389| 0| goto possessive_check; 3390| | 3391| 0| goto greedy_check; 3392| 0| } 3393| | /* r == 1 : normal char */ 3394| 0| break; 3395| | 3396| 0| case '|': ------------------ | Branch (3396:5): [True: 0, False: 33.7k] ------------------ 3397| 0| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_VBAR_ALT)) break; ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3397:11): [True: 0, False: 0] ------------------ 3398| 0| tok->type = TK_ALT; 3399| 0| break; 3400| | 3401| 3.73k| case '(': ------------------ | Branch (3401:5): [True: 3.73k, False: 30.0k] ------------------ 3402| 3.73k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_LPAREN_SUBEXP)) break; ------------------ | | 330| 3.73k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3402:11): [True: 3.73k, False: 0] ------------------ 3403| 0| tok->type = TK_SUBEXP_OPEN; 3404| 0| break; 3405| | 3406| 1.85k| case ')': ------------------ | Branch (3406:5): [True: 1.85k, False: 31.9k] ------------------ 3407| 1.85k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_LPAREN_SUBEXP)) break; ------------------ | | 330| 1.85k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3407:11): [True: 1.85k, False: 0] ------------------ 3408| 0| tok->type = TK_SUBEXP_CLOSE; 3409| 0| break; 3410| | 3411| 0| case 'w': ------------------ | Branch (3411:5): [True: 0, False: 33.7k] ------------------ 3412| 0| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_W_WORD)) break; ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3412:11): [True: 0, False: 0] ------------------ 3413| 0| tok->type = TK_CHAR_TYPE; 3414| 0| tok->u.prop.ctype = ONIGENC_CTYPE_WORD; ------------------ | | 306| 0|#define ONIGENC_CTYPE_WORD 12 ------------------ 3415| 0| tok->u.prop.not = 0; 3416| 0| break; 3417| | 3418| 0| case 'W': ------------------ | Branch (3418:5): [True: 0, False: 33.7k] ------------------ 3419| 0| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_W_WORD)) break; ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3419:11): [True: 0, False: 0] ------------------ 3420| 0| tok->type = TK_CHAR_TYPE; 3421| 0| tok->u.prop.ctype = ONIGENC_CTYPE_WORD; ------------------ | | 306| 0|#define ONIGENC_CTYPE_WORD 12 ------------------ 3422| 0| tok->u.prop.not = 1; 3423| 0| break; 3424| | 3425| 1.91k| case 'b': ------------------ | Branch (3425:5): [True: 1.91k, False: 31.8k] ------------------ 3426| 1.91k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_B_WORD_BOUND)) break; ------------------ | | 330| 1.91k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3426:11): [True: 0, False: 1.91k] ------------------ 3427| 1.91k| tok->type = TK_ANCHOR; 3428| 1.91k| tok->u.anchor.subtype = ANCHOR_WORD_BOUND; ------------------ | | 547| 1.91k|#define ANCHOR_WORD_BOUND (1<<6) ------------------ 3429| 1.91k| tok->u.anchor.ascii_range = IS_ASCII_RANGE(env->option) ------------------ | | 406| 3.83k|#define IS_ASCII_RANGE(option) ((option) & ONIG_OPTION_ASCII_RANGE) | | ------------------ | | | | 470| 1.91k|#define ONIG_OPTION_ASCII_RANGE (ONIG_OPTION_NOTEOS << 1) | | | | ------------------ | | | | | | 468| 1.91k|#define ONIG_OPTION_NOTEOS (ONIG_OPTION_NOTBOS << 1) | | | | | | ------------------ | | | | | | | | 467| 1.91k|#define ONIG_OPTION_NOTBOS (ONIG_OPTION_NOTEOL << 1) | | | | | | | | ------------------ | | | | | | | | | | 466| 1.91k|#define ONIG_OPTION_NOTEOL (ONIG_OPTION_NOTBOL << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 465| 1.91k|#define ONIG_OPTION_NOTBOL (ONIG_OPTION_CAPTURE_GROUP << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 463| 1.91k|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 462| 1.91k|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 461| 1.91k|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | 460| 1.91k|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | 459| 1.91k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | 458| 1.91k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | 456| 1.91k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 455| 1.91k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 454| 1.91k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (406:35): [True: 1.91k, False: 0] | | ------------------ ------------------ 3430| 1.91k| && ! IS_WORD_BOUND_ALL_RANGE(env->option); ------------------ | | 408| 3.83k|#define IS_WORD_BOUND_ALL_RANGE(option) ((option) & ONIG_OPTION_WORD_BOUND_ALL_RANGE) | | ------------------ | | | | 472| 1.91k|#define ONIG_OPTION_WORD_BOUND_ALL_RANGE (ONIG_OPTION_POSIX_BRACKET_ALL_RANGE << 1) | | | | ------------------ | | | | | | 471| 1.91k|#define ONIG_OPTION_POSIX_BRACKET_ALL_RANGE (ONIG_OPTION_ASCII_RANGE << 1) | | | | | | ------------------ | | | | | | | | 470| 1.91k|#define ONIG_OPTION_ASCII_RANGE (ONIG_OPTION_NOTEOS << 1) | | | | | | | | ------------------ | | | | | | | | | | 468| 1.91k|#define ONIG_OPTION_NOTEOS (ONIG_OPTION_NOTBOS << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 467| 1.91k|#define ONIG_OPTION_NOTBOS (ONIG_OPTION_NOTEOL << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 466| 1.91k|#define ONIG_OPTION_NOTEOL (ONIG_OPTION_NOTBOL << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 465| 1.91k|#define ONIG_OPTION_NOTBOL (ONIG_OPTION_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 463| 1.91k|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | 462| 1.91k|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | 461| 1.91k|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | 460| 1.91k|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | 459| 1.91k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 458| 1.91k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 456| 1.91k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 455| 1.91k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 454| 1.91k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ | Branch (3430:6): [True: 0, False: 1.91k] ------------------ 3431| 1.91k| break; 3432| | 3433| 0| case 'B': ------------------ | Branch (3433:5): [True: 0, False: 33.7k] ------------------ 3434| 0| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_B_WORD_BOUND)) break; ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3434:11): [True: 0, False: 0] ------------------ 3435| 0| tok->type = TK_ANCHOR; 3436| 0| tok->u.anchor.subtype = ANCHOR_NOT_WORD_BOUND; ------------------ | | 548| 0|#define ANCHOR_NOT_WORD_BOUND (1<<7) ------------------ 3437| 0| tok->u.anchor.ascii_range = IS_ASCII_RANGE(env->option) ------------------ | | 406| 0|#define IS_ASCII_RANGE(option) ((option) & ONIG_OPTION_ASCII_RANGE) | | ------------------ | | | | 470| 0|#define ONIG_OPTION_ASCII_RANGE (ONIG_OPTION_NOTEOS << 1) | | | | ------------------ | | | | | | 468| 0|#define ONIG_OPTION_NOTEOS (ONIG_OPTION_NOTBOS << 1) | | | | | | ------------------ | | | | | | | | 467| 0|#define ONIG_OPTION_NOTBOS (ONIG_OPTION_NOTEOL << 1) | | | | | | | | ------------------ | | | | | | | | | | 466| 0|#define ONIG_OPTION_NOTEOL (ONIG_OPTION_NOTBOL << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 465| 0|#define ONIG_OPTION_NOTBOL (ONIG_OPTION_CAPTURE_GROUP << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 463| 0|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 462| 0|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 461| 0|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | 460| 0|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | 459| 0|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | 458| 0|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | 456| 0|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 455| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 454| 0|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (406:35): [True: 0, False: 0] | | ------------------ ------------------ 3438| 0| && ! IS_WORD_BOUND_ALL_RANGE(env->option); ------------------ | | 408| 0|#define IS_WORD_BOUND_ALL_RANGE(option) ((option) & ONIG_OPTION_WORD_BOUND_ALL_RANGE) | | ------------------ | | | | 472| 0|#define ONIG_OPTION_WORD_BOUND_ALL_RANGE (ONIG_OPTION_POSIX_BRACKET_ALL_RANGE << 1) | | | | ------------------ | | | | | | 471| 0|#define ONIG_OPTION_POSIX_BRACKET_ALL_RANGE (ONIG_OPTION_ASCII_RANGE << 1) | | | | | | ------------------ | | | | | | | | 470| 0|#define ONIG_OPTION_ASCII_RANGE (ONIG_OPTION_NOTEOS << 1) | | | | | | | | ------------------ | | | | | | | | | | 468| 0|#define ONIG_OPTION_NOTEOS (ONIG_OPTION_NOTBOS << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 467| 0|#define ONIG_OPTION_NOTBOS (ONIG_OPTION_NOTEOL << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 466| 0|#define ONIG_OPTION_NOTEOL (ONIG_OPTION_NOTBOL << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 465| 0|#define ONIG_OPTION_NOTBOL (ONIG_OPTION_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 463| 0|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | 462| 0|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | 461| 0|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | 460| 0|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | 459| 0|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 458| 0|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 456| 0|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 455| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 454| 0|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ | Branch (3438:6): [True: 0, False: 0] ------------------ 3439| 0| break; 3440| | 3441| 0|#ifdef USE_WORD_BEGIN_END 3442| 0| case '<': ------------------ | Branch (3442:5): [True: 0, False: 33.7k] ------------------ 3443| 0| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_LTGT_WORD_BEGIN_END)) break; ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3443:11): [True: 0, False: 0] ------------------ 3444| 0| tok->type = TK_ANCHOR; 3445| 0| tok->u.anchor.subtype = ANCHOR_WORD_BEGIN; ------------------ | | 549| 0|#define ANCHOR_WORD_BEGIN (1<<8) ------------------ 3446| 0| tok->u.anchor.ascii_range = IS_ASCII_RANGE(env->option); ------------------ | | 406| 0|#define IS_ASCII_RANGE(option) ((option) & ONIG_OPTION_ASCII_RANGE) | | ------------------ | | | | 470| 0|#define ONIG_OPTION_ASCII_RANGE (ONIG_OPTION_NOTEOS << 1) | | | | ------------------ | | | | | | 468| 0|#define ONIG_OPTION_NOTEOS (ONIG_OPTION_NOTBOS << 1) | | | | | | ------------------ | | | | | | | | 467| 0|#define ONIG_OPTION_NOTBOS (ONIG_OPTION_NOTEOL << 1) | | | | | | | | ------------------ | | | | | | | | | | 466| 0|#define ONIG_OPTION_NOTEOL (ONIG_OPTION_NOTBOL << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 465| 0|#define ONIG_OPTION_NOTBOL (ONIG_OPTION_CAPTURE_GROUP << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 463| 0|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 462| 0|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 461| 0|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | 460| 0|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | 459| 0|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | 458| 0|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | 456| 0|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 455| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 454| 0|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 3447| 0| break; 3448| | 3449| 0| case '>': ------------------ | Branch (3449:5): [True: 0, False: 33.7k] ------------------ 3450| 0| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_LTGT_WORD_BEGIN_END)) break; ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3450:11): [True: 0, False: 0] ------------------ 3451| 0| tok->type = TK_ANCHOR; 3452| 0| tok->u.anchor.subtype = ANCHOR_WORD_END; ------------------ | | 550| 0|#define ANCHOR_WORD_END (1<<9) ------------------ 3453| 0| tok->u.anchor.ascii_range = IS_ASCII_RANGE(env->option); ------------------ | | 406| 0|#define IS_ASCII_RANGE(option) ((option) & ONIG_OPTION_ASCII_RANGE) | | ------------------ | | | | 470| 0|#define ONIG_OPTION_ASCII_RANGE (ONIG_OPTION_NOTEOS << 1) | | | | ------------------ | | | | | | 468| 0|#define ONIG_OPTION_NOTEOS (ONIG_OPTION_NOTBOS << 1) | | | | | | ------------------ | | | | | | | | 467| 0|#define ONIG_OPTION_NOTBOS (ONIG_OPTION_NOTEOL << 1) | | | | | | | | ------------------ | | | | | | | | | | 466| 0|#define ONIG_OPTION_NOTEOL (ONIG_OPTION_NOTBOL << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 465| 0|#define ONIG_OPTION_NOTBOL (ONIG_OPTION_CAPTURE_GROUP << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 463| 0|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 462| 0|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 461| 0|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | 460| 0|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | 459| 0|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | 458| 0|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | 456| 0|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 455| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 454| 0|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 3454| 0| break; 3455| 0|#endif 3456| | 3457| 9.33k| case 's': ------------------ | Branch (3457:5): [True: 9.33k, False: 24.4k] ------------------ 3458| 9.33k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_S_WHITE_SPACE)) break; ------------------ | | 330| 9.33k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3458:11): [True: 0, False: 9.33k] ------------------ 3459| 9.33k| tok->type = TK_CHAR_TYPE; 3460| 9.33k| tok->u.prop.ctype = ONIGENC_CTYPE_SPACE; ------------------ | | 303| 9.33k|#define ONIGENC_CTYPE_SPACE 9 ------------------ 3461| 9.33k| tok->u.prop.not = 0; 3462| 9.33k| break; 3463| | 3464| 0| case 'S': ------------------ | Branch (3464:5): [True: 0, False: 33.7k] ------------------ 3465| 0| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_S_WHITE_SPACE)) break; ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3465:11): [True: 0, False: 0] ------------------ 3466| 0| tok->type = TK_CHAR_TYPE; 3467| 0| tok->u.prop.ctype = ONIGENC_CTYPE_SPACE; ------------------ | | 303| 0|#define ONIGENC_CTYPE_SPACE 9 ------------------ 3468| 0| tok->u.prop.not = 1; 3469| 0| break; 3470| | 3471| 7.56k| case 'd': ------------------ | Branch (3471:5): [True: 7.56k, False: 26.2k] ------------------ 3472| 7.56k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_D_DIGIT)) break; ------------------ | | 330| 7.56k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3472:11): [True: 0, False: 7.56k] ------------------ 3473| 7.56k| tok->type = TK_CHAR_TYPE; 3474| 7.56k| tok->u.prop.ctype = ONIGENC_CTYPE_DIGIT; ------------------ | | 298| 7.56k|#define ONIGENC_CTYPE_DIGIT 4 ------------------ 3475| 7.56k| tok->u.prop.not = 0; 3476| 7.56k| break; 3477| | 3478| 0| case 'D': ------------------ | Branch (3478:5): [True: 0, False: 33.7k] ------------------ 3479| 0| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_D_DIGIT)) break; ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3479:11): [True: 0, False: 0] ------------------ 3480| 0| tok->type = TK_CHAR_TYPE; 3481| 0| tok->u.prop.ctype = ONIGENC_CTYPE_DIGIT; ------------------ | | 298| 0|#define ONIGENC_CTYPE_DIGIT 4 ------------------ 3482| 0| tok->u.prop.not = 1; 3483| 0| break; 3484| | 3485| 0| case 'h': ------------------ | Branch (3485:5): [True: 0, False: 33.7k] ------------------ 3486| 0| if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_H_XDIGIT)) break; ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) ------------------ | Branch (3486:11): [True: 0, False: 0] ------------------ 3487| 0| tok->type = TK_CHAR_TYPE; 3488| 0| tok->u.prop.ctype = ONIGENC_CTYPE_XDIGIT; ------------------ | | 305| 0|#define ONIGENC_CTYPE_XDIGIT 11 ------------------ 3489| 0| tok->u.prop.not = 0; 3490| 0| break; 3491| | 3492| 0| case 'H': ------------------ | Branch (3492:5): [True: 0, False: 33.7k] ------------------ 3493| 0| if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_H_XDIGIT)) break; ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) ------------------ | Branch (3493:11): [True: 0, False: 0] ------------------ 3494| 0| tok->type = TK_CHAR_TYPE; 3495| 0| tok->u.prop.ctype = ONIGENC_CTYPE_XDIGIT; ------------------ | | 305| 0|#define ONIGENC_CTYPE_XDIGIT 11 ------------------ 3496| 0| tok->u.prop.not = 1; 3497| 0| break; 3498| | 3499| 0| case 'A': ------------------ | Branch (3499:5): [True: 0, False: 33.7k] ------------------ 3500| 0| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_AZ_BUF_ANCHOR)) break; ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3500:11): [True: 0, False: 0] ------------------ 3501| 0| begin_buf: 3502| 0| tok->type = TK_ANCHOR; 3503| 0| tok->u.anchor.subtype = ANCHOR_BEGIN_BUF; ------------------ | | 540| 0|#define ANCHOR_BEGIN_BUF (1<<0) ------------------ 3504| 0| break; 3505| | 3506| 0| case 'Z': ------------------ | Branch (3506:5): [True: 0, False: 33.7k] ------------------ 3507| 0| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_AZ_BUF_ANCHOR)) break; ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3507:11): [True: 0, False: 0] ------------------ 3508| 0| tok->type = TK_ANCHOR; 3509| 0| tok->u.anchor.subtype = ANCHOR_SEMI_END_BUF; ------------------ | | 544| 0|#define ANCHOR_SEMI_END_BUF (1<<4) ------------------ 3510| 0| break; 3511| | 3512| 0| case 'z': ------------------ | Branch (3512:5): [True: 0, False: 33.7k] ------------------ 3513| 0| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_AZ_BUF_ANCHOR)) break; ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3513:11): [True: 0, False: 0] ------------------ 3514| 0| end_buf: 3515| 0| tok->type = TK_ANCHOR; 3516| 0| tok->u.anchor.subtype = ANCHOR_END_BUF; ------------------ | | 543| 0|#define ANCHOR_END_BUF (1<<3) ------------------ 3517| 0| break; 3518| | 3519| 0| case 'G': ------------------ | Branch (3519:5): [True: 0, False: 33.7k] ------------------ 3520| 0| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_CAPITAL_G_BEGIN_ANCHOR)) break; ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3520:11): [True: 0, False: 0] ------------------ 3521| 0| tok->type = TK_ANCHOR; 3522| 0| tok->u.anchor.subtype = ANCHOR_BEGIN_POSITION; ------------------ | | 542| 0|#define ANCHOR_BEGIN_POSITION (1<<2) ------------------ 3523| 0| break; 3524| | 3525| 0| case '`': ------------------ | Branch (3525:5): [True: 0, False: 33.7k] ------------------ 3526| 0| if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_GNU_BUF_ANCHOR)) break; ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) ------------------ | Branch (3526:11): [True: 0, False: 0] ------------------ 3527| 0| goto begin_buf; 3528| 0| break; 3529| | 3530| 0| case '\'': ------------------ | Branch (3530:5): [True: 0, False: 33.7k] ------------------ 3531| 0| if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_GNU_BUF_ANCHOR)) break; ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) ------------------ | Branch (3531:11): [True: 0, False: 0] ------------------ 3532| 0| goto end_buf; 3533| 0| break; 3534| | 3535| 0| case 'x': ------------------ | Branch (3535:5): [True: 0, False: 33.7k] ------------------ 3536| 0| if (PEND) break; ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 0] | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ 3537| | 3538| 0| prev = p; 3539| 0| if (PPEEK_IS('{') && IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_X_BRACE_HEX8)) { ------------------ | | 320| 0|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 0|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | | | ------------------ | | | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 291| 0|#define PEND_VALUE 0 | | | | ------------------ | | | | | Branch (319:23): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | | Branch (320:22): [True: 0, False: 0] | | ------------------ ------------------ if (PPEEK_IS('{') && IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_X_BRACE_HEX8)) { ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) | | ------------------ | | | Branch (330:35): [True: 0, False: 0] | | ------------------ ------------------ 3540| 0| PINC; ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3541| 0| num = scan_unsigned_hexadecimal_number(&p, end, 0, 8, enc); 3542| 0| if (num < 0) return ONIGERR_TOO_BIG_WIDE_CHAR_VALUE; ------------------ | | 694| 0|#define ONIGERR_TOO_BIG_WIDE_CHAR_VALUE -401 ------------------ | Branch (3542:6): [True: 0, False: 0] ------------------ 3543| 0| if (!PEND) { ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ | Branch (3543:6): [True: 0, False: 0] ------------------ 3544| 0| if (ONIGENC_IS_CODE_XDIGIT(enc, PPEEK)) ------------------ | | 402| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_XDIGIT) | | ------------------ | | | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (375:48): [True: 0, False: 0] | | | | | Branch (375:69): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 3545| 0| return ONIGERR_TOO_LONG_WIDE_CHAR_VALUE; ------------------ | | 681| 0|#define ONIGERR_TOO_LONG_WIDE_CHAR_VALUE -212 ------------------ 3546| 0| } 3547| | 3548| 0| if ((p > prev + enclen(enc, prev, end)) && !PEND && PPEEK_IS('}')) { ------------------ | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 0] | | ------------------ ------------------ if ((p > prev + enclen(enc, prev, end)) && !PEND && PPEEK_IS('}')) { ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ if ((p > prev + enclen(enc, prev, end)) && !PEND && PPEEK_IS('}')) { ------------------ | | 320| 0|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 0|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | | | ------------------ | | | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 291| 0|#define PEND_VALUE 0 | | | | ------------------ | | | | | Branch (319:23): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | | Branch (320:22): [True: 0, False: 0] | | ------------------ ------------------ | Branch (3548:6): [True: 0, False: 0] | Branch (3548:45): [True: 0, False: 0] ------------------ 3549| 0| PINC; ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3550| 0| tok->type = TK_CODE_POINT; 3551| 0| tok->u.code = (OnigCodePoint )num; 3552| 0| } 3553| 0| else { 3554| | /* can't read nothing or invalid format */ 3555| 0| p = prev; 3556| 0| } 3557| 0| } 3558| 0| else if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_X_HEX2)) { ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) | | ------------------ | | | Branch (330:35): [True: 0, False: 0] | | ------------------ ------------------ 3559| 0| num = scan_unsigned_hexadecimal_number(&p, end, 0, 2, enc); 3560| 0| if (num < 0) return ONIGERR_TOO_BIG_NUMBER; ------------------ | | 669| 0|#define ONIGERR_TOO_BIG_NUMBER -200 ------------------ | Branch (3560:6): [True: 0, False: 0] ------------------ 3561| 0| if (p == prev) { /* can't read nothing. */ ------------------ | Branch (3561:6): [True: 0, False: 0] ------------------ 3562| 0| num = 0; /* but, it's not error */ 3563| 0| } 3564| 0| tok->type = TK_RAW_BYTE; 3565| 0| tok->base = 16; 3566| 0| tok->u.c = num; 3567| 0| } 3568| 0| break; 3569| | 3570| 0| case 'u': ------------------ | Branch (3570:5): [True: 0, False: 33.7k] ------------------ 3571| 0| if (PEND) break; ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 0] | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ 3572| | 3573| 0| prev = p; 3574| 0| if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_U_HEX4)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 3575| 0| num = scan_unsigned_hexadecimal_number(&p, end, 4, 4, enc); 3576| 0| if (num < -1) return ONIGERR_TOO_SHORT_DIGITS; ------------------ | | 680| 0|#define ONIGERR_TOO_SHORT_DIGITS -211 ------------------ | Branch (3576:6): [True: 0, False: 0] ------------------ 3577| 0| else if (num < 0) return ONIGERR_TOO_BIG_NUMBER; ------------------ | | 669| 0|#define ONIGERR_TOO_BIG_NUMBER -200 ------------------ | Branch (3577:11): [True: 0, False: 0] ------------------ 3578| 0| if (p == prev) { /* can't read nothing. */ ------------------ | Branch (3578:6): [True: 0, False: 0] ------------------ 3579| 0| num = 0; /* but, it's not error */ 3580| 0| } 3581| 0| tok->type = TK_CODE_POINT; 3582| 0| tok->base = 16; 3583| 0| tok->u.code = (OnigCodePoint )num; 3584| 0| } 3585| 0| break; 3586| | 3587| 0| case 'o': ------------------ | Branch (3587:5): [True: 0, False: 33.7k] ------------------ 3588| 0| if (PEND) break; ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 0] | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ 3589| | 3590| 0| prev = p; 3591| 0| if (PPEEK_IS('{') && IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_O_BRACE_OCTAL)) { ------------------ | | 320| 0|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 0|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | | | ------------------ | | | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 291| 0|#define PEND_VALUE 0 | | | | ------------------ | | | | | Branch (319:23): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | | Branch (320:22): [True: 0, False: 0] | | ------------------ ------------------ if (PPEEK_IS('{') && IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_O_BRACE_OCTAL)) { ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) | | ------------------ | | | Branch (330:35): [True: 0, False: 0] | | ------------------ ------------------ 3592| 0| PINC; ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3593| 0| num = scan_unsigned_octal_number(&p, end, 11, enc); 3594| 0| if (num < 0) return ONIGERR_TOO_BIG_WIDE_CHAR_VALUE; ------------------ | | 694| 0|#define ONIGERR_TOO_BIG_WIDE_CHAR_VALUE -401 ------------------ | Branch (3594:6): [True: 0, False: 0] ------------------ 3595| 0| if (!PEND) { ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ | Branch (3595:6): [True: 0, False: 0] ------------------ 3596| 0| OnigCodePoint c = PPEEK; ------------------ | | 319| 0|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | ------------------ | | | | 291| 0|#define PEND_VALUE 0 | | ------------------ | | | Branch (319:23): [True: 0, False: 0] | | ------------------ ------------------ 3597| 0| if (ONIGENC_IS_CODE_DIGIT(enc, c) && c < '8') ------------------ | | 400| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_DIGIT) | | ------------------ | | | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (375:48): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ | Branch (3597:41): [True: 0, False: 0] ------------------ 3598| 0| return ONIGERR_TOO_LONG_WIDE_CHAR_VALUE; ------------------ | | 681| 0|#define ONIGERR_TOO_LONG_WIDE_CHAR_VALUE -212 ------------------ 3599| 0| } 3600| | 3601| 0| if ((p > prev + enclen(enc, prev, end)) && !PEND && PPEEK_IS('}')) { ------------------ | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 0] | | ------------------ ------------------ if ((p > prev + enclen(enc, prev, end)) && !PEND && PPEEK_IS('}')) { ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ if ((p > prev + enclen(enc, prev, end)) && !PEND && PPEEK_IS('}')) { ------------------ | | 320| 0|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 0|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | | | ------------------ | | | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 291| 0|#define PEND_VALUE 0 | | | | ------------------ | | | | | Branch (319:23): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | | Branch (320:22): [True: 0, False: 0] | | ------------------ ------------------ | Branch (3601:6): [True: 0, False: 0] | Branch (3601:45): [True: 0, False: 0] ------------------ 3602| 0| PINC; ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3603| 0| tok->type = TK_CODE_POINT; 3604| 0| tok->u.code = (OnigCodePoint )num; 3605| 0| } 3606| 0| else { 3607| | /* can't read nothing or invalid format */ 3608| 0| p = prev; 3609| 0| } 3610| 0| } 3611| 0| break; 3612| | 3613| 0| case '1': case '2': case '3': case '4': ------------------ | Branch (3613:5): [True: 0, False: 33.7k] | Branch (3613:15): [True: 0, False: 33.7k] | Branch (3613:25): [True: 0, False: 33.7k] | Branch (3613:35): [True: 0, False: 33.7k] ------------------ 3614| 0| case '5': case '6': case '7': case '8': case '9': ------------------ | Branch (3614:5): [True: 0, False: 33.7k] | Branch (3614:15): [True: 0, False: 33.7k] | Branch (3614:25): [True: 0, False: 33.7k] | Branch (3614:35): [True: 0, False: 33.7k] | Branch (3614:45): [True: 0, False: 33.7k] ------------------ 3615| 0| PUNFETCH; ------------------ | | 300| 0|#define PUNFETCH p = pfetch_prev ------------------ 3616| 0| prev = p; 3617| 0| num = onig_scan_unsigned_number(&p, end, enc); 3618| 0| if (num < 0 || num > ONIG_MAX_BACKREF_NUM) { ------------------ | | 442| 0|#define ONIG_MAX_BACKREF_NUM 1000 ------------------ | Branch (3618:11): [True: 0, False: 0] | Branch (3618:22): [True: 0, False: 0] ------------------ 3619| 0| goto skip_backref; 3620| 0| } 3621| | 3622| 0| if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_DECIMAL_BACKREF) && ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) | | ------------------ | | | Branch (330:35): [True: 0, False: 0] | | ------------------ ------------------ 3623| 0| (num <= env->num_mem || num <= 9)) { /* This spec. from GNU regex */ ------------------ | Branch (3623:5): [True: 0, False: 0] | Branch (3623:28): [True: 0, False: 0] ------------------ 3624| 0| if (IS_SYNTAX_BV(syn, ONIG_SYN_STRICT_CHECK_BACKREF)) { ------------------ | | 332| 0|#define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0) | | ------------------ | | | Branch (332:35): [True: 0, False: 0] | | ------------------ ------------------ 3625| 0| if (num > env->num_mem || IS_NULL(SCANENV_MEM_NODES(env)[num])) ------------------ | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 0] | | | Branch (311:49): [True: 0, False: 0] | | ------------------ ------------------ | Branch (3625:8): [True: 0, False: 0] ------------------ 3626| 0| return ONIGERR_INVALID_BACKREF; ------------------ | | 677| 0|#define ONIGERR_INVALID_BACKREF -208 ------------------ 3627| 0| } 3628| | 3629| 0| tok->type = TK_BACKREF; 3630| 0| tok->u.backref.num = 1; 3631| 0| tok->u.backref.ref1 = num; 3632| 0| tok->u.backref.by_name = 0; 3633| 0|#ifdef USE_BACKREF_WITH_LEVEL 3634| 0| tok->u.backref.exist_level = 0; 3635| 0|#endif 3636| 0| break; 3637| 0| } 3638| | 3639| 0| skip_backref: 3640| 0| if (c == '8' || c == '9') { ------------------ | Branch (3640:11): [True: 0, False: 0] | Branch (3640:23): [True: 0, False: 0] ------------------ 3641| | /* normal char */ 3642| 0| p = prev; PINC; ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3643| 0| break; 3644| 0| } 3645| | 3646| 0| p = prev; 3647| | /* fall through */ 3648| 0| case '0': ------------------ | Branch (3648:5): [True: 0, False: 33.7k] ------------------ 3649| 0| if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_OCTAL3)) { ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) | | ------------------ | | | Branch (330:35): [True: 0, False: 0] | | ------------------ ------------------ 3650| 0| prev = p; 3651| 0| num = scan_unsigned_octal_number(&p, end, (c == '0' ? 2:3), enc); ------------------ | Branch (3651:45): [True: 0, False: 0] ------------------ 3652| 0| if (num < 0 || 0xff < num) return ONIGERR_TOO_BIG_NUMBER; ------------------ | | 669| 0|#define ONIGERR_TOO_BIG_NUMBER -200 ------------------ | Branch (3652:6): [True: 0, False: 0] | Branch (3652:17): [True: 0, False: 0] ------------------ 3653| 0| if (p == prev) { /* can't read nothing. */ ------------------ | Branch (3653:6): [True: 0, False: 0] ------------------ 3654| 0| num = 0; /* but, it's not error */ 3655| 0| } 3656| 0| tok->type = TK_RAW_BYTE; 3657| 0| tok->base = 8; 3658| 0| tok->u.c = num; 3659| 0| } 3660| 0| else if (c != '0') { ------------------ | Branch (3660:16): [True: 0, False: 0] ------------------ 3661| 0| PINC; ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3662| 0| } 3663| 0| break; 3664| | 3665| 0|#ifdef USE_NAMED_GROUP 3666| 0| case 'k': ------------------ | Branch (3666:5): [True: 0, False: 33.7k] ------------------ 3667| 0| if (!PEND && IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_K_NAMED_BACKREF)) { ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ if (!PEND && IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_K_NAMED_BACKREF)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ | Branch (3667:11): [True: 0, False: 0] ------------------ 3668| 0| PFETCH(c); ------------------ | | 305| 0|#define PFETCH(c) do { \ | | 306| 0| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 0] | | ------------------ | | 307| 0| pfetch_prev = p; \ | | 308| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 309| 0|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 3669| 0| if (c == '<' || c == '\'') { ------------------ | Branch (3669:6): [True: 0, False: 0] | Branch (3669:18): [True: 0, False: 0] ------------------ 3670| 0| r = fetch_named_backref_token(c, tok, &p, end, env); 3671| 0| if (r < 0) return r; ------------------ | Branch (3671:8): [True: 0, False: 0] ------------------ 3672| 0| } 3673| 0| else { 3674| 0| PUNFETCH; ------------------ | | 300| 0|#define PUNFETCH p = pfetch_prev ------------------ 3675| 0| onig_syntax_warn(env, "invalid back reference"); 3676| 0| } 3677| 0| } 3678| 0| break; 3679| 0|#endif 3680| | 3681| 0|#if defined(USE_SUBEXP_CALL) || defined(USE_NAMED_GROUP) 3682| 0| case 'g': ------------------ | Branch (3682:5): [True: 0, False: 33.7k] ------------------ 3683| 0|# ifdef USE_NAMED_GROUP 3684| 0| if (!PEND && IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_G_BRACE_BACKREF)) { ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ if (!PEND && IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_G_BRACE_BACKREF)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ | Branch (3684:11): [True: 0, False: 0] ------------------ 3685| 0| PFETCH(c); ------------------ | | 305| 0|#define PFETCH(c) do { \ | | 306| 0| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 0] | | ------------------ | | 307| 0| pfetch_prev = p; \ | | 308| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 309| 0|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 3686| 0| if (c == '{') { ------------------ | Branch (3686:6): [True: 0, False: 0] ------------------ 3687| 0| r = fetch_named_backref_token(c, tok, &p, end, env); 3688| 0| if (r < 0) return r; ------------------ | Branch (3688:8): [True: 0, False: 0] ------------------ 3689| 0| } 3690| 0| else 3691| 0| PUNFETCH; ------------------ | | 300| 0|#define PUNFETCH p = pfetch_prev ------------------ 3692| 0| } 3693| 0|# endif 3694| 0|# ifdef USE_SUBEXP_CALL 3695| 0| if (!PEND && IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_G_SUBEXP_CALL)) { ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ if (!PEND && IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_G_SUBEXP_CALL)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ | Branch (3695:11): [True: 0, False: 0] ------------------ 3696| 0| PFETCH(c); ------------------ | | 305| 0|#define PFETCH(c) do { \ | | 306| 0| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 0] | | ------------------ | | 307| 0| pfetch_prev = p; \ | | 308| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 309| 0|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 3697| 0| if (c == '<' || c == '\'') { ------------------ | Branch (3697:6): [True: 0, False: 0] | Branch (3697:18): [True: 0, False: 0] ------------------ 3698| 0| int gnum = -1, rel = 0; 3699| 0| UChar* name_end; ------------------ | | 76| 0|# define UChar OnigUChar ------------------ 3700| 0| OnigCodePoint cnext; 3701| | 3702| 0| cnext = PPEEK; ------------------ | | 319| 0|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | ------------------ | | | | 291| 0|#define PEND_VALUE 0 | | ------------------ | | | Branch (319:23): [True: 0, False: 0] | | ------------------ ------------------ 3703| 0| if (cnext == '0') { ------------------ | Branch (3703:8): [True: 0, False: 0] ------------------ 3704| 0| PINC; ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3705| 0| if (PPEEK_IS(get_name_end_code_point(c))) { /* \g<0>, \g'0' */ ------------------ | | 320| 0|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 0|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | | | ------------------ | | | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 291| 0|#define PEND_VALUE 0 | | | | ------------------ | | | | | Branch (319:23): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | | Branch (320:22): [True: 0, False: 0] | | ------------------ ------------------ 3706| 0| PINC; ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3707| 0| name_end = p; 3708| 0| gnum = 0; 3709| 0| } 3710| 0| } 3711| 0| else if (cnext == '+') { ------------------ | Branch (3711:13): [True: 0, False: 0] ------------------ 3712| 0| PINC; ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3713| 0| rel = 1; 3714| 0| } 3715| 0| prev = p; 3716| 0| if (gnum < 0) { ------------------ | Branch (3716:8): [True: 0, False: 0] ------------------ 3717| 0| r = fetch_name((OnigCodePoint )c, &p, end, &name_end, env, &gnum, 1); 3718| 0| if (r < 0) return r; ------------------ | Branch (3718:10): [True: 0, False: 0] ------------------ 3719| 0| } 3720| | 3721| 0| tok->type = TK_CALL; 3722| 0| tok->u.call.name = prev; 3723| 0| tok->u.call.name_end = name_end; 3724| 0| tok->u.call.gnum = gnum; 3725| 0| tok->u.call.rel = rel; 3726| 0| } 3727| 0| else { 3728| 0| onig_syntax_warn(env, "invalid subexp call"); 3729| 0| PUNFETCH; ------------------ | | 300| 0|#define PUNFETCH p = pfetch_prev ------------------ 3730| 0| } 3731| 0| } 3732| 0|# endif 3733| 0| break; 3734| 0|#endif 3735| | 3736| 0| case 'Q': ------------------ | Branch (3736:5): [True: 0, False: 33.7k] ------------------ 3737| 0| if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_CAPITAL_Q_QUOTE)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 3738| 0| tok->type = TK_QUOTE_OPEN; 3739| 0| } 3740| 0| break; 3741| | 3742| 0| case 'p': ------------------ | Branch (3742:5): [True: 0, False: 33.7k] ------------------ 3743| 0| case 'P': ------------------ | Branch (3743:5): [True: 0, False: 33.7k] ------------------ 3744| 0| if (PPEEK_IS('{') && ------------------ | | 320| 0|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 0|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | | | ------------------ | | | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 291| 0|#define PEND_VALUE 0 | | | | ------------------ | | | | | Branch (319:23): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | | Branch (320:22): [True: 0, False: 0] | | ------------------ ------------------ 3745| 0| IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_P_BRACE_CHAR_PROPERTY)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 3746| 0| PINC; ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3747| 0| tok->type = TK_CHAR_PROPERTY; 3748| 0| tok->u.prop.not = (c == 'P' ? 1 : 0); ------------------ | Branch (3748:21): [True: 0, False: 0] ------------------ 3749| | 3750| 0| if (!PEND && IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_P_BRACE_CIRCUMFLEX_NOT)) { ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ if (!PEND && IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_P_BRACE_CIRCUMFLEX_NOT)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ | Branch (3750:6): [True: 0, False: 0] ------------------ 3751| 0| PFETCH(c); ------------------ | | 305| 0|#define PFETCH(c) do { \ | | 306| 0| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 0] | | ------------------ | | 307| 0| pfetch_prev = p; \ | | 308| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 309| 0|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 3752| 0| if (c == '^') { ------------------ | Branch (3752:8): [True: 0, False: 0] ------------------ 3753| 0| tok->u.prop.not = (tok->u.prop.not == 0 ? 1 : 0); ------------------ | Branch (3753:25): [True: 0, False: 0] ------------------ 3754| 0| } 3755| 0| else 3756| 0| PUNFETCH; ------------------ | | 300| 0|#define PUNFETCH p = pfetch_prev ------------------ 3757| 0| } 3758| 0| } 3759| 0| else { 3760| 0| onig_syntax_warn(env, "invalid Unicode Property \\%c", c); 3761| 0| } 3762| 0| break; 3763| | 3764| 0| case 'R': ------------------ | Branch (3764:5): [True: 0, False: 33.7k] ------------------ 3765| 0| if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_CAPITAL_R_LINEBREAK)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 3766| 0| tok->type = TK_LINEBREAK; 3767| 0| } 3768| 0| break; 3769| | 3770| 0| case 'X': ------------------ | Branch (3770:5): [True: 0, False: 33.7k] ------------------ 3771| 0| if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_CAPITAL_X_EXTENDED_GRAPHEME_CLUSTER)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 3772| 0| tok->type = TK_EXTENDED_GRAPHEME_CLUSTER; 3773| 0| } 3774| 0| break; 3775| | 3776| 0| case 'K': ------------------ | Branch (3776:5): [True: 0, False: 33.7k] ------------------ 3777| 0| if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_CAPITAL_K_KEEP)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 3778| 0| tok->type = TK_KEEP; 3779| 0| } 3780| 0| break; 3781| | 3782| 9.39k| default: ------------------ | Branch (3782:5): [True: 9.39k, False: 24.4k] ------------------ 3783| 9.39k| { 3784| 9.39k| OnigCodePoint c2; 3785| | 3786| 9.39k| PUNFETCH; ------------------ | | 300| 9.39k|#define PUNFETCH p = pfetch_prev ------------------ 3787| 9.39k| num = fetch_escaped_value(&p, end, env, &c2); 3788| 9.39k| if (num < 0) return num; ------------------ | Branch (3788:6): [True: 0, False: 9.39k] ------------------ 3789| | /* set_raw: */ 3790| 9.39k| if ((OnigCodePoint )tok->u.c != c2) { ------------------ | Branch (3790:6): [True: 0, False: 9.39k] ------------------ 3791| 0| tok->type = TK_CODE_POINT; 3792| 0| tok->u.code = (OnigCodePoint )c2; 3793| 0| } 3794| 9.39k| else { /* string */ 3795| 9.39k| p = tok->backp + enclen(enc, tok->backp, end); ------------------ | | 93| 9.39k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 364| 9.39k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 9.39k] | | ------------------ ------------------ 3796| 9.39k| } 3797| 9.39k| } 3798| 0| break; 3799| 33.7k| } 3800| 33.7k| } 3801| 921k| else { 3802| 921k| tok->u.c = c; 3803| 921k| tok->escaped = 0; 3804| | 3805| 921k|#ifdef USE_VARIABLE_META_CHARS 3806| 921k| if ((c != ONIG_INEFFECTIVE_META_CHAR) && ------------------ | | 622| 921k|#define ONIG_INEFFECTIVE_META_CHAR 0 ------------------ | Branch (3806:9): [True: 921k, False: 0] ------------------ 3807| 921k| IS_SYNTAX_OP(syn, ONIG_SYN_OP_VARIABLE_META_CHARACTERS)) { ------------------ | | 330| 921k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) | | ------------------ | | | Branch (330:35): [True: 0, False: 921k] | | ------------------ ------------------ 3808| 0| if (c == MC_ANYCHAR(syn)) ------------------ | | 762| 0|#define MC_ANYCHAR(syn) (syn)->meta_char_table.anychar ------------------ | Branch (3808:11): [True: 0, False: 0] ------------------ 3809| 0| goto any_char; 3810| 0| else if (c == MC_ANYTIME(syn)) ------------------ | | 763| 0|#define MC_ANYTIME(syn) (syn)->meta_char_table.anytime ------------------ | Branch (3810:16): [True: 0, False: 0] ------------------ 3811| 0| goto anytime; 3812| 0| else if (c == MC_ZERO_OR_ONE_TIME(syn)) ------------------ | | 764| 0|#define MC_ZERO_OR_ONE_TIME(syn) (syn)->meta_char_table.zero_or_one_time ------------------ | Branch (3812:16): [True: 0, False: 0] ------------------ 3813| 0| goto zero_or_one_time; 3814| 0| else if (c == MC_ONE_OR_MORE_TIME(syn)) ------------------ | | 765| 0|#define MC_ONE_OR_MORE_TIME(syn) (syn)->meta_char_table.one_or_more_time ------------------ | Branch (3814:16): [True: 0, False: 0] ------------------ 3815| 0| goto one_or_more_time; 3816| 0| else if (c == MC_ANYCHAR_ANYTIME(syn)) { ------------------ | | 766| 0|#define MC_ANYCHAR_ANYTIME(syn) (syn)->meta_char_table.anychar_anytime ------------------ | Branch (3816:16): [True: 0, False: 0] ------------------ 3817| 0| tok->type = TK_ANYCHAR_ANYTIME; 3818| 0| goto out; 3819| 0| } 3820| 0| } 3821| 921k|#endif 3822| | 3823| 921k| switch (c) { 3824| 19.3k| case '.': ------------------ | Branch (3824:5): [True: 19.3k, False: 902k] ------------------ 3825| 19.3k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_DOT_ANYCHAR)) break; ------------------ | | 330| 19.3k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3825:11): [True: 0, False: 19.3k] ------------------ 3826| 19.3k|#ifdef USE_VARIABLE_META_CHARS 3827| 19.3k| any_char: 3828| 19.3k|#endif 3829| 19.3k| tok->type = TK_ANYCHAR; 3830| 19.3k| break; 3831| | 3832| 21.1k| case '*': ------------------ | Branch (3832:5): [True: 21.1k, False: 900k] ------------------ 3833| 21.1k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ASTERISK_ZERO_INF)) break; ------------------ | | 330| 21.1k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3833:11): [True: 0, False: 21.1k] ------------------ 3834| 21.1k|#ifdef USE_VARIABLE_META_CHARS 3835| 21.1k| anytime: 3836| 21.1k|#endif 3837| 21.1k| tok->type = TK_OP_REPEAT; 3838| 21.1k| tok->u.repeat.lower = 0; 3839| 21.1k| tok->u.repeat.upper = REPEAT_INFINITE; ------------------ | | 421| 21.1k|#define REPEAT_INFINITE -1 ------------------ 3840| 21.1k| goto greedy_check; 3841| 0| break; 3842| | 3843| 34.0k| case '+': ------------------ | Branch (3843:5): [True: 34.0k, False: 887k] ------------------ 3844| 34.0k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_PLUS_ONE_INF)) break; ------------------ | | 330| 34.0k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3844:11): [True: 0, False: 34.0k] ------------------ 3845| 34.0k|#ifdef USE_VARIABLE_META_CHARS 3846| 34.0k| one_or_more_time: 3847| 34.0k|#endif 3848| 34.0k| tok->type = TK_OP_REPEAT; 3849| 34.0k| tok->u.repeat.lower = 1; 3850| 34.0k| tok->u.repeat.upper = REPEAT_INFINITE; ------------------ | | 421| 34.0k|#define REPEAT_INFINITE -1 ------------------ 3851| 34.0k| goto greedy_check; 3852| 0| break; 3853| | 3854| 1.96k| case '?': ------------------ | Branch (3854:5): [True: 1.96k, False: 919k] ------------------ 3855| 1.96k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_QMARK_ZERO_ONE)) break; ------------------ | | 330| 1.96k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3855:11): [True: 0, False: 1.96k] ------------------ 3856| 1.96k|#ifdef USE_VARIABLE_META_CHARS 3857| 1.96k| zero_or_one_time: 3858| 1.96k|#endif 3859| 1.96k| tok->type = TK_OP_REPEAT; 3860| 1.96k| tok->u.repeat.lower = 0; 3861| 1.96k| tok->u.repeat.upper = 1; 3862| 1.96k| goto greedy_check; 3863| 0| break; 3864| | 3865| 0| case '{': ------------------ | Branch (3865:5): [True: 0, False: 921k] ------------------ 3866| 0| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_BRACE_INTERVAL)) break; ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3866:11): [True: 0, False: 0] ------------------ 3867| 0| r = fetch_range_quantifier(&p, end, tok, env); 3868| 0| if (r < 0) return r; /* error */ ------------------ | Branch (3868:11): [True: 0, False: 0] ------------------ 3869| 0| if (r == 0) goto greedy_check; ------------------ | Branch (3869:11): [True: 0, False: 0] ------------------ 3870| 0| else if (r == 2) { /* {n} */ ------------------ | Branch (3870:16): [True: 0, False: 0] ------------------ 3871| 0| if (IS_SYNTAX_BV(syn, ONIG_SYN_FIXED_INTERVAL_IS_GREEDY_ONLY)) ------------------ | | 332| 0|#define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0) | | ------------------ | | | Branch (332:35): [True: 0, False: 0] | | ------------------ ------------------ 3872| 0| goto possessive_check; 3873| | 3874| 0| goto greedy_check; 3875| 0| } 3876| | /* r == 1 : normal char */ 3877| 0| break; 3878| | 3879| 15.8k| case '|': ------------------ | Branch (3879:5): [True: 15.8k, False: 905k] ------------------ 3880| 15.8k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_VBAR_ALT)) break; ------------------ | | 330| 15.8k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3880:11): [True: 0, False: 15.8k] ------------------ 3881| 15.8k| tok->type = TK_ALT; 3882| 15.8k| break; 3883| | 3884| 23.6k| case '(': ------------------ | Branch (3884:5): [True: 23.6k, False: 898k] ------------------ 3885| 23.6k| if (PPEEK_IS('?') && ------------------ | | 320| 47.2k|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 23.6k|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 369| 23.6k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | | | ------------------ | | | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 291| 0|#define PEND_VALUE 0 | | | | ------------------ | | | | | Branch (319:23): [True: 23.6k, False: 0] | | | | ------------------ | | ------------------ | | | Branch (320:22): [True: 21.6k, False: 1.99k] | | ------------------ ------------------ 3886| 23.6k| IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_QMARK_GROUP_EFFECT)) { ------------------ | | 331| 21.6k|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 21.6k, False: 0] | | ------------------ ------------------ 3887| 21.6k| PINC; ------------------ | | 301| 21.6k|#define PINC do { \ | | 302| 21.6k| pfetch_prev = p; \ | | 303| 21.6k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 21.6k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 21.6k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 21.6k] | | | | ------------------ | | ------------------ | | 304| 21.6k|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3888| 21.6k| if (PPEEK_IS('#')) { ------------------ | | 320| 21.6k|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 21.6k|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 369| 21.6k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | | | ------------------ | | | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 291| 0|#define PEND_VALUE 0 | | | | ------------------ | | | | | Branch (319:23): [True: 21.6k, False: 0] | | | | ------------------ | | ------------------ | | | Branch (320:22): [True: 0, False: 21.6k] | | ------------------ ------------------ 3889| 0| PFETCH(c); ------------------ | | 305| 0|#define PFETCH(c) do { \ | | 306| 0| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 0] | | ------------------ | | 307| 0| pfetch_prev = p; \ | | 308| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 309| 0|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 3890| 0| while (1) { ------------------ | Branch (3890:11): [Folded - Ignored] ------------------ 3891| 0| if (PEND) return ONIGERR_END_PATTERN_IN_GROUP; ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 0] | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ if (PEND) return ONIGERR_END_PATTERN_IN_GROUP; ------------------ | | 662| 0|#define ONIGERR_END_PATTERN_IN_GROUP -118 ------------------ 3892| 0| PFETCH(c); ------------------ | | 305| 0|#define PFETCH(c) do { \ | | 306| 0| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 0] | | ------------------ | | 307| 0| pfetch_prev = p; \ | | 308| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 309| 0|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 3893| 0| if (c == MC_ESC(syn)) { ------------------ | | 761| 0|#define MC_ESC(syn) (syn)->meta_char_table.esc ------------------ | Branch (3893:10): [True: 0, False: 0] ------------------ 3894| 0| if (!PEND) PFETCH(c); ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ if (!PEND) PFETCH(c); ------------------ | | 305| 0|#define PFETCH(c) do { \ | | 306| 0| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 0] | | ------------------ | | 307| 0| pfetch_prev = p; \ | | 308| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 309| 0|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ | Branch (3894:12): [True: 0, False: 0] ------------------ 3895| 0| } 3896| 0| else { 3897| 0| if (c == ')') break; ------------------ | Branch (3897:12): [True: 0, False: 0] ------------------ 3898| 0| } 3899| 0| } 3900| 0| goto start; 3901| 0| } 3902| 21.6k|#ifdef USE_PERL_SUBEXP_CALL 3903| | /* (?&name), (?n), (?R), (?0), (?+n), (?-n) */ 3904| 21.6k| c = PPEEK; ------------------ | | 319| 21.6k|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | ------------------ | | | | 369| 21.6k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | ------------------ | | | | 291| 0|#define PEND_VALUE 0 | | ------------------ | | | Branch (319:23): [True: 21.6k, False: 0] | | ------------------ ------------------ 3905| 21.6k| if ((c == '&' || c == 'R' || ONIGENC_IS_CODE_DIGIT(enc, c)) && ------------------ | | 400| 21.6k| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_DIGIT) | | ------------------ | | | | 375| 21.6k|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (375:48): [True: 0, False: 21.6k] | | | | ------------------ | | ------------------ ------------------ | Branch (3905:7): [True: 0, False: 21.6k] | Branch (3905:19): [True: 0, False: 21.6k] ------------------ 3906| 21.6k| IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_SUBEXP_CALL)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 3907| | /* (?&name), (?n), (?R), (?0) */ 3908| 0| int gnum; 3909| 0| UChar *name; ------------------ | | 76| 0|# define UChar OnigUChar ------------------ 3910| 0| UChar *name_end; ------------------ | | 76| 0|# define UChar OnigUChar ------------------ 3911| | 3912| 0| if (c == 'R' || c == '0') { ------------------ | Branch (3912:8): [True: 0, False: 0] | Branch (3912:20): [True: 0, False: 0] ------------------ 3913| 0| PINC; /* skip 'R' / '0' */ ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3914| 0| if (!PPEEK_IS(')')) { ------------------ | | 320| 0|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 0|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | | | ------------------ | | | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 291| 0|#define PEND_VALUE 0 | | | | ------------------ | | | | | Branch (319:23): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ | Branch (3914:10): [True: 0, False: 0] ------------------ 3915| 0| r = ONIGERR_INVALID_GROUP_NAME; ------------------ | | 683| 0|#define ONIGERR_INVALID_GROUP_NAME -215 ------------------ 3916| 0| onig_scan_env_set_error_string(env, r, p - 1, p + 1); 3917| 0| return r; 3918| 0| } 3919| 0| PINC; /* skip ')' */ ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3920| 0| name_end = name = p; 3921| 0| gnum = 0; 3922| 0| } 3923| 0| else { 3924| 0| int numref = 1; 3925| 0| if (c == '&') { /* (?&name) */ ------------------ | Branch (3925:10): [True: 0, False: 0] ------------------ 3926| 0| PINC; ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3927| 0| numref = 0; /* don't allow number name */ 3928| 0| } 3929| 0| name = p; 3930| 0| r = fetch_name((OnigCodePoint )'(', &p, end, &name_end, env, &gnum, numref); 3931| 0| if (r < 0) return r; ------------------ | Branch (3931:10): [True: 0, False: 0] ------------------ 3932| 0| } 3933| | 3934| 0| tok->type = TK_CALL; 3935| 0| tok->u.call.name = name; 3936| 0| tok->u.call.name_end = name_end; 3937| 0| tok->u.call.gnum = gnum; 3938| 0| tok->u.call.rel = 0; 3939| 0| break; 3940| 0| } 3941| 21.6k| else if ((c == '-' || c == '+') && ------------------ | Branch (3941:12): [True: 0, False: 21.6k] | Branch (3941:24): [True: 0, False: 21.6k] ------------------ 3942| 21.6k| IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_SUBEXP_CALL)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 3943| | /* (?+n), (?-n) */ 3944| 0| int gnum; 3945| 0| UChar *name; ------------------ | | 76| 0|# define UChar OnigUChar ------------------ 3946| 0| UChar *name_end; ------------------ | | 76| 0|# define UChar OnigUChar ------------------ 3947| 0| OnigCodePoint cnext; 3948| 0| PFETCH_READY; ------------------ | | 295| 0|# define PFETCH_READY UChar* pfetch_prev = NULL; (void)pfetch_prev | | ------------------ | | | | 76| 0|# define UChar OnigUChar | | ------------------ ------------------ 3949| | 3950| 0| PINC; /* skip '-' / '+' */ ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3951| 0| cnext = PPEEK; ------------------ | | 319| 0|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | ------------------ | | | | 291| 0|#define PEND_VALUE 0 | | ------------------ | | | Branch (319:23): [True: 0, False: 0] | | ------------------ ------------------ 3952| 0| if (ONIGENC_IS_CODE_DIGIT(enc, cnext)) { ------------------ | | 400| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_DIGIT) | | ------------------ | | | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (375:48): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 3953| 0| if (c == '-') PUNFETCH; ------------------ | | 300| 0|#define PUNFETCH p = pfetch_prev ------------------ | Branch (3953:10): [True: 0, False: 0] ------------------ 3954| 0| name = p; 3955| 0| r = fetch_name((OnigCodePoint )'(', &p, end, &name_end, env, &gnum, 1); 3956| 0| if (r < 0) return r; ------------------ | Branch (3956:10): [True: 0, False: 0] ------------------ 3957| | 3958| 0| tok->type = TK_CALL; 3959| 0| tok->u.call.name = name; 3960| 0| tok->u.call.name_end = name_end; 3961| 0| tok->u.call.gnum = gnum; 3962| 0| tok->u.call.rel = 1; 3963| 0| break; 3964| 0| } 3965| 0| } 3966| 21.6k|#endif /* USE_PERL_SUBEXP_CALL */ 3967| 21.6k|#ifdef USE_CAPITAL_P_NAMED_GROUP 3968| 21.6k| if (PPEEK_IS('P') && ------------------ | | 320| 43.2k|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 21.6k|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 369| 21.6k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | | | ------------------ | | | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 291| 0|#define PEND_VALUE 0 | | | | ------------------ | | | | | Branch (319:23): [True: 21.6k, False: 0] | | | | ------------------ | | ------------------ | | | Branch (320:22): [True: 0, False: 21.6k] | | ------------------ ------------------ 3969| 21.6k| IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_CAPITAL_P_NAMED_GROUP)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 3970| 0| int gnum; 3971| 0| UChar *name; ------------------ | | 76| 0|# define UChar OnigUChar ------------------ 3972| 0| UChar *name_end; ------------------ | | 76| 0|# define UChar OnigUChar ------------------ 3973| 0| PFETCH_READY; ------------------ | | 295| 0|# define PFETCH_READY UChar* pfetch_prev = NULL; (void)pfetch_prev | | ------------------ | | | | 76| 0|# define UChar OnigUChar | | ------------------ ------------------ 3974| | 3975| 0| PINC; /* skip 'P' */ ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3976| 0| if (PEND) return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 0] | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ if (PEND) return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 663| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 3977| 0| PFETCH(c); ------------------ | | 305| 0|#define PFETCH(c) do { \ | | 306| 0| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 0] | | ------------------ | | 307| 0| pfetch_prev = p; \ | | 308| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 309| 0|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 3978| 0| if (c == '=') { /* (?P=name): backref */ ------------------ | Branch (3978:8): [True: 0, False: 0] ------------------ 3979| 0| r = fetch_named_backref_token((OnigCodePoint )'(', tok, &p, end, env); 3980| 0| if (r < 0) return r; ------------------ | Branch (3980:10): [True: 0, False: 0] ------------------ 3981| 0| break; 3982| 0| } 3983| 0| else if (c == '>') { /* (?P>name): subexp call */ ------------------ | Branch (3983:13): [True: 0, False: 0] ------------------ 3984| 0| name = p; 3985| 0| r = fetch_name((OnigCodePoint )'(', &p, end, &name_end, env, &gnum, 0); 3986| 0| if (r < 0) return r; ------------------ | Branch (3986:10): [True: 0, False: 0] ------------------ 3987| | 3988| 0| tok->type = TK_CALL; 3989| 0| tok->u.call.name = name; 3990| 0| tok->u.call.name_end = name_end; 3991| 0| tok->u.call.gnum = gnum; 3992| 0| tok->u.call.rel = 0; 3993| 0| break; 3994| 0| } 3995| 0| } 3996| 21.6k|#endif /* USE_CAPITAL_P_NAMED_GROUP */ 3997| 21.6k| PUNFETCH; ------------------ | | 300| 21.6k|#define PUNFETCH p = pfetch_prev ------------------ 3998| 21.6k| } 3999| | 4000| 23.6k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_LPAREN_SUBEXP)) break; ------------------ | | 330| 23.6k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (4000:11): [True: 0, False: 23.6k] ------------------ 4001| 23.6k| tok->type = TK_SUBEXP_OPEN; 4002| 23.6k| break; 4003| | 4004| 23.6k| case ')': ------------------ | Branch (4004:5): [True: 23.6k, False: 898k] ------------------ 4005| 23.6k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_LPAREN_SUBEXP)) break; ------------------ | | 330| 23.6k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (4005:11): [True: 0, False: 23.6k] ------------------ 4006| 23.6k| tok->type = TK_SUBEXP_CLOSE; 4007| 23.6k| break; 4008| | 4009| 38.2k| case '^': ------------------ | Branch (4009:5): [True: 38.2k, False: 883k] ------------------ 4010| 38.2k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_LINE_ANCHOR)) break; ------------------ | | 330| 38.2k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (4010:11): [True: 0, False: 38.2k] ------------------ 4011| 38.2k| tok->type = TK_ANCHOR; 4012| 38.2k| tok->u.anchor.subtype = (IS_SINGLELINE(env->option) ------------------ | | 394| 38.2k|#define IS_SINGLELINE(option) ((option) & ONIG_OPTION_SINGLELINE) | | ------------------ | | | | 458| 38.2k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | ------------------ | | | | | | 456| 38.2k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | ------------------ | | | | | | | | 455| 38.2k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | ------------------ | | | | | | | | | | 454| 38.2k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (394:35): [True: 0, False: 38.2k] | | ------------------ ------------------ 4013| 38.2k| ? ANCHOR_BEGIN_BUF : ANCHOR_BEGIN_LINE); ------------------ | | 540| 0|#define ANCHOR_BEGIN_BUF (1<<0) ------------------ ? ANCHOR_BEGIN_BUF : ANCHOR_BEGIN_LINE); ------------------ | | 541| 38.2k|#define ANCHOR_BEGIN_LINE (1<<1) ------------------ 4014| 38.2k| break; 4015| | 4016| 15.4k| case '$': ------------------ | Branch (4016:5): [True: 15.4k, False: 906k] ------------------ 4017| 15.4k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_LINE_ANCHOR)) break; ------------------ | | 330| 15.4k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (4017:11): [True: 0, False: 15.4k] ------------------ 4018| 15.4k| tok->type = TK_ANCHOR; 4019| 15.4k| tok->u.anchor.subtype = (IS_SINGLELINE(env->option) ------------------ | | 394| 15.4k|#define IS_SINGLELINE(option) ((option) & ONIG_OPTION_SINGLELINE) | | ------------------ | | | | 458| 15.4k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | ------------------ | | | | | | 456| 15.4k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | ------------------ | | | | | | | | 455| 15.4k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | ------------------ | | | | | | | | | | 454| 15.4k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (394:35): [True: 0, False: 15.4k] | | ------------------ ------------------ 4020| 15.4k| ? ANCHOR_SEMI_END_BUF : ANCHOR_END_LINE); ------------------ | | 544| 0|#define ANCHOR_SEMI_END_BUF (1<<4) ------------------ ? ANCHOR_SEMI_END_BUF : ANCHOR_END_LINE); ------------------ | | 545| 15.4k|#define ANCHOR_END_LINE (1<<5) ------------------ 4021| 15.4k| break; 4022| | 4023| 28.7k| case '[': ------------------ | Branch (4023:5): [True: 28.7k, False: 892k] ------------------ 4024| 28.7k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_BRACKET_CC)) break; ------------------ | | 330| 28.7k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (4024:11): [True: 0, False: 28.7k] ------------------ 4025| 28.7k| tok->type = TK_CC_OPEN; 4026| 28.7k| break; 4027| | 4028| 0| case ']': ------------------ | Branch (4028:5): [True: 0, False: 921k] ------------------ 4029| 0| if (*src > env->pattern) /* /].../ is allowed. */ ------------------ | Branch (4029:11): [True: 0, False: 0] ------------------ 4030| 0| CLOSE_BRACKET_WITHOUT_ESC_WARN(env, (UChar* )"]"); 4031| 0| break; 4032| | 4033| 0| case '#': ------------------ | Branch (4033:5): [True: 0, False: 921k] ------------------ 4034| 0| if (IS_EXTEND(env->option)) { ------------------ | | 397| 0|#define IS_EXTEND(option) ((option) & ONIG_OPTION_EXTEND) | | ------------------ | | | | 455| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | ------------------ | | | | | | 454| 0|#define ONIG_OPTION_IGNORECASE 1U | | | | ------------------ | | ------------------ | | | Branch (397:35): [True: 0, False: 0] | | ------------------ ------------------ 4035| 0| while (!PEND) { ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ | Branch (4035:9): [True: 0, False: 0] ------------------ 4036| 0| PFETCH(c); ------------------ | | 305| 0|#define PFETCH(c) do { \ | | 306| 0| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 0] | | ------------------ | | 307| 0| pfetch_prev = p; \ | | 308| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 309| 0|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 4037| 0| if (ONIGENC_IS_CODE_NEWLINE(enc, c)) ------------------ | | 378| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_NEWLINE) | | ------------------ | | | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (375:48): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 4038| 0| break; 4039| 0| } 4040| 0| goto start; 4041| 0| break; 4042| 0| } 4043| 0| break; 4044| | 4045| 91.3k| case ' ': case '\t': case '\n': case '\r': case '\f': ------------------ | Branch (4045:5): [True: 91.3k, False: 830k] | Branch (4045:15): [True: 0, False: 921k] | Branch (4045:26): [True: 0, False: 921k] | Branch (4045:37): [True: 0, False: 921k] | Branch (4045:48): [True: 0, False: 921k] ------------------ 4046| 91.3k| if (IS_EXTEND(env->option)) ------------------ | | 397| 91.3k|#define IS_EXTEND(option) ((option) & ONIG_OPTION_EXTEND) | | ------------------ | | | | 455| 91.3k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | ------------------ | | | | | | 454| 91.3k|#define ONIG_OPTION_IGNORECASE 1U | | | | ------------------ | | ------------------ | | | Branch (397:35): [True: 0, False: 91.3k] | | ------------------ ------------------ 4047| 0| goto start; 4048| 91.3k| break; 4049| | 4050| 608k| default: ------------------ | Branch (4050:5): [True: 608k, False: 313k] ------------------ 4051| | /* string */ 4052| 608k| break; 4053| 921k| } 4054| 921k| } 4055| | 4056| 955k|#ifdef USE_VARIABLE_META_CHARS 4057| 955k| out: 4058| 955k|#endif 4059| 955k| *src = p; 4060| 955k| return tok->type; 4061| 955k|} regparse.c:get_name_end_code_point: 2495| 8.06k|{ 2496| 8.06k| switch (start) { 2497| 8.06k| case '<': return (OnigCodePoint )'>'; break; ------------------ | Branch (2497:3): [True: 8.06k, False: 0] ------------------ 2498| 0| case '\'': return (OnigCodePoint )'\''; break; ------------------ | Branch (2498:3): [True: 0, False: 8.06k] ------------------ 2499| 0| case '(': return (OnigCodePoint )')'; break; ------------------ | Branch (2499:3): [True: 0, False: 8.06k] ------------------ 2500| 0| case '{': return (OnigCodePoint )'}'; break; ------------------ | Branch (2500:3): [True: 0, False: 8.06k] ------------------ 2501| 0| default: ------------------ | Branch (2501:3): [True: 0, False: 8.06k] ------------------ 2502| 0| break; 2503| 8.06k| } 2504| | 2505| 0| return (OnigCodePoint )0; 2506| 8.06k|} regparse.c:fetch_name: 2644| 8.06k|{ 2645| 8.06k| int r, is_num, sign; 2646| 8.06k| OnigCodePoint end_code; 2647| 8.06k| OnigCodePoint c = 0; 2648| 8.06k| OnigEncoding enc = env->enc; 2649| 8.06k| UChar *name_end; ------------------ | | 76| 8.06k|# define UChar OnigUChar ------------------ 2650| 8.06k| UChar *pnum_head; ------------------ | | 76| 8.06k|# define UChar OnigUChar ------------------ 2651| 8.06k| UChar *p = *src; ------------------ | | 76| 8.06k|# define UChar OnigUChar ------------------ 2652| | 2653| 8.06k| *rback_num = 0; 2654| | 2655| 8.06k| end_code = get_name_end_code_point(start_code); 2656| | 2657| 8.06k| name_end = end; 2658| 8.06k| pnum_head = *src; 2659| 8.06k| r = 0; 2660| 8.06k| is_num = 0; 2661| 8.06k| sign = 1; 2662| 8.06k| if (PEND) { ------------------ | | 299| 8.06k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 8.06k] | | | Branch (299:23): [True: 8.06k, False: 0] | | ------------------ ------------------ 2663| 0| return ONIGERR_EMPTY_GROUP_NAME; ------------------ | | 682| 0|#define ONIGERR_EMPTY_GROUP_NAME -214 ------------------ 2664| 0| } 2665| 8.06k| else { 2666| 8.06k| PFETCH_S(c); ------------------ | | 314| 8.06k|#define PFETCH_S(c) do { \ | | 315| 8.06k| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 8.06k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (315:8): [True: 0, False: 8.06k] | | ------------------ | | 316| 8.06k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 8.06k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 8.06k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 8.06k] | | | | ------------------ | | ------------------ | | 317| 8.06k|} while (0) | | ------------------ | | | Branch (317:10): [Folded - Ignored] | | ------------------ ------------------ 2667| 8.06k| if (c == end_code) ------------------ | Branch (2667:9): [True: 0, False: 8.06k] ------------------ 2668| 0| return ONIGERR_EMPTY_GROUP_NAME; ------------------ | | 682| 0|#define ONIGERR_EMPTY_GROUP_NAME -214 ------------------ 2669| | 2670| 8.06k| if (ONIGENC_IS_CODE_DIGIT(enc, c)) { ------------------ | | 400| 8.06k| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_DIGIT) | | ------------------ | | | | 375| 8.06k|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (375:48): [True: 0, False: 8.06k] | | | | ------------------ | | ------------------ ------------------ 2671| 0| if (ref == 1) ------------------ | Branch (2671:11): [True: 0, False: 0] ------------------ 2672| 0| is_num = 1; 2673| 0| else { 2674| 0| r = ONIGERR_INVALID_GROUP_NAME; ------------------ | | 683| 0|#define ONIGERR_INVALID_GROUP_NAME -215 ------------------ 2675| 0| is_num = 0; 2676| 0| } 2677| 0| } 2678| 8.06k| else if (c == '-') { ------------------ | Branch (2678:14): [True: 0, False: 8.06k] ------------------ 2679| 0| if (ref == 1) { ------------------ | Branch (2679:11): [True: 0, False: 0] ------------------ 2680| 0| is_num = 2; 2681| 0| sign = -1; 2682| 0| pnum_head = p; 2683| 0| } 2684| 0| else { 2685| 0| r = ONIGERR_INVALID_GROUP_NAME; ------------------ | | 683| 0|#define ONIGERR_INVALID_GROUP_NAME -215 ------------------ 2686| 0| is_num = 0; 2687| 0| } 2688| 0| } 2689| 8.06k| else if (!ONIGENC_IS_CODE_NAME(enc, c)) { ------------------ | | 2512| 8.06k|# define ONIGENC_IS_CODE_NAME(enc, c) ONIGENC_IS_CODE_WORD(enc, c) | | ------------------ | | | | 404| 8.06k| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | | | ------------------ | | | | | | 375| 8.06k|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | ------------------ ------------------ | Branch (2689:14): [True: 0, False: 8.06k] ------------------ 2690| 0| r = ONIGERR_INVALID_CHAR_IN_GROUP_NAME; ------------------ | | 684| 0|#define ONIGERR_INVALID_CHAR_IN_GROUP_NAME -216 ------------------ 2691| 0| } 2692| 8.06k| } 2693| | 2694| 8.06k| if (r == 0) { ------------------ | Branch (2694:7): [True: 8.06k, False: 0] ------------------ 2695| 30.2k| while (!PEND) { ------------------ | | 299| 30.2k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 30.2k, False: 0] | | ------------------ ------------------ | Branch (2695:12): [True: 30.2k, False: 0] ------------------ 2696| 30.2k| name_end = p; 2697| 30.2k| PFETCH_S(c); ------------------ | | 314| 30.2k|#define PFETCH_S(c) do { \ | | 315| 30.2k| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 30.2k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (315:8): [True: 0, False: 30.2k] | | ------------------ | | 316| 30.2k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 30.2k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 30.2k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 30.2k] | | | | ------------------ | | ------------------ | | 317| 30.2k|} while (0) | | ------------------ | | | Branch (317:10): [Folded - Ignored] | | ------------------ ------------------ 2698| 30.2k| if (c == end_code || c == ')') { ------------------ | Branch (2698:11): [True: 8.06k, False: 22.1k] | Branch (2698:28): [True: 0, False: 22.1k] ------------------ 2699| 8.06k| if (is_num == 2) { ------------------ | Branch (2699:6): [True: 0, False: 8.06k] ------------------ 2700| 0| r = ONIGERR_INVALID_GROUP_NAME; ------------------ | | 683| 0|#define ONIGERR_INVALID_GROUP_NAME -215 ------------------ 2701| 0| goto teardown; 2702| 0| } 2703| 8.06k| break; 2704| 8.06k| } 2705| | 2706| 22.1k| if (is_num != 0) { ------------------ | Branch (2706:11): [True: 0, False: 22.1k] ------------------ 2707| 0| if (ONIGENC_IS_CODE_DIGIT(enc, c)) { ------------------ | | 400| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_DIGIT) | | ------------------ | | | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (375:48): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 2708| 0| is_num = 1; 2709| 0| } 2710| 0| else { 2711| 0| if (!ONIGENC_IS_CODE_WORD(enc, c)) ------------------ | | 404| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | ------------------ | | | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | ------------------ ------------------ | Branch (2711:8): [True: 0, False: 0] ------------------ 2712| 0| r = ONIGERR_INVALID_CHAR_IN_GROUP_NAME; ------------------ | | 684| 0|#define ONIGERR_INVALID_CHAR_IN_GROUP_NAME -216 ------------------ 2713| 0| else 2714| 0| r = ONIGERR_INVALID_GROUP_NAME; ------------------ | | 683| 0|#define ONIGERR_INVALID_GROUP_NAME -215 ------------------ 2715| 0| goto teardown; 2716| 0| } 2717| 0| } 2718| 22.1k| else { 2719| 22.1k| if (!ONIGENC_IS_CODE_NAME(enc, c)) { ------------------ | | 2512| 22.1k|# define ONIGENC_IS_CODE_NAME(enc, c) ONIGENC_IS_CODE_WORD(enc, c) | | ------------------ | | | | 404| 22.1k| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | | | ------------------ | | | | | | 375| 22.1k|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | ------------------ ------------------ | Branch (2719:6): [True: 0, False: 22.1k] ------------------ 2720| 0| r = ONIGERR_INVALID_CHAR_IN_GROUP_NAME; ------------------ | | 684| 0|#define ONIGERR_INVALID_CHAR_IN_GROUP_NAME -216 ------------------ 2721| 0| goto teardown; 2722| 0| } 2723| 22.1k| } 2724| 22.1k| } 2725| | 2726| 8.06k| if (c != end_code) { ------------------ | Branch (2726:9): [True: 0, False: 8.06k] ------------------ 2727| 0| r = ONIGERR_INVALID_GROUP_NAME; ------------------ | | 683| 0|#define ONIGERR_INVALID_GROUP_NAME -215 ------------------ 2728| 0| name_end = end; 2729| 0| goto err; 2730| 0| } 2731| | 2732| 8.06k| if (is_num != 0) { ------------------ | Branch (2732:9): [True: 0, False: 8.06k] ------------------ 2733| 0| *rback_num = onig_scan_unsigned_number(&pnum_head, name_end, enc); 2734| 0| if (*rback_num < 0) return ONIGERR_TOO_BIG_NUMBER; ------------------ | | 669| 0|#define ONIGERR_TOO_BIG_NUMBER -200 ------------------ | Branch (2734:11): [True: 0, False: 0] ------------------ 2735| 0| else if (*rback_num == 0) { ------------------ | Branch (2735:16): [True: 0, False: 0] ------------------ 2736| 0| r = ONIGERR_INVALID_GROUP_NAME; ------------------ | | 683| 0|#define ONIGERR_INVALID_GROUP_NAME -215 ------------------ 2737| 0| goto err; 2738| 0| } 2739| | 2740| 0| *rback_num *= sign; 2741| 0| } 2742| | 2743| 8.06k| *rname_end = name_end; 2744| 8.06k| *src = p; 2745| 8.06k| return 0; 2746| 8.06k| } 2747| 0| else { 2748| 0|teardown: 2749| 0| while (!PEND) { ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ | Branch (2749:12): [True: 0, False: 0] ------------------ 2750| 0| name_end = p; 2751| 0| PFETCH_S(c); ------------------ | | 314| 0|#define PFETCH_S(c) do { \ | | 315| 0| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (315:8): [True: 0, False: 0] | | ------------------ | | 316| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 317| 0|} while (0) | | ------------------ | | | Branch (317:10): [Folded - Ignored] | | ------------------ ------------------ 2752| 0| if (c == end_code || c == ')') ------------------ | Branch (2752:11): [True: 0, False: 0] | Branch (2752:28): [True: 0, False: 0] ------------------ 2753| 0| break; 2754| 0| } 2755| 0| if (PEND) ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 0] | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ 2756| 0| name_end = end; 2757| | 2758| 0| err: 2759| 0| onig_scan_env_set_error_string(env, r, *src, name_end); 2760| 0| return r; 2761| 0| } 2762| 8.06k|} regparse.c:fetch_escaped_value: 2422| 34.7k|{ 2423| 34.7k| int v; 2424| 34.7k| OnigCodePoint c; 2425| 34.7k| OnigEncoding enc = env->enc; 2426| 34.7k| UChar* p = *src; ------------------ | | 76| 34.7k|# define UChar OnigUChar ------------------ 2427| | 2428| 34.7k| if (PEND) return ONIGERR_END_PATTERN_AT_ESCAPE; ------------------ | | 299| 34.7k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 34.7k] | | | Branch (299:23): [True: 34.7k, False: 0] | | ------------------ ------------------ if (PEND) return ONIGERR_END_PATTERN_AT_ESCAPE; ------------------ | | 649| 0|#define ONIGERR_END_PATTERN_AT_ESCAPE -104 ------------------ 2429| | 2430| 34.7k| PFETCH_S(c); ------------------ | | 314| 34.7k|#define PFETCH_S(c) do { \ | | 315| 34.7k| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 34.7k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (315:8): [True: 0, False: 34.7k] | | ------------------ | | 316| 34.7k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 34.7k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 34.7k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 34.7k] | | | | ------------------ | | ------------------ | | 317| 34.7k|} while (0) | | ------------------ | | | Branch (317:10): [Folded - Ignored] | | ------------------ ------------------ 2431| 34.7k| switch (c) { 2432| 0| case 'M': ------------------ | Branch (2432:3): [True: 0, False: 34.7k] ------------------ 2433| 0| if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_ESC_CAPITAL_M_BAR_META)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 2434| 0| if (PEND) return ONIGERR_END_PATTERN_AT_META; ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 0] | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ if (PEND) return ONIGERR_END_PATTERN_AT_META; ------------------ | | 650| 0|#define ONIGERR_END_PATTERN_AT_META -105 ------------------ 2435| 0| PFETCH_S(c); ------------------ | | 314| 0|#define PFETCH_S(c) do { \ | | 315| 0| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (315:8): [True: 0, False: 0] | | ------------------ | | 316| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 317| 0|} while (0) | | ------------------ | | | Branch (317:10): [Folded - Ignored] | | ------------------ ------------------ 2436| 0| if (c != '-') return ONIGERR_META_CODE_SYNTAX; ------------------ | | 652| 0|#define ONIGERR_META_CODE_SYNTAX -108 ------------------ | Branch (2436:11): [True: 0, False: 0] ------------------ 2437| 0| if (PEND) return ONIGERR_END_PATTERN_AT_META; ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 0] | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ if (PEND) return ONIGERR_END_PATTERN_AT_META; ------------------ | | 650| 0|#define ONIGERR_END_PATTERN_AT_META -105 ------------------ 2438| 0| PFETCH_S(c); ------------------ | | 314| 0|#define PFETCH_S(c) do { \ | | 315| 0| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (315:8): [True: 0, False: 0] | | ------------------ | | 316| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 317| 0|} while (0) | | ------------------ | | | Branch (317:10): [Folded - Ignored] | | ------------------ ------------------ 2439| 0| if (c == MC_ESC(env->syntax)) { ------------------ | | 761| 0|#define MC_ESC(syn) (syn)->meta_char_table.esc ------------------ | Branch (2439:11): [True: 0, False: 0] ------------------ 2440| 0| v = fetch_escaped_value(&p, end, env, &c); 2441| 0| if (v < 0) return v; ------------------ | Branch (2441:6): [True: 0, False: 0] ------------------ 2442| 0| } 2443| 0| c = ((c & 0xff) | 0x80); 2444| 0| } 2445| 0| else 2446| 0| goto backslash; 2447| 0| break; 2448| | 2449| 0| case 'C': ------------------ | Branch (2449:3): [True: 0, False: 34.7k] ------------------ 2450| 0| if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_ESC_CAPITAL_C_BAR_CONTROL)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 2451| 0| if (PEND) return ONIGERR_END_PATTERN_AT_CONTROL; ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 0] | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ if (PEND) return ONIGERR_END_PATTERN_AT_CONTROL; ------------------ | | 651| 0|#define ONIGERR_END_PATTERN_AT_CONTROL -106 ------------------ 2452| 0| PFETCH_S(c); ------------------ | | 314| 0|#define PFETCH_S(c) do { \ | | 315| 0| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (315:8): [True: 0, False: 0] | | ------------------ | | 316| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 317| 0|} while (0) | | ------------------ | | | Branch (317:10): [Folded - Ignored] | | ------------------ ------------------ 2453| 0| if (c != '-') return ONIGERR_CONTROL_CODE_SYNTAX; ------------------ | | 653| 0|#define ONIGERR_CONTROL_CODE_SYNTAX -109 ------------------ | Branch (2453:11): [True: 0, False: 0] ------------------ 2454| 0| goto control; 2455| 0| } 2456| 0| else 2457| 0| goto backslash; 2458| | 2459| 0| case 'c': ------------------ | Branch (2459:3): [True: 0, False: 34.7k] ------------------ 2460| 0| if (IS_SYNTAX_OP(env->syntax, ONIG_SYN_OP_ESC_C_CONTROL)) { ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) | | ------------------ | | | Branch (330:35): [True: 0, False: 0] | | ------------------ ------------------ 2461| 0| control: 2462| 0| if (PEND) return ONIGERR_END_PATTERN_AT_CONTROL; ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 0] | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ if (PEND) return ONIGERR_END_PATTERN_AT_CONTROL; ------------------ | | 651| 0|#define ONIGERR_END_PATTERN_AT_CONTROL -106 ------------------ 2463| 0| PFETCH_S(c); ------------------ | | 314| 0|#define PFETCH_S(c) do { \ | | 315| 0| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (315:8): [True: 0, False: 0] | | ------------------ | | 316| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 317| 0|} while (0) | | ------------------ | | | Branch (317:10): [Folded - Ignored] | | ------------------ ------------------ 2464| 0| if (c == '?') { ------------------ | Branch (2464:11): [True: 0, False: 0] ------------------ 2465| 0| c = 0177; 2466| 0| } 2467| 0| else { 2468| 0| if (c == MC_ESC(env->syntax)) { ------------------ | | 761| 0|#define MC_ESC(syn) (syn)->meta_char_table.esc ------------------ | Branch (2468:6): [True: 0, False: 0] ------------------ 2469| 0| v = fetch_escaped_value(&p, end, env, &c); 2470| 0| if (v < 0) return v; ------------------ | Branch (2470:8): [True: 0, False: 0] ------------------ 2471| 0| } 2472| 0| c &= 0x9f; 2473| 0| } 2474| 0| break; 2475| 0| } 2476| | /* fall through */ 2477| | 2478| 34.7k| default: ------------------ | Branch (2478:3): [True: 34.7k, False: 0] ------------------ 2479| 34.7k| { 2480| 34.7k| backslash: 2481| 34.7k| c = conv_backslash_value(c, env); 2482| 34.7k| } 2483| 34.7k| break; 2484| 34.7k| } 2485| | 2486| 34.7k| *src = p; 2487| 34.7k| *val = c; 2488| 34.7k| return 0; 2489| 34.7k|} regparse.c:conv_backslash_value: 2097| 34.7k|{ 2098| 34.7k| if (IS_SYNTAX_OP(env->syntax, ONIG_SYN_OP_ESC_CONTROL_CHARS)) { ------------------ | | 330| 34.7k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) | | ------------------ | | | Branch (330:35): [True: 34.7k, False: 0] | | ------------------ ------------------ 2099| 34.7k| switch (c) { 2100| 3.97k| case 'n': return '\n'; ------------------ | Branch (2100:5): [True: 3.97k, False: 30.7k] ------------------ 2101| 15.4k| case 't': return '\t'; ------------------ | Branch (2101:5): [True: 15.4k, False: 19.2k] ------------------ 2102| 3.97k| case 'r': return '\r'; ------------------ | Branch (2102:5): [True: 3.97k, False: 30.7k] ------------------ 2103| 0| case 'f': return '\f'; ------------------ | Branch (2103:5): [True: 0, False: 34.7k] ------------------ 2104| 0| case 'a': return '\007'; ------------------ | Branch (2104:5): [True: 0, False: 34.7k] ------------------ 2105| 0| case 'b': return '\010'; ------------------ | Branch (2105:5): [True: 0, False: 34.7k] ------------------ 2106| 0| case 'e': return '\033'; ------------------ | Branch (2106:5): [True: 0, False: 34.7k] ------------------ 2107| 0| case 'v': ------------------ | Branch (2107:5): [True: 0, False: 34.7k] ------------------ 2108| 0| if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_ESC_V_VTAB)) ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 2109| 0| return '\v'; 2110| 0| break; 2111| | 2112| 11.2k| default: ------------------ | Branch (2112:5): [True: 11.2k, False: 23.4k] ------------------ 2113| 11.2k| if (('a' <= c && c <= 'z') || ('A' <= c && c <= 'Z')) ------------------ | Branch (2113:12): [True: 0, False: 11.2k] | Branch (2113:24): [True: 0, False: 0] | Branch (2113:38): [True: 7.56k, False: 3.72k] | Branch (2113:50): [True: 0, False: 7.56k] ------------------ 2114| 0| UNKNOWN_ESC_WARN(env, c); 2115| 11.2k| break; 2116| 34.7k| } 2117| 34.7k| } 2118| 11.2k| return c; 2119| 34.7k|} regparse.c:parse_subexp: 6550| 67.6k|{ 6551| 67.6k| int r; 6552| 67.6k| Node *node, **headp; 6553| | 6554| 67.6k| *top = NULL; 6555| 67.6k| env->parse_depth++; 6556| 67.6k| if (env->parse_depth > ParseDepthLimit) ------------------ | Branch (6556:7): [True: 0, False: 67.6k] ------------------ 6557| 0| return ONIGERR_PARSE_DEPTH_LIMIT_OVER; ------------------ | | 639| 0|#define ONIGERR_PARSE_DEPTH_LIMIT_OVER -16 ------------------ 6558| 67.6k| r = parse_branch(&node, tok, term, src, end, env); 6559| 67.6k| if (r < 0) { ------------------ | Branch (6559:7): [True: 0, False: 67.6k] ------------------ 6560| 0| onig_node_free(node); 6561| 0| return r; 6562| 0| } 6563| | 6564| 67.6k| if (r == term) { ------------------ | Branch (6564:7): [True: 55.8k, False: 11.8k] ------------------ 6565| 55.8k| *top = node; 6566| 55.8k| } 6567| 11.8k| else if (r == TK_ALT) { ------------------ | Branch (6567:12): [True: 11.8k, False: 0] ------------------ 6568| 11.8k| *top = onig_node_new_alt(node, NULL); 6569| 11.8k| headp = &(NCDR(*top)); ------------------ | | 87| 11.8k|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 11.8k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 6570| 27.6k| while (r == TK_ALT) { ------------------ | Branch (6570:12): [True: 15.8k, False: 11.8k] ------------------ 6571| 15.8k| r = fetch_token(tok, src, end, env); 6572| 15.8k| if (r < 0) return r; ------------------ | Branch (6572:11): [True: 0, False: 15.8k] ------------------ 6573| 15.8k| r = parse_branch(&node, tok, term, src, end, env); 6574| 15.8k| if (r < 0) { ------------------ | Branch (6574:11): [True: 0, False: 15.8k] ------------------ 6575| 0| onig_node_free(node); 6576| 0| return r; 6577| 0| } 6578| | 6579| 15.8k| *headp = onig_node_new_alt(node, NULL); 6580| 15.8k| headp = &(NCDR(*headp)); ------------------ | | 87| 15.8k|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 15.8k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 6581| 15.8k| } 6582| | 6583| 11.8k| if (tok->type != (enum TokenSyms )term) ------------------ | Branch (6583:9): [True: 0, False: 11.8k] ------------------ 6584| 0| goto err; 6585| 11.8k| } 6586| 0| else { 6587| 0| onig_node_free(node); 6588| 0| err: 6589| 0| if (term == TK_SUBEXP_CLOSE) ------------------ | Branch (6589:9): [True: 0, False: 0] ------------------ 6590| 0| return ONIGERR_END_PATTERN_WITH_UNMATCHED_PARENTHESIS; ------------------ | | 661| 0|#define ONIGERR_END_PATTERN_WITH_UNMATCHED_PARENTHESIS -117 ------------------ 6591| 0| else 6592| 0| return ONIGERR_PARSER_BUG; ------------------ | | 634| 0|#define ONIGERR_PARSER_BUG -11 ------------------ 6593| 0| } 6594| | 6595| 67.6k| env->parse_depth--; 6596| 67.6k| return r; 6597| 67.6k|} regparse.c:parse_branch: 6507| 83.4k|{ 6508| 83.4k| int r; 6509| 83.4k| Node *node, **headp; 6510| | 6511| 83.4k| *top = NULL; 6512| 83.4k| r = parse_exp(&node, tok, term, src, end, env); 6513| 83.4k| if (r < 0) { ------------------ | Branch (6513:7): [True: 0, False: 83.4k] ------------------ 6514| 0| onig_node_free(node); 6515| 0| return r; 6516| 0| } 6517| | 6518| 83.4k| if (r == TK_EOT || r == term || r == TK_ALT) { ------------------ | Branch (6518:7): [True: 3.75k, False: 79.7k] | Branch (6518:22): [True: 19.8k, False: 59.8k] | Branch (6518:35): [True: 13.9k, False: 45.9k] ------------------ 6519| 37.5k| *top = node; 6520| 37.5k| } 6521| 45.9k| else { 6522| 45.9k| *top = node_new_list(node, NULL); 6523| 45.9k| headp = &(NCDR(*top)); ------------------ | | 87| 45.9k|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 45.9k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 6524| 189k| while (r != TK_EOT && r != term && r != TK_ALT) { ------------------ | Branch (6524:12): [True: 149k, False: 40.3k] | Branch (6524:27): [True: 145k, False: 3.72k] | Branch (6524:40): [True: 144k, False: 1.88k] ------------------ 6525| 144k| r = parse_exp(&node, tok, term, src, end, env); 6526| 144k| if (r < 0) { ------------------ | Branch (6526:11): [True: 0, False: 144k] ------------------ 6527| 0| onig_node_free(node); 6528| 0| return r; 6529| 0| } 6530| | 6531| 144k| if (NTYPE(node) == NT_LIST) { ------------------ | | 69| 144k|#define NTYPE(node) ((node)->u.base.type) ------------------ if (NTYPE(node) == NT_LIST) { ------------------ | | 46| 144k|#define NT_LIST 8 ------------------ | Branch (6531:11): [True: 0, False: 144k] ------------------ 6532| 0| *headp = node; 6533| 0| while (IS_NOT_NULL(NCDR(node))) node = NCDR(node); ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ while (IS_NOT_NULL(NCDR(node))) node = NCDR(node); ------------------ | | 87| 0|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 6534| 0| headp = &(NCDR(node)); ------------------ | | 87| 0|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 6535| 0| } 6536| 144k| else { 6537| 144k| *headp = node_new_list(node, NULL); 6538| 144k| headp = &(NCDR(*headp)); ------------------ | | 87| 144k|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 144k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 6539| 144k| } 6540| 144k| } 6541| 45.9k| } 6542| | 6543| 83.4k| return r; 6544| 83.4k|} regparse.c:parse_exp: 6129| 227k|{ 6130| 227k| int r, len, group = 0; 6131| 227k| Node* qn; 6132| 227k| Node** targetp; 6133| 227k| unsigned int parse_depth; 6134| | 6135| 227k| *np = NULL; 6136| 227k| if (tok->type == (enum TokenSyms )term) ------------------ | Branch (6136:7): [True: 1.95k, False: 225k] ------------------ 6137| 1.95k| goto end_of_token; 6138| | 6139| 225k| parse_depth = env->parse_depth; 6140| | 6141| 225k| switch (tok->type) { 6142| 0| case TK_ALT: ------------------ | Branch (6142:3): [True: 0, False: 225k] ------------------ 6143| 0| case TK_EOT: ------------------ | Branch (6143:3): [True: 0, False: 225k] ------------------ 6144| 1.95k| end_of_token: 6145| 1.95k| *np = node_new_empty(); 6146| 1.95k| return tok->type; 6147| 0| break; 6148| | 6149| 23.6k| case TK_SUBEXP_OPEN: ------------------ | Branch (6149:3): [True: 23.6k, False: 201k] ------------------ 6150| 23.6k| r = parse_enclose(np, tok, TK_SUBEXP_CLOSE, src, end, env); 6151| 23.6k| if (r < 0) return r; ------------------ | Branch (6151:9): [True: 0, False: 23.6k] ------------------ 6152| 23.6k| if (r == 1) group = 1; ------------------ | Branch (6152:9): [True: 11.5k, False: 12.0k] ------------------ 6153| 12.0k| else if (r == 2) { /* option only */ ------------------ | Branch (6153:14): [True: 0, False: 12.0k] ------------------ 6154| 0| Node* target; 6155| 0| OnigOptionType prev = env->option; 6156| | 6157| 0| env->option = NENCLOSE(*np)->option; ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 6158| 0| r = fetch_token(tok, src, end, env); 6159| 0| if (r < 0) { ------------------ | Branch (6159:11): [True: 0, False: 0] ------------------ 6160| 0| env->option = prev; 6161| 0| return r; 6162| 0| } 6163| 0| r = parse_subexp(&target, tok, term, src, end, env); 6164| 0| env->option = prev; 6165| 0| if (r < 0) { ------------------ | Branch (6165:11): [True: 0, False: 0] ------------------ 6166| 0| onig_node_free(target); 6167| 0| return r; 6168| 0| } 6169| 0| NENCLOSE(*np)->target = target; ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 6170| 0| return tok->type; 6171| 0| } 6172| 23.6k| break; 6173| | 6174| 23.6k| case TK_SUBEXP_CLOSE: ------------------ | Branch (6174:3): [True: 0, False: 225k] ------------------ 6175| 0| if (! IS_SYNTAX_BV(env->syntax, ONIG_SYN_ALLOW_UNMATCHED_CLOSE_SUBEXP)) ------------------ | | 332| 0|#define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0) ------------------ | Branch (6175:9): [True: 0, False: 0] ------------------ 6176| 0| return ONIGERR_UNMATCHED_CLOSE_PARENTHESIS; ------------------ | | 660| 0|#define ONIGERR_UNMATCHED_CLOSE_PARENTHESIS -116 ------------------ 6177| | 6178| 0| if (tok->escaped) goto tk_raw_byte; ------------------ | Branch (6178:9): [True: 0, False: 0] ------------------ 6179| 0| else goto tk_byte; 6180| 0| break; 6181| | 6182| 0| case TK_LINEBREAK: ------------------ | Branch (6182:3): [True: 0, False: 225k] ------------------ 6183| 0| r = node_linebreak(np, env); 6184| 0| if (r < 0) return r; ------------------ | Branch (6184:9): [True: 0, False: 0] ------------------ 6185| 0| break; 6186| | 6187| 0| case TK_EXTENDED_GRAPHEME_CLUSTER: ------------------ | Branch (6187:3): [True: 0, False: 225k] ------------------ 6188| 0| r = node_extended_grapheme_cluster(np, env); 6189| 0| if (r < 0) return r; ------------------ | Branch (6189:9): [True: 0, False: 0] ------------------ 6190| 0| break; 6191| | 6192| 0| case TK_KEEP: ------------------ | Branch (6192:3): [True: 0, False: 225k] ------------------ 6193| 0| *np = onig_node_new_anchor(ANCHOR_KEEP); ------------------ | | 559| 0|#define ANCHOR_KEEP (1<<16) ------------------ 6194| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 314| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6195| 0| break; 6196| | 6197| 81.2k| case TK_STRING: ------------------ | Branch (6197:3): [True: 81.2k, False: 144k] ------------------ 6198| 81.2k| tk_byte: 6199| 81.2k| { 6200| 81.2k| *np = node_new_str(tok->backp, *src); 6201| 81.2k| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 314| 81.2k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 81.2k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 81.2k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6202| | 6203| 81.2k| string_loop: 6204| 714k| while (1) { ------------------ | Branch (6204:14): [Folded - Ignored] ------------------ 6205| 714k| r = fetch_token(tok, src, end, env); 6206| 714k| if (r < 0) return r; ------------------ | Branch (6206:6): [True: 0, False: 714k] ------------------ 6207| 714k| if (r == TK_STRING) { ------------------ | Branch (6207:6): [True: 633k, False: 81.2k] ------------------ 6208| 633k| r = onig_node_str_cat(*np, tok->backp, *src); 6209| 633k| } 6210| 81.2k|#ifndef NUMBERED_CHAR_IS_NOT_CASE_AMBIG 6211| 81.2k| else if (r == TK_CODE_POINT) { ------------------ | Branch (6211:11): [True: 0, False: 81.2k] ------------------ 6212| 0| r = node_str_cat_codepoint(*np, env->enc, tok->u.code); 6213| 0| } 6214| 81.2k|#endif 6215| 81.2k| else { 6216| 81.2k| break; 6217| 81.2k| } 6218| 633k| if (r < 0) return r; ------------------ | Branch (6218:6): [True: 0, False: 633k] ------------------ 6219| 633k| } 6220| | 6221| 81.2k| string_end: 6222| 81.2k| targetp = np; 6223| 81.2k| goto repeat; 6224| 81.2k| } 6225| 0| break; 6226| | 6227| 0| case TK_RAW_BYTE: ------------------ | Branch (6227:3): [True: 0, False: 225k] ------------------ 6228| 0| tk_raw_byte: 6229| 0| { 6230| 0| *np = node_new_str_raw_char((UChar )tok->u.c); 6231| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 314| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6232| 0| len = 1; 6233| 0| while (1) { ------------------ | Branch (6233:14): [Folded - Ignored] ------------------ 6234| 0| if (len >= ONIGENC_MBC_MINLEN(env->enc)) { ------------------ | | 367| 0|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) ------------------ | Branch (6234:6): [True: 0, False: 0] ------------------ 6235| 0| if (len == enclen(env->enc, NSTR(*np)->s, NSTR(*np)->end)) { ------------------ | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 0] | | ------------------ ------------------ | Branch (6235:8): [True: 0, False: 0] ------------------ 6236| 0| r = fetch_token(tok, src, end, env); 6237| 0| NSTRING_CLEAR_RAW(*np); ------------------ | | 110| 0|#define NSTRING_CLEAR_RAW(node) (node)->u.str.flag &= ~NSTR_RAW | | ------------------ | | | | 104| 0|#define NSTR_RAW (1<<0) /* by backslashed number */ | | ------------------ ------------------ 6238| 0| goto string_end; 6239| 0| } 6240| 0| } 6241| | 6242| 0| r = fetch_token(tok, src, end, env); 6243| 0| if (r < 0) return r; ------------------ | Branch (6243:6): [True: 0, False: 0] ------------------ 6244| 0| if (r != TK_RAW_BYTE) { ------------------ | Branch (6244:6): [True: 0, False: 0] ------------------ 6245| | /* Don't use this, it is wrong for little endian encodings. */ 6246| |#ifdef USE_PAD_TO_SHORT_BYTE_CHAR 6247| | int rem; 6248| | if (len < ONIGENC_MBC_MINLEN(env->enc)) { 6249| | rem = ONIGENC_MBC_MINLEN(env->enc) - len; 6250| | (void )node_str_head_pad(NSTR(*np), rem, (UChar )0); 6251| | if (len + rem == enclen(env->enc, NSTR(*np)->s)) { 6252| | NSTRING_CLEAR_RAW(*np); 6253| | goto string_end; 6254| | } 6255| | } 6256| |#endif 6257| 0| return ONIGERR_TOO_SHORT_MULTI_BYTE_STRING; ------------------ | | 675| 0|#define ONIGERR_TOO_SHORT_MULTI_BYTE_STRING -206 ------------------ 6258| 0| } 6259| | 6260| 0| r = node_str_cat_char(*np, (UChar )tok->u.c); 6261| 0| if (r < 0) return r; ------------------ | Branch (6261:6): [True: 0, False: 0] ------------------ 6262| | 6263| 0| len++; 6264| 0| } 6265| 0| } 6266| 0| break; 6267| | 6268| 0| case TK_CODE_POINT: ------------------ | Branch (6268:3): [True: 0, False: 225k] ------------------ 6269| 0| { 6270| 0| *np = node_new_empty(); 6271| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 314| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6272| 0| r = node_str_cat_codepoint(*np, env->enc, tok->u.code); 6273| 0| if (r != 0) return r; ------------------ | Branch (6273:11): [True: 0, False: 0] ------------------ 6274| |#ifdef NUMBERED_CHAR_IS_NOT_CASE_AMBIG 6275| | NSTRING_SET_RAW(*np); 6276| |#else 6277| 0| goto string_loop; 6278| 0|#endif 6279| 0| } 6280| 0| break; 6281| | 6282| 0| case TK_QUOTE_OPEN: ------------------ | Branch (6282:3): [True: 0, False: 225k] ------------------ 6283| 0| { 6284| 0| OnigCodePoint end_op[2]; 6285| 0| UChar *qstart, *qend, *nextp; ------------------ | | 76| 0|# define UChar OnigUChar ------------------ 6286| | 6287| 0| end_op[0] = (OnigCodePoint )MC_ESC(env->syntax); ------------------ | | 761| 0|#define MC_ESC(syn) (syn)->meta_char_table.esc ------------------ 6288| 0| end_op[1] = (OnigCodePoint )'E'; 6289| 0| qstart = *src; 6290| 0| qend = find_str_position(end_op, 2, qstart, end, &nextp, env->enc); 6291| 0| if (IS_NULL(qend)) { ------------------ | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 0] | | ------------------ ------------------ 6292| 0| nextp = qend = end; 6293| 0| } 6294| 0| *np = node_new_str(qstart, qend); 6295| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 314| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6296| 0| *src = nextp; 6297| 0| } 6298| 0| break; 6299| | 6300| 16.8k| case TK_CHAR_TYPE: ------------------ | Branch (6300:3): [True: 16.8k, False: 208k] ------------------ 6301| 16.8k| { 6302| 16.8k| switch (tok->u.prop.ctype) { 6303| 0| case ONIGENC_CTYPE_WORD: ------------------ | | 306| 0|#define ONIGENC_CTYPE_WORD 12 ------------------ | Branch (6303:7): [True: 0, False: 16.8k] ------------------ 6304| 0| *np = node_new_ctype(tok->u.prop.ctype, tok->u.prop.not, 6305| 0| IS_ASCII_RANGE(env->option)); ------------------ | | 406| 0|#define IS_ASCII_RANGE(option) ((option) & ONIG_OPTION_ASCII_RANGE) | | ------------------ | | | | 470| 0|#define ONIG_OPTION_ASCII_RANGE (ONIG_OPTION_NOTEOS << 1) | | | | ------------------ | | | | | | 468| 0|#define ONIG_OPTION_NOTEOS (ONIG_OPTION_NOTBOS << 1) | | | | | | ------------------ | | | | | | | | 467| 0|#define ONIG_OPTION_NOTBOS (ONIG_OPTION_NOTEOL << 1) | | | | | | | | ------------------ | | | | | | | | | | 466| 0|#define ONIG_OPTION_NOTEOL (ONIG_OPTION_NOTBOL << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 465| 0|#define ONIG_OPTION_NOTBOL (ONIG_OPTION_CAPTURE_GROUP << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 463| 0|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 462| 0|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 461| 0|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | 460| 0|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | 459| 0|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | 458| 0|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | 456| 0|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 455| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 454| 0|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 6306| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 314| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6307| 0| break; 6308| | 6309| 9.33k| case ONIGENC_CTYPE_SPACE: ------------------ | | 303| 9.33k|#define ONIGENC_CTYPE_SPACE 9 ------------------ | Branch (6309:7): [True: 9.33k, False: 7.56k] ------------------ 6310| 16.8k| case ONIGENC_CTYPE_DIGIT: ------------------ | | 298| 16.8k|#define ONIGENC_CTYPE_DIGIT 4 ------------------ | Branch (6310:7): [True: 7.56k, False: 9.33k] ------------------ 6311| 16.8k| case ONIGENC_CTYPE_XDIGIT: ------------------ | | 305| 16.8k|#define ONIGENC_CTYPE_XDIGIT 11 ------------------ | Branch (6311:7): [True: 0, False: 16.8k] ------------------ 6312| 16.8k| { 6313| 16.8k| CClassNode* cc; 6314| | 6315| 16.8k| *np = node_new_cclass(); 6316| 16.8k| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 314| 16.8k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 16.8k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 16.8k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6317| 16.8k| cc = NCCLASS(*np); ------------------ | | 77| 16.8k|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 6318| 16.8k| r = add_ctype_to_cc(cc, tok->u.prop.ctype, 0, 6319| 16.8k| IS_ASCII_RANGE(env->option), env); ------------------ | | 406| 16.8k|#define IS_ASCII_RANGE(option) ((option) & ONIG_OPTION_ASCII_RANGE) | | ------------------ | | | | 470| 16.8k|#define ONIG_OPTION_ASCII_RANGE (ONIG_OPTION_NOTEOS << 1) | | | | ------------------ | | | | | | 468| 16.8k|#define ONIG_OPTION_NOTEOS (ONIG_OPTION_NOTBOS << 1) | | | | | | ------------------ | | | | | | | | 467| 16.8k|#define ONIG_OPTION_NOTBOS (ONIG_OPTION_NOTEOL << 1) | | | | | | | | ------------------ | | | | | | | | | | 466| 16.8k|#define ONIG_OPTION_NOTEOL (ONIG_OPTION_NOTBOL << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 465| 16.8k|#define ONIG_OPTION_NOTBOL (ONIG_OPTION_CAPTURE_GROUP << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 463| 16.8k|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 462| 16.8k|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 461| 16.8k|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | 460| 16.8k|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | 459| 16.8k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | 458| 16.8k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | 456| 16.8k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 455| 16.8k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 454| 16.8k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 6320| 16.8k| if (r != 0) return r; ------------------ | Branch (6320:8): [True: 0, False: 16.8k] ------------------ 6321| 16.8k| if (tok->u.prop.not != 0) NCCLASS_SET_NOT(cc); ------------------ | | 807| 0|#define NCCLASS_SET_NOT(nd) NCCLASS_FLAG_SET(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 800| 0|#define NCCLASS_FLAG_SET(cc,flag) (NCCLASS_FLAGS(cc) |= (flag)) | | | | ------------------ | | | | | | 799| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ | Branch (6321:8): [True: 0, False: 16.8k] ------------------ 6322| 16.8k| } 6323| 0| break; 6324| | 6325| 0| default: ------------------ | Branch (6325:7): [True: 0, False: 16.8k] ------------------ 6326| 0| return ONIGERR_PARSER_BUG; ------------------ | | 634| 0|#define ONIGERR_PARSER_BUG -11 ------------------ 6327| 0| break; 6328| 16.8k| } 6329| 16.8k| } 6330| 16.8k| break; 6331| | 6332| 16.8k| case TK_CHAR_PROPERTY: ------------------ | Branch (6332:3): [True: 0, False: 225k] ------------------ 6333| 0| r = parse_char_property(np, tok, src, end, env); 6334| 0| if (r != 0) return r; ------------------ | Branch (6334:9): [True: 0, False: 0] ------------------ 6335| 0| break; 6336| | 6337| 28.7k| case TK_CC_OPEN: ------------------ | Branch (6337:3): [True: 28.7k, False: 196k] ------------------ 6338| 28.7k| { 6339| 28.7k| Node *asc_node; 6340| 28.7k| CClassNode* cc; 6341| 28.7k| OnigCodePoint code; 6342| | 6343| 28.7k| r = parse_char_class(np, &asc_node, tok, src, end, env); 6344| 28.7k| if (r != 0) { ------------------ | Branch (6344:11): [True: 0, False: 28.7k] ------------------ 6345| 0| onig_node_free(asc_node); 6346| 0| return r; 6347| 0| } 6348| | 6349| 28.7k| cc = NCCLASS(*np); ------------------ | | 77| 28.7k|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 6350| 28.7k| if (is_onechar_cclass(cc, &code)) { ------------------ | Branch (6350:11): [True: 0, False: 28.7k] ------------------ 6351| 0| onig_node_free(*np); 6352| 0| onig_node_free(asc_node); 6353| 0| *np = node_new_empty(); 6354| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 314| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6355| 0| r = node_str_cat_codepoint(*np, env->enc, code); 6356| 0| if (r != 0) return r; ------------------ | Branch (6356:6): [True: 0, False: 0] ------------------ 6357| 0| goto string_loop; 6358| 0| } 6359| 28.7k| if (IS_IGNORECASE(env->option)) { ------------------ | | 396| 28.7k|#define IS_IGNORECASE(option) ((option) & ONIG_OPTION_IGNORECASE) | | ------------------ | | | | 454| 28.7k|#define ONIG_OPTION_IGNORECASE 1U | | ------------------ | | | Branch (396:35): [True: 0, False: 28.7k] | | ------------------ ------------------ 6360| 0| r = cclass_case_fold(np, cc, NCCLASS(asc_node), env); ------------------ | | 77| 0|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 6361| 0| if (r != 0) { ------------------ | Branch (6361:6): [True: 0, False: 0] ------------------ 6362| 0| onig_node_free(asc_node); 6363| 0| return r; 6364| 0| } 6365| 0| } 6366| 28.7k| onig_node_free(asc_node); 6367| 28.7k| } 6368| 0| break; 6369| | 6370| 19.3k| case TK_ANYCHAR: ------------------ | Branch (6370:3): [True: 19.3k, False: 206k] ------------------ 6371| 19.3k| *np = node_new_anychar(); 6372| 19.3k| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 314| 19.3k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 19.3k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 19.3k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6373| 19.3k| break; 6374| | 6375| 19.3k| case TK_ANYCHAR_ANYTIME: ------------------ | Branch (6375:3): [True: 0, False: 225k] ------------------ 6376| 0| *np = node_new_anychar(); 6377| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 314| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6378| 0| qn = node_new_quantifier(0, REPEAT_INFINITE, 0); ------------------ | | 421| 0|#define REPEAT_INFINITE -1 ------------------ 6379| 0| CHECK_NULL_RETURN_MEMERR(qn); ------------------ | | 314| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6380| 0| NQTFR(qn)->target = *np; ------------------ | | 80| 0|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 6381| 0| *np = qn; 6382| 0| break; 6383| | 6384| 0| case TK_BACKREF: ------------------ | Branch (6384:3): [True: 0, False: 225k] ------------------ 6385| 0| len = tok->u.backref.num; 6386| 0| *np = node_new_backref(len, 6387| 0| (len > 1 ? tok->u.backref.refs : &(tok->u.backref.ref1)), ------------------ | Branch (6387:7): [True: 0, False: 0] ------------------ 6388| 0| tok->u.backref.by_name, 6389| 0|#ifdef USE_BACKREF_WITH_LEVEL 6390| 0| tok->u.backref.exist_level, 6391| 0| tok->u.backref.level, 6392| 0|#endif 6393| 0| env); 6394| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 314| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6395| 0| break; 6396| | 6397| 0|#ifdef USE_SUBEXP_CALL 6398| 0| case TK_CALL: ------------------ | Branch (6398:3): [True: 0, False: 225k] ------------------ 6399| 0| { 6400| 0| int gnum = tok->u.call.gnum; 6401| | 6402| 0| if (gnum < 0 || tok->u.call.rel != 0) { ------------------ | Branch (6402:11): [True: 0, False: 0] | Branch (6402:23): [True: 0, False: 0] ------------------ 6403| 0| if (gnum > 0) gnum--; ------------------ | Branch (6403:6): [True: 0, False: 0] ------------------ 6404| 0| gnum = BACKREF_REL_TO_ABS(gnum, env); ------------------ | | 158| 0| ((env)->num_mem + 1 + (rel_no)) ------------------ 6405| 0| if (gnum <= 0) ------------------ | Branch (6405:6): [True: 0, False: 0] ------------------ 6406| 0| return ONIGERR_INVALID_BACKREF; ------------------ | | 677| 0|#define ONIGERR_INVALID_BACKREF -208 ------------------ 6407| 0| } 6408| 0| *np = node_new_call(tok->u.call.name, tok->u.call.name_end, gnum); 6409| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 314| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6410| 0| env->num_call++; 6411| 0| } 6412| 0| break; 6413| 0|#endif 6414| | 6415| 55.6k| case TK_ANCHOR: ------------------ | Branch (6415:3): [True: 55.6k, False: 169k] ------------------ 6416| 55.6k| *np = onig_node_new_anchor(tok->u.anchor.subtype); 6417| 55.6k| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 314| 55.6k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 55.6k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 55.6k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6418| 55.6k| NANCHOR(*np)->ascii_range = tok->u.anchor.ascii_range; ------------------ | | 82| 55.6k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 6419| 55.6k| break; 6420| | 6421| 0| case TK_OP_REPEAT: ------------------ | Branch (6421:3): [True: 0, False: 225k] ------------------ 6422| 0| case TK_INTERVAL: ------------------ | Branch (6422:3): [True: 0, False: 225k] ------------------ 6423| 0| if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_CONTEXT_INDEP_REPEAT_OPS)) { ------------------ | | 332| 0|#define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0) | | ------------------ | | | Branch (332:35): [True: 0, False: 0] | | ------------------ ------------------ 6424| 0| if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_CONTEXT_INVALID_REPEAT_OPS)) ------------------ | | 332| 0|#define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0) | | ------------------ | | | Branch (332:35): [True: 0, False: 0] | | ------------------ ------------------ 6425| 0| return ONIGERR_TARGET_OF_REPEAT_OPERATOR_NOT_SPECIFIED; ------------------ | | 657| 0|#define ONIGERR_TARGET_OF_REPEAT_OPERATOR_NOT_SPECIFIED -113 ------------------ 6426| 0| else 6427| 0| *np = node_new_empty(); 6428| 0| } 6429| 0| else { 6430| 0| goto tk_byte; 6431| 0| } 6432| 0| break; 6433| | 6434| 0| default: ------------------ | Branch (6434:3): [True: 0, False: 225k] ------------------ 6435| 0| return ONIGERR_PARSER_BUG; ------------------ | | 634| 0|#define ONIGERR_PARSER_BUG -11 ------------------ 6436| 0| break; 6437| 225k| } 6438| | 6439| 144k| { 6440| 144k| targetp = np; 6441| | 6442| 201k| re_entry: 6443| 201k| r = fetch_token(tok, src, end, env); 6444| 201k| if (r < 0) return r; ------------------ | Branch (6444:9): [True: 0, False: 201k] ------------------ 6445| | 6446| 282k| repeat: 6447| 282k| if (r == TK_OP_REPEAT || r == TK_INTERVAL) { ------------------ | Branch (6447:9): [True: 57.1k, False: 225k] | Branch (6447:30): [True: 0, False: 225k] ------------------ 6448| 57.1k| if (is_invalid_quantifier_target(*targetp)) ------------------ | | 2122| 57.1k|# define is_invalid_quantifier_target(node) 0 | | ------------------ | | | Branch (2122:45): [Folded - Ignored] | | ------------------ ------------------ 6449| 0| return ONIGERR_TARGET_OF_REPEAT_OPERATOR_INVALID; ------------------ | | 658| 0|#define ONIGERR_TARGET_OF_REPEAT_OPERATOR_INVALID -114 ------------------ 6450| | 6451| 57.1k| parse_depth++; 6452| 57.1k| if (parse_depth > ParseDepthLimit) ------------------ | Branch (6452:11): [True: 0, False: 57.1k] ------------------ 6453| 0| return ONIGERR_PARSE_DEPTH_LIMIT_OVER; ------------------ | | 639| 0|#define ONIGERR_PARSE_DEPTH_LIMIT_OVER -16 ------------------ 6454| | 6455| 57.1k| qn = node_new_quantifier(tok->u.repeat.lower, tok->u.repeat.upper, 6456| 57.1k| (r == TK_INTERVAL ? 1 : 0)); ------------------ | Branch (6456:12): [True: 0, False: 57.1k] ------------------ 6457| 57.1k| CHECK_NULL_RETURN_MEMERR(qn); ------------------ | | 314| 57.1k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 57.1k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 57.1k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6458| 57.1k| NQTFR(qn)->greedy = tok->u.repeat.greedy; ------------------ | | 80| 57.1k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 6459| 57.1k| r = set_quantifier(qn, *targetp, group, env); 6460| 57.1k| if (r < 0) { ------------------ | Branch (6460:11): [True: 0, False: 57.1k] ------------------ 6461| 0| onig_node_free(qn); 6462| 0| return r; 6463| 0| } 6464| | 6465| 57.1k| if (tok->u.repeat.possessive != 0) { ------------------ | Branch (6465:11): [True: 0, False: 57.1k] ------------------ 6466| 0| Node* en; 6467| 0| en = node_new_enclose(ENCLOSE_STOP_BACKTRACK); ------------------ | | 96| 0|#define ENCLOSE_STOP_BACKTRACK (1<<2) ------------------ 6468| 0| if (IS_NULL(en)) { ------------------ | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 0] | | ------------------ ------------------ 6469| 0| onig_node_free(qn); 6470| 0| return ONIGERR_MEMORY; ------------------ | | 632| 0|#define ONIGERR_MEMORY -5 ------------------ 6471| 0| } 6472| 0| NENCLOSE(en)->target = qn; ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 6473| 0| qn = en; 6474| 0| } 6475| | 6476| 57.1k| if (r == 0) { ------------------ | Branch (6476:11): [True: 57.1k, False: 0] ------------------ 6477| 57.1k| *targetp = qn; 6478| 57.1k| } 6479| 0| else if (r == 1) { ------------------ | Branch (6479:16): [True: 0, False: 0] ------------------ 6480| 0| onig_node_free(qn); 6481| 0| } 6482| 0| else if (r == 2) { /* split case: /abc+/ */ ------------------ | Branch (6482:16): [True: 0, False: 0] ------------------ 6483| 0| Node *tmp; 6484| | 6485| 0| *targetp = node_new_list(*targetp, NULL); 6486| 0| if (IS_NULL(*targetp)) { ------------------ | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 0] | | ------------------ ------------------ 6487| 0| onig_node_free(qn); 6488| 0| return ONIGERR_MEMORY; ------------------ | | 632| 0|#define ONIGERR_MEMORY -5 ------------------ 6489| 0| } 6490| 0| tmp = NCDR(*targetp) = node_new_list(qn, NULL); ------------------ | | 87| 0|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 6491| 0| if (IS_NULL(tmp)) { ------------------ | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 0] | | ------------------ ------------------ 6492| 0| onig_node_free(qn); 6493| 0| return ONIGERR_MEMORY; ------------------ | | 632| 0|#define ONIGERR_MEMORY -5 ------------------ 6494| 0| } 6495| 0| targetp = &(NCAR(tmp)); ------------------ | | 86| 0|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 6496| 0| } 6497| 57.1k| goto re_entry; 6498| 57.1k| } 6499| 282k| } 6500| | 6501| 225k| return r; 6502| 282k|} regparse.c:node_new_empty: 1497| 1.95k|{ 1498| 1.95k| return node_new_str(NULL, NULL); 1499| 1.95k|} regparse.c:parse_enclose: 4965| 23.6k|{ 4966| 23.6k| int r = 0, num; 4967| 23.6k| Node *target, *work1 = NULL, *work2 = NULL; 4968| 23.6k| OnigOptionType option; 4969| 23.6k| OnigCodePoint c; 4970| 23.6k| OnigEncoding enc = env->enc; 4971| | 4972| 23.6k|#ifdef USE_NAMED_GROUP 4973| 23.6k| int list_capture; 4974| 23.6k|#endif 4975| | 4976| 23.6k| UChar* p = *src; ------------------ | | 76| 23.6k|# define UChar OnigUChar ------------------ 4977| 23.6k| PFETCH_READY; ------------------ | | 295| 23.6k|# define PFETCH_READY UChar* pfetch_prev = NULL; (void)pfetch_prev | | ------------------ | | | | 76| 23.6k|# define UChar OnigUChar | | ------------------ ------------------ 4978| | 4979| 23.6k| *np = NULL; 4980| 23.6k| if (PEND) return ONIGERR_END_PATTERN_WITH_UNMATCHED_PARENTHESIS; ------------------ | | 299| 23.6k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 23.6k] | | | Branch (299:23): [True: 23.6k, False: 0] | | ------------------ ------------------ if (PEND) return ONIGERR_END_PATTERN_WITH_UNMATCHED_PARENTHESIS; ------------------ | | 661| 0|#define ONIGERR_END_PATTERN_WITH_UNMATCHED_PARENTHESIS -117 ------------------ 4981| | 4982| 23.6k| option = env->option; 4983| 23.6k| if (PPEEK_IS('?') && ------------------ | | 320| 47.2k|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 23.6k|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 369| 23.6k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | | | ------------------ | | | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 291| 0|#define PEND_VALUE 0 | | | | ------------------ | | | | | Branch (319:23): [True: 23.6k, False: 0] | | | | ------------------ | | ------------------ | | | Branch (320:22): [True: 21.6k, False: 1.99k] | | ------------------ ------------------ 4984| 23.6k| IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_GROUP_EFFECT)) { ------------------ | | 331| 21.6k|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 21.6k, False: 0] | | ------------------ ------------------ 4985| 21.6k| PINC; ------------------ | | 301| 21.6k|#define PINC do { \ | | 302| 21.6k| pfetch_prev = p; \ | | 303| 21.6k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 21.6k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 21.6k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 21.6k] | | | | ------------------ | | ------------------ | | 304| 21.6k|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 4986| 21.6k| if (PEND) return ONIGERR_END_PATTERN_IN_GROUP; ------------------ | | 299| 21.6k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 21.6k] | | | Branch (299:23): [True: 21.6k, False: 0] | | ------------------ ------------------ if (PEND) return ONIGERR_END_PATTERN_IN_GROUP; ------------------ | | 662| 0|#define ONIGERR_END_PATTERN_IN_GROUP -118 ------------------ 4987| | 4988| 21.6k| PFETCH(c); ------------------ | | 305| 21.6k|#define PFETCH(c) do { \ | | 306| 21.6k| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 21.6k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 21.6k] | | ------------------ | | 307| 21.6k| pfetch_prev = p; \ | | 308| 21.6k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 21.6k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 21.6k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 21.6k] | | | | ------------------ | | ------------------ | | 309| 21.6k|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 4989| 21.6k| switch (c) { 4990| 11.5k| case ':': /* (?:...) grouping only */ ------------------ | Branch (4990:5): [True: 11.5k, False: 10.0k] ------------------ 4991| 11.5k| group: 4992| 11.5k| r = fetch_token(tok, &p, end, env); 4993| 11.5k| if (r < 0) return r; ------------------ | Branch (4993:11): [True: 0, False: 11.5k] ------------------ 4994| 11.5k| r = parse_subexp(np, tok, term, &p, end, env); 4995| 11.5k| if (r < 0) return r; ------------------ | Branch (4995:11): [True: 0, False: 11.5k] ------------------ 4996| 11.5k| *src = p; 4997| 11.5k| return 1; /* group */ 4998| 0| break; 4999| | 5000| 0| case '=': ------------------ | Branch (5000:5): [True: 0, False: 21.6k] ------------------ 5001| 0| *np = onig_node_new_anchor(ANCHOR_PREC_READ); ------------------ | | 551| 0|#define ANCHOR_PREC_READ (1<<10) ------------------ 5002| 0| break; 5003| 0| case '!': /* preceding read */ ------------------ | Branch (5003:5): [True: 0, False: 21.6k] ------------------ 5004| 0| *np = onig_node_new_anchor(ANCHOR_PREC_READ_NOT); ------------------ | | 552| 0|#define ANCHOR_PREC_READ_NOT (1<<11) ------------------ 5005| 0| break; 5006| 0| case '>': /* (?>...) stop backtrack */ ------------------ | Branch (5006:5): [True: 0, False: 21.6k] ------------------ 5007| 0| *np = node_new_enclose(ENCLOSE_STOP_BACKTRACK); ------------------ | | 96| 0|#define ENCLOSE_STOP_BACKTRACK (1<<2) ------------------ 5008| 0| break; 5009| 0| case '~': /* (?~...) absent operator */ ------------------ | Branch (5009:5): [True: 0, False: 21.6k] ------------------ 5010| 0| if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_TILDE_ABSENT)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 5011| 0| *np = node_new_enclose(ENCLOSE_ABSENT); ------------------ | | 98| 0|#define ENCLOSE_ABSENT (1<<4) ------------------ 5012| 0| } 5013| 0| else { 5014| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 663| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5015| 0| } 5016| 0| break; 5017| | 5018| 0|#ifdef USE_NAMED_GROUP 5019| 0| case '\'': ------------------ | Branch (5019:5): [True: 0, False: 21.6k] ------------------ 5020| 0| if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_LT_NAMED_GROUP)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 5021| 0| goto named_group1; 5022| 0| } 5023| 0| else 5024| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 663| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5025| 0| break; 5026| | 5027| 0|# ifdef USE_CAPITAL_P_NAMED_GROUP 5028| 0| case 'P': /* (?P...) */ ------------------ | Branch (5028:5): [True: 0, False: 21.6k] ------------------ 5029| 0| if (!PEND && ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ | Branch (5029:11): [True: 0, False: 0] ------------------ 5030| 0| IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_CAPITAL_P_NAMED_GROUP)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 5031| 0| PFETCH(c); ------------------ | | 305| 0|#define PFETCH(c) do { \ | | 306| 0| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 0] | | ------------------ | | 307| 0| pfetch_prev = p; \ | | 308| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 309| 0|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 5032| 0| if (c == '<') goto named_group1; ------------------ | Branch (5032:6): [True: 0, False: 0] ------------------ 5033| 0| } 5034| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 663| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5035| 0| break; 5036| 0|# endif 5037| 0|#endif 5038| | 5039| 8.06k| case '<': /* look behind (?<=...), (?max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 8.06k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 8.06k] | | ------------------ | | 307| 8.06k| pfetch_prev = p; \ | | 308| 8.06k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 8.06k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 8.06k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 8.06k] | | | | ------------------ | | ------------------ | | 309| 8.06k|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 5042| 8.06k| if (c == '=') ------------------ | Branch (5042:11): [True: 0, False: 8.06k] ------------------ 5043| 0| *np = onig_node_new_anchor(ANCHOR_LOOK_BEHIND); ------------------ | | 553| 0|#define ANCHOR_LOOK_BEHIND (1<<12) ------------------ 5044| 8.06k| else if (c == '!') ------------------ | Branch (5044:16): [True: 0, False: 8.06k] ------------------ 5045| 0| *np = onig_node_new_anchor(ANCHOR_LOOK_BEHIND_NOT); ------------------ | | 554| 0|#define ANCHOR_LOOK_BEHIND_NOT (1<<13) ------------------ 5046| 8.06k|#ifdef USE_NAMED_GROUP 5047| 8.06k| else { /* (?...) */ 5048| 8.06k| if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_LT_NAMED_GROUP)) { ------------------ | | 331| 8.06k|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 8.06k, False: 0] | | ------------------ ------------------ 5049| 8.06k| UChar *name; ------------------ | | 76| 8.06k|# define UChar OnigUChar ------------------ 5050| 8.06k| UChar *name_end; ------------------ | | 76| 8.06k|# define UChar OnigUChar ------------------ 5051| | 5052| 8.06k| PUNFETCH; ------------------ | | 300| 8.06k|#define PUNFETCH p = pfetch_prev ------------------ 5053| 8.06k| c = '<'; 5054| | 5055| 8.06k| named_group1: 5056| 8.06k| list_capture = 0; 5057| | 5058| 8.06k|# ifdef USE_CAPTURE_HISTORY 5059| 8.06k| named_group2: 5060| 8.06k|# endif 5061| 8.06k| name = p; 5062| 8.06k| r = fetch_name((OnigCodePoint )c, &p, end, &name_end, env, &num, 0); 5063| 8.06k| if (r < 0) return r; ------------------ | Branch (5063:8): [True: 0, False: 8.06k] ------------------ 5064| | 5065| 8.06k| num = scan_env_add_mem_entry(env); 5066| 8.06k| if (num < 0) return num; ------------------ | Branch (5066:8): [True: 0, False: 8.06k] ------------------ 5067| 8.06k| if (list_capture != 0 && num >= (int )BIT_STATUS_BITS_NUM) ------------------ | | 367| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) ------------------ | Branch (5067:8): [True: 0, False: 8.06k] | Branch (5067:29): [True: 0, False: 0] ------------------ 5068| 0| return ONIGERR_GROUP_NUMBER_OVER_FOR_CAPTURE_HISTORY; ------------------ | | 690| 0|#define ONIGERR_GROUP_NUMBER_OVER_FOR_CAPTURE_HISTORY -222 ------------------ 5069| | 5070| 8.06k| r = name_add(env->reg, name, name_end, num, env); 5071| 8.06k| if (r != 0) return r; ------------------ | Branch (5071:8): [True: 0, False: 8.06k] ------------------ 5072| 8.06k| *np = node_new_enclose_memory(env->option, 1); 5073| 8.06k| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 314| 8.06k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 8.06k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 8.06k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 5074| 8.06k| NENCLOSE(*np)->regnum = num; ------------------ | | 81| 8.06k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 5075| 8.06k| if (list_capture != 0) ------------------ | Branch (5075:8): [True: 0, False: 8.06k] ------------------ 5076| 0| BIT_STATUS_ON_AT_SIMPLE(env->capture_history, num); ------------------ | | 380| 0|#define BIT_STATUS_ON_AT_SIMPLE(stats,n) do {\ | | 381| 0| if ((n) < (int )BIT_STATUS_BITS_NUM)\ | | ------------------ | | | | 367| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (381:7): [True: 0, False: 0] | | ------------------ | | 382| 0| (stats) |= (1 << (n));\ | | 383| 0|} while (0) | | ------------------ | | | Branch (383:10): [Folded - Ignored] | | ------------------ ------------------ 5077| 8.06k| env->num_named++; 5078| 8.06k| } 5079| 0| else { 5080| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 663| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5081| 0| } 5082| 8.06k| } 5083| |#else 5084| | else { 5085| | return ONIGERR_UNDEFINED_GROUP_OPTION; 5086| | } 5087| |#endif 5088| 8.06k| break; 5089| | 5090| 8.06k|#ifdef USE_CAPTURE_HISTORY 5091| 8.06k| case '@': ------------------ | Branch (5091:5): [True: 0, False: 21.6k] ------------------ 5092| 0| if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_ATMARK_CAPTURE_HISTORY)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 5093| 0|# ifdef USE_NAMED_GROUP 5094| 0| if (!PEND && ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ | Branch (5094:6): [True: 0, False: 0] ------------------ 5095| 0| IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_LT_NAMED_GROUP)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 5096| 0| PFETCH(c); ------------------ | | 305| 0|#define PFETCH(c) do { \ | | 306| 0| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 0] | | ------------------ | | 307| 0| pfetch_prev = p; \ | | 308| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 309| 0|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 5097| 0| if (c == '<' || c == '\'') { ------------------ | Branch (5097:8): [True: 0, False: 0] | Branch (5097:20): [True: 0, False: 0] ------------------ 5098| 0| list_capture = 1; 5099| 0| goto named_group2; /* (?@...) */ 5100| 0| } 5101| 0| PUNFETCH; ------------------ | | 300| 0|#define PUNFETCH p = pfetch_prev ------------------ 5102| 0| } 5103| 0|# endif 5104| 0| *np = node_new_enclose_memory(env->option, 0); 5105| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 314| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 5106| 0| num = scan_env_add_mem_entry(env); 5107| 0| if (num < 0) return num; ------------------ | Branch (5107:6): [True: 0, False: 0] ------------------ 5108| 0| if (num >= (int )BIT_STATUS_BITS_NUM) ------------------ | | 367| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) ------------------ | Branch (5108:6): [True: 0, False: 0] ------------------ 5109| 0| return ONIGERR_GROUP_NUMBER_OVER_FOR_CAPTURE_HISTORY; ------------------ | | 690| 0|#define ONIGERR_GROUP_NUMBER_OVER_FOR_CAPTURE_HISTORY -222 ------------------ 5110| | 5111| 0| NENCLOSE(*np)->regnum = num; ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 5112| 0| BIT_STATUS_ON_AT_SIMPLE(env->capture_history, num); ------------------ | | 380| 0|#define BIT_STATUS_ON_AT_SIMPLE(stats,n) do {\ | | 381| 0| if ((n) < (int )BIT_STATUS_BITS_NUM)\ | | ------------------ | | | | 367| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (381:7): [True: 0, False: 0] | | ------------------ | | 382| 0| (stats) |= (1 << (n));\ | | 383| 0|} while (0) | | ------------------ | | | Branch (383:10): [Folded - Ignored] | | ------------------ ------------------ 5113| 0| } 5114| 0| else { 5115| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 663| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5116| 0| } 5117| 0| break; 5118| 0|#endif /* USE_CAPTURE_HISTORY */ 5119| | 5120| 0| case '(': /* conditional expression: (?(cond)yes), (?(cond)yes|no) */ ------------------ | Branch (5120:5): [True: 0, False: 21.6k] ------------------ 5121| 0| if (!PEND && ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ | Branch (5121:11): [True: 0, False: 0] ------------------ 5122| 0| IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_LPAREN_CONDITION)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 5123| 0| UChar *name = NULL; ------------------ | | 76| 0|# define UChar OnigUChar ------------------ 5124| 0| UChar *name_end; ------------------ | | 76| 0|# define UChar OnigUChar ------------------ 5125| 0| PFETCH(c); ------------------ | | 305| 0|#define PFETCH(c) do { \ | | 306| 0| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 0] | | ------------------ | | 307| 0| pfetch_prev = p; \ | | 308| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 309| 0|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 5126| 0| if (ONIGENC_IS_CODE_DIGIT(enc, c)) { /* (n) */ ------------------ | | 400| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_DIGIT) | | ------------------ | | | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (375:48): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 5127| 0| PUNFETCH; ------------------ | | 300| 0|#define PUNFETCH p = pfetch_prev ------------------ 5128| 0| r = fetch_name((OnigCodePoint )'(', &p, end, &name_end, env, &num, 1); 5129| 0| if (r < 0) return r; ------------------ | Branch (5129:8): [True: 0, False: 0] ------------------ 5130| |#if 0 5131| | /* Relative number is not currently supported. (same as Perl) */ 5132| | if (num < 0) { 5133| | num = BACKREF_REL_TO_ABS(num, env); 5134| | if (num <= 0) 5135| | return ONIGERR_INVALID_BACKREF; 5136| | } 5137| |#endif 5138| 0| if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_STRICT_CHECK_BACKREF)) { ------------------ | | 332| 0|#define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0) | | ------------------ | | | Branch (332:35): [True: 0, False: 0] | | ------------------ ------------------ 5139| 0| if (num > env->num_mem || ------------------ | Branch (5139:10): [True: 0, False: 0] ------------------ 5140| 0| IS_NULL(SCANENV_MEM_NODES(env)[num])) ------------------ | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 0] | | | Branch (311:49): [True: 0, False: 0] | | ------------------ ------------------ 5141| 0| return ONIGERR_INVALID_BACKREF; ------------------ | | 677| 0|#define ONIGERR_INVALID_BACKREF -208 ------------------ 5142| 0| } 5143| 0| } 5144| 0|#ifdef USE_NAMED_GROUP 5145| 0| else if (c == '<' || c == '\'') { /* (), ('name') */ ------------------ | Branch (5145:11): [True: 0, False: 0] | Branch (5145:23): [True: 0, False: 0] ------------------ 5146| 0| name = p; 5147| 0| r = fetch_named_backref_token(c, tok, &p, end, env); 5148| 0| if (r < 0) return r; ------------------ | Branch (5148:8): [True: 0, False: 0] ------------------ 5149| 0| if (!PPEEK_IS(')')) return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 320| 0|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 0|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | | | ------------------ | | | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 291| 0|#define PEND_VALUE 0 | | | | ------------------ | | | | | Branch (319:23): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ if (!PPEEK_IS(')')) return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 663| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ | Branch (5149:8): [True: 0, False: 0] ------------------ 5150| 0| PINC; ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 5151| | 5152| 0| if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_USE_LEFT_MOST_NAMED_GROUP)) { ------------------ | | 332| 0|#define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0) | | ------------------ | | | Branch (332:35): [True: 0, False: 0] | | ------------------ ------------------ 5153| 0| num = tok->u.backref.ref1; 5154| 0| } 5155| 0| else { 5156| | /* FIXME: 5157| | * Use left most named group for now. This is the same as Perl. 5158| | * However this should use the same strategy as normal back- 5159| | * references on Ruby syntax; search right to left. */ 5160| 0| int len = tok->u.backref.num; 5161| 0| num = len > 1 ? tok->u.backref.refs[0] : tok->u.backref.ref1; ------------------ | Branch (5161:12): [True: 0, False: 0] ------------------ 5162| 0| } 5163| 0| } 5164| 0|#endif 5165| 0| else 5166| 0| return ONIGERR_INVALID_CONDITION_PATTERN; ------------------ | | 667| 0|#define ONIGERR_INVALID_CONDITION_PATTERN -124 ------------------ 5167| 0| *np = node_new_enclose(ENCLOSE_CONDITION); ------------------ | | 97| 0|#define ENCLOSE_CONDITION (1<<3) ------------------ 5168| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 314| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 5169| 0| NENCLOSE(*np)->regnum = num; ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 5170| 0| if (IS_NOT_NULL(name)) NENCLOSE(*np)->state |= NST_NAME_REF; ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ if (IS_NOT_NULL(name)) NENCLOSE(*np)->state |= NST_NAME_REF; ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ if (IS_NOT_NULL(name)) NENCLOSE(*np)->state |= NST_NAME_REF; ------------------ | | 139| 0|#define NST_NAME_REF (1<<11) ------------------ 5171| 0| } 5172| 0| else 5173| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 663| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5174| 0| break; 5175| | 5176| |#if 0 5177| | case '|': /* branch reset: (?|...) */ 5178| | if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_VBAR_BRANCH_RESET)) { 5179| | /* TODO */ 5180| | } 5181| | else 5182| | return ONIGERR_UNDEFINED_GROUP_OPTION; 5183| | break; 5184| |#endif 5185| | 5186| 0| case '^': /* loads default options */ ------------------ | Branch (5186:5): [True: 0, False: 21.6k] ------------------ 5187| 0| if (!PEND && IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL)) { ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ if (!PEND && IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ | Branch (5187:11): [True: 0, False: 0] ------------------ 5188| | /* d-imsx */ 5189| 0| ONOFF(option, ONIG_OPTION_ASCII_RANGE, 1); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [Folded - Ignored] | | ------------------ ------------------ 5190| 0| ONOFF(option, ONIG_OPTION_IGNORECASE, 1); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [Folded - Ignored] | | ------------------ ------------------ 5191| 0| ONOFF(option, ONIG_OPTION_SINGLELINE, 0); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [Folded - Ignored] | | ------------------ ------------------ 5192| 0| ONOFF(option, ONIG_OPTION_MULTILINE, 1); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [Folded - Ignored] | | ------------------ ------------------ 5193| 0| ONOFF(option, ONIG_OPTION_EXTEND, 1); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [Folded - Ignored] | | ------------------ ------------------ 5194| 0| PFETCH(c); ------------------ | | 305| 0|#define PFETCH(c) do { \ | | 306| 0| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 0] | | ------------------ | | 307| 0| pfetch_prev = p; \ | | 308| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 309| 0|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 5195| 0| } 5196| |#if 0 5197| | else if (!PEND && IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_RUBY)) { 5198| | /* d-imx */ 5199| | ONOFF(option, ONIG_OPTION_ASCII_RANGE, 0); 5200| | ONOFF(option, ONIG_OPTION_POSIX_BRACKET_ALL_RANGE, 0); 5201| | ONOFF(option, ONIG_OPTION_WORD_BOUND_ALL_RANGE, 0); 5202| | ONOFF(option, ONIG_OPTION_IGNORECASE, 1); 5203| | ONOFF(option, ONIG_OPTION_MULTILINE, 1); 5204| | ONOFF(option, ONIG_OPTION_EXTEND, 1); 5205| | PFETCH(c); 5206| | } 5207| |#endif 5208| 0| else { 5209| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 663| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5210| 0| } 5211| | /* fall through */ 5212| |#ifdef USE_POSIXLINE_OPTION 5213| | case 'p': 5214| |#endif 5215| 1.95k| case '-': case 'i': case 'm': case 's': case 'x': ------------------ | Branch (5215:5): [True: 0, False: 21.6k] | Branch (5215:15): [True: 0, False: 21.6k] | Branch (5215:25): [True: 0, False: 21.6k] | Branch (5215:35): [True: 0, False: 21.6k] | Branch (5215:45): [True: 1.95k, False: 19.6k] ------------------ 5216| 1.95k| case 'a': case 'd': case 'l': case 'u': ------------------ | Branch (5216:5): [True: 0, False: 21.6k] | Branch (5216:15): [True: 0, False: 21.6k] | Branch (5216:25): [True: 0, False: 21.6k] | Branch (5216:35): [True: 0, False: 21.6k] ------------------ 5217| 1.95k| { 5218| 1.95k| int neg = 0; 5219| | 5220| 3.91k| while (1) { ------------------ | Branch (5220:9): [Folded - Ignored] ------------------ 5221| 3.91k| switch (c) { 5222| 1.95k| case ':': ------------------ | Branch (5222:4): [True: 1.95k, False: 1.95k] ------------------ 5223| 1.95k| case ')': ------------------ | Branch (5223:4): [True: 0, False: 3.91k] ------------------ 5224| 1.95k| break; 5225| | 5226| 0| case '-': neg = 1; break; ------------------ | Branch (5226:4): [True: 0, False: 3.91k] ------------------ 5227| 1.95k| case 'x': ONOFF(option, ONIG_OPTION_EXTEND, neg); break; ------------------ | | 160| 1.95k|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [True: 0, False: 1.95k] | | ------------------ ------------------ | Branch (5227:4): [True: 1.95k, False: 1.95k] ------------------ 5228| 0| case 'i': ONOFF(option, ONIG_OPTION_IGNORECASE, neg); break; ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [True: 0, False: 0] | | ------------------ ------------------ | Branch (5228:4): [True: 0, False: 3.91k] ------------------ 5229| 0| case 's': ------------------ | Branch (5229:4): [True: 0, False: 3.91k] ------------------ 5230| 0| if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 5231| 0| ONOFF(option, ONIG_OPTION_MULTILINE, neg); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [True: 0, False: 0] | | ------------------ ------------------ 5232| 0| } 5233| 0| else 5234| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 663| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5235| 0| break; 5236| | 5237| 0| case 'm': ------------------ | Branch (5237:4): [True: 0, False: 3.91k] ------------------ 5238| 0| if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 5239| 0| ONOFF(option, ONIG_OPTION_SINGLELINE, (neg == 0 ? 1 : 0)); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [True: 0, False: 0] | | | Branch (160:33): [True: 0, False: 0] | | ------------------ ------------------ 5240| 0| } 5241| 0| else if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_RUBY)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 5242| 0| ONOFF(option, ONIG_OPTION_MULTILINE, neg); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [True: 0, False: 0] | | ------------------ ------------------ 5243| 0| } 5244| 0| else 5245| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 663| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5246| 0| break; 5247| |#ifdef USE_POSIXLINE_OPTION 5248| | case 'p': 5249| | ONOFF(option, ONIG_OPTION_MULTILINE|ONIG_OPTION_SINGLELINE, neg); 5250| | break; 5251| |#endif 5252| | 5253| 0| case 'a': /* limits \d, \s, \w and POSIX brackets to ASCII range */ ------------------ | Branch (5253:4): [True: 0, False: 3.91k] ------------------ 5254| 0| if ((IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL) || ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 5255| 0| IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_RUBY)) && ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 5256| 0| (neg == 0)) { ------------------ | Branch (5256:3): [True: 0, False: 0] ------------------ 5257| 0| ONOFF(option, ONIG_OPTION_ASCII_RANGE, 0); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [Folded - Ignored] | | ------------------ ------------------ 5258| 0| ONOFF(option, ONIG_OPTION_POSIX_BRACKET_ALL_RANGE, 1); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [Folded - Ignored] | | ------------------ ------------------ 5259| 0| ONOFF(option, ONIG_OPTION_WORD_BOUND_ALL_RANGE, 1); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [Folded - Ignored] | | ------------------ ------------------ 5260| 0| } 5261| 0| else 5262| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 663| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5263| 0| break; 5264| | 5265| 0| case 'u': ------------------ | Branch (5265:4): [True: 0, False: 3.91k] ------------------ 5266| 0| if ((IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL) || ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 5267| 0| IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_RUBY)) && ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 5268| 0| (neg == 0)) { ------------------ | Branch (5268:3): [True: 0, False: 0] ------------------ 5269| 0| ONOFF(option, ONIG_OPTION_ASCII_RANGE, 1); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [Folded - Ignored] | | ------------------ ------------------ 5270| 0| ONOFF(option, ONIG_OPTION_POSIX_BRACKET_ALL_RANGE, 1); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [Folded - Ignored] | | ------------------ ------------------ 5271| 0| ONOFF(option, ONIG_OPTION_WORD_BOUND_ALL_RANGE, 1); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [Folded - Ignored] | | ------------------ ------------------ 5272| 0| } 5273| 0| else 5274| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 663| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5275| 0| break; 5276| | 5277| 0| case 'd': ------------------ | Branch (5277:4): [True: 0, False: 3.91k] ------------------ 5278| 0| if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL) && ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 5279| 0| (neg == 0)) { ------------------ | Branch (5279:3): [True: 0, False: 0] ------------------ 5280| 0| ONOFF(option, ONIG_OPTION_ASCII_RANGE, 1); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [Folded - Ignored] | | ------------------ ------------------ 5281| 0| } 5282| 0| else if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_RUBY) && ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 5283| 0| (neg == 0)) { ------------------ | Branch (5283:3): [True: 0, False: 0] ------------------ 5284| 0| ONOFF(option, ONIG_OPTION_ASCII_RANGE, 0); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [Folded - Ignored] | | ------------------ ------------------ 5285| 0| ONOFF(option, ONIG_OPTION_POSIX_BRACKET_ALL_RANGE, 0); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [Folded - Ignored] | | ------------------ ------------------ 5286| 0| ONOFF(option, ONIG_OPTION_WORD_BOUND_ALL_RANGE, 0); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [Folded - Ignored] | | ------------------ ------------------ 5287| 0| } 5288| 0| else 5289| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 663| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5290| 0| break; 5291| | 5292| 0| case 'l': ------------------ | Branch (5292:4): [True: 0, False: 3.91k] ------------------ 5293| 0| if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL) && (neg == 0)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ | Branch (5293:66): [True: 0, False: 0] ------------------ 5294| 0| ONOFF(option, ONIG_OPTION_ASCII_RANGE, 1); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [Folded - Ignored] | | ------------------ ------------------ 5295| 0| } 5296| 0| else 5297| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 663| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5298| 0| break; 5299| | 5300| 0| default: ------------------ | Branch (5300:4): [True: 0, False: 3.91k] ------------------ 5301| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 663| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5302| 3.91k| } 5303| | 5304| 3.91k| if (c == ')') { ------------------ | Branch (5304:8): [True: 0, False: 3.91k] ------------------ 5305| 0| *np = node_new_option(option); 5306| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 314| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 5307| 0| *src = p; 5308| 0| return 2; /* option only */ 5309| 0| } 5310| 3.91k| else if (c == ':') { ------------------ | Branch (5310:13): [True: 1.95k, False: 1.95k] ------------------ 5311| 1.95k| OnigOptionType prev = env->option; 5312| | 5313| 1.95k| env->option = option; 5314| 1.95k| r = fetch_token(tok, &p, end, env); 5315| 1.95k| if (r < 0) { ------------------ | Branch (5315:10): [True: 0, False: 1.95k] ------------------ 5316| 0| env->option = prev; 5317| 0| return r; 5318| 0| } 5319| 1.95k| r = parse_subexp(&target, tok, term, &p, end, env); 5320| 1.95k| env->option = prev; 5321| 1.95k| if (r < 0) return r; ------------------ | Branch (5321:10): [True: 0, False: 1.95k] ------------------ 5322| 1.95k| *np = node_new_option(option); 5323| 1.95k| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 314| 1.95k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 1.95k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 1.95k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 5324| 1.95k| NENCLOSE(*np)->target = target; ------------------ | | 81| 1.95k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 5325| 1.95k| *src = p; 5326| 1.95k| return 0; 5327| 1.95k| } 5328| | 5329| 1.95k| if (PEND) return ONIGERR_END_PATTERN_IN_GROUP; ------------------ | | 299| 1.95k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 1.95k] | | | Branch (299:23): [True: 1.95k, False: 0] | | ------------------ ------------------ if (PEND) return ONIGERR_END_PATTERN_IN_GROUP; ------------------ | | 662| 0|#define ONIGERR_END_PATTERN_IN_GROUP -118 ------------------ 5330| 1.95k| PFETCH(c); ------------------ | | 305| 1.95k|#define PFETCH(c) do { \ | | 306| 1.95k| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 1.95k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 1.95k] | | ------------------ | | 307| 1.95k| pfetch_prev = p; \ | | 308| 1.95k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 1.95k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 1.95k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 1.95k] | | | | ------------------ | | ------------------ | | 309| 1.95k|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 5331| 1.95k| } 5332| 1.95k| } 5333| 0| break; 5334| | 5335| 0| default: ------------------ | Branch (5335:5): [True: 0, False: 21.6k] ------------------ 5336| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 663| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5337| 21.6k| } 5338| 21.6k| } 5339| 1.99k| else { 5340| 1.99k| if (ONIG_IS_OPTION_ON(env->option, ONIG_OPTION_DONT_CAPTURE_GROUP)) ------------------ | | 479| 1.99k|#define ONIG_IS_OPTION_ON(options,option) ((options) & (option)) | | ------------------ | | | Branch (479:45): [True: 0, False: 1.99k] | | ------------------ ------------------ 5341| 0| goto group; 5342| | 5343| 1.99k| *np = node_new_enclose_memory(env->option, 0); 5344| 1.99k| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 314| 1.99k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 1.99k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 1.99k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 5345| 1.99k| num = scan_env_add_mem_entry(env); 5346| 1.99k| if (num < 0) return num; ------------------ | Branch (5346:9): [True: 0, False: 1.99k] ------------------ 5347| 1.99k| NENCLOSE(*np)->regnum = num; ------------------ | | 81| 1.99k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 5348| 1.99k| } 5349| | 5350| 10.0k| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 314| 10.0k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 10.0k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 10.0k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 5351| 10.0k| r = fetch_token(tok, &p, end, env); 5352| 10.0k| if (r < 0) return r; ------------------ | Branch (5352:7): [True: 0, False: 10.0k] ------------------ 5353| 10.0k| r = parse_subexp(&target, tok, term, &p, end, env); 5354| 10.0k| if (r < 0) { ------------------ | Branch (5354:7): [True: 0, False: 10.0k] ------------------ 5355| 0| onig_node_free(target); 5356| 0| return r; 5357| 0| } 5358| | 5359| 10.0k| if (NTYPE(*np) == NT_ANCHOR) ------------------ | | 69| 10.0k|#define NTYPE(node) ((node)->u.base.type) ------------------ if (NTYPE(*np) == NT_ANCHOR) ------------------ | | 45| 10.0k|#define NT_ANCHOR 7 ------------------ | Branch (5359:7): [True: 0, False: 10.0k] ------------------ 5360| 0| NANCHOR(*np)->target = target; ------------------ | | 82| 0|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 5361| 10.0k| else { 5362| 10.0k| NENCLOSE(*np)->target = target; ------------------ | | 81| 10.0k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 5363| 10.0k| if (NENCLOSE(*np)->type == ENCLOSE_MEMORY) { ------------------ | | 81| 10.0k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ if (NENCLOSE(*np)->type == ENCLOSE_MEMORY) { ------------------ | | 94| 10.0k|#define ENCLOSE_MEMORY (1<<0) ------------------ | Branch (5363:9): [True: 10.0k, False: 0] ------------------ 5364| | /* Don't move this to previous of parse_subexp() */ 5365| 10.0k| r = scan_env_set_mem_node(env, NENCLOSE(*np)->regnum, *np); ------------------ | | 81| 10.0k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 5366| 10.0k| if (r != 0) return r; ------------------ | Branch (5366:11): [True: 0, False: 10.0k] ------------------ 5367| 10.0k| } 5368| 0| else if (NENCLOSE(*np)->type == ENCLOSE_CONDITION) { ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ else if (NENCLOSE(*np)->type == ENCLOSE_CONDITION) { ------------------ | | 97| 0|#define ENCLOSE_CONDITION (1<<3) ------------------ | Branch (5368:14): [True: 0, False: 0] ------------------ 5369| 0| if (NTYPE(target) != NT_ALT) { ------------------ | | 69| 0|#define NTYPE(node) ((node)->u.base.type) ------------------ if (NTYPE(target) != NT_ALT) { ------------------ | | 47| 0|#define NT_ALT 9 ------------------ | Branch (5369:11): [True: 0, False: 0] ------------------ 5370| | /* convert (?(cond)yes) to (?(cond)yes|empty) */ 5371| 0| work1 = node_new_empty(); 5372| 0| if (IS_NULL(work1)) goto err; ------------------ | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 0] | | ------------------ ------------------ 5373| 0| work2 = onig_node_new_alt(work1, NULL_NODE); ------------------ | | 283| 0|#define NULL_NODE ((Node* )0) ------------------ 5374| 0| if (IS_NULL(work2)) goto err; ------------------ | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 0] | | ------------------ ------------------ 5375| 0| work1 = onig_node_new_alt(target, work2); 5376| 0| if (IS_NULL(work1)) goto err; ------------------ | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 0] | | ------------------ ------------------ 5377| 0| NENCLOSE(*np)->target = work1; ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 5378| 0| } 5379| 0| } 5380| 10.0k| } 5381| | 5382| 10.0k| *src = p; 5383| 10.0k| return 0; 5384| | 5385| 0| err: 5386| 0| onig_node_free(work1); 5387| 0| onig_node_free(work2); 5388| 0| onig_node_free(*np); 5389| 0| *np = NULL; 5390| 0| return ONIGERR_MEMORY; ------------------ | | 632| 0|#define ONIGERR_MEMORY -5 ------------------ 5391| 10.0k|} regparse.c:scan_env_add_mem_entry: 1016| 10.0k|{ 1017| 10.0k| int i, need, alloc; 1018| 10.0k| Node** p; 1019| | 1020| 10.0k| need = env->num_mem + 1; 1021| 10.0k| if (need > ONIG_MAX_CAPTURE_GROUP_NUM) ------------------ | | 441| 10.0k|#define ONIG_MAX_CAPTURE_GROUP_NUM 32767 ------------------ | Branch (1021:7): [True: 0, False: 10.0k] ------------------ 1022| 0| return ONIGERR_TOO_MANY_CAPTURE_GROUPS; ------------------ | | 679| 0|#define ONIGERR_TOO_MANY_CAPTURE_GROUPS -210 ------------------ 1023| 10.0k| if (need >= SCANENV_MEMNODES_SIZE) { ------------------ | | 285| 10.0k|#define SCANENV_MEMNODES_SIZE 8 ------------------ | Branch (1023:7): [True: 0, False: 10.0k] ------------------ 1024| 0| if (env->mem_alloc <= need) { ------------------ | Branch (1024:9): [True: 0, False: 0] ------------------ 1025| 0| if (IS_NULL(env->mem_nodes_dynamic)) { ------------------ | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 0] | | ------------------ ------------------ 1026| 0| alloc = INIT_SCANENV_MEMNODES_ALLOC_SIZE; ------------------ | | 980| 0|#define INIT_SCANENV_MEMNODES_ALLOC_SIZE 16 ------------------ 1027| 0| p = (Node** )xmalloc(sizeof(Node*) * alloc); ------------------ | | 142| 0|# define xmalloc malloc ------------------ 1028| 0| CHECK_NULL_RETURN_MEMERR(p); ------------------ | | 314| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 1029| 0| xmemcpy(p, env->mem_nodes_static, ------------------ | | 215| 0|#define xmemcpy memcpy ------------------ 1030| 0| sizeof(Node*) * SCANENV_MEMNODES_SIZE); ------------------ | | 285| 0|#define SCANENV_MEMNODES_SIZE 8 ------------------ 1031| 0| } 1032| 0| else { 1033| 0| alloc = env->mem_alloc * 2; 1034| 0| p = (Node** )xrealloc(env->mem_nodes_dynamic, sizeof(Node*) * alloc); ------------------ | | 143| 0|# define xrealloc realloc ------------------ 1035| 0| CHECK_NULL_RETURN_MEMERR(p); ------------------ | | 314| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 1036| 0| } 1037| | 1038| 0| for (i = env->num_mem + 1; i < alloc; i++) ------------------ | Branch (1038:34): [True: 0, False: 0] ------------------ 1039| 0| p[i] = NULL_NODE; ------------------ | | 283| 0|#define NULL_NODE ((Node* )0) ------------------ 1040| | 1041| 0| env->mem_nodes_dynamic = p; 1042| 0| env->mem_alloc = alloc; 1043| 0| } 1044| 0| } 1045| | 1046| 10.0k| env->num_mem++; 1047| 10.0k| return env->num_mem; 1048| 10.0k|} regparse.c:name_add: 773| 8.06k|{ 774| 8.06k| int alloc; 775| 8.06k| NameEntry* e; 776| 8.06k| NameTable* t = (NameTable* )reg->name_table; 777| | 778| 8.06k| if (name_end - name <= 0) ------------------ | Branch (778:7): [True: 0, False: 8.06k] ------------------ 779| 0| return ONIGERR_EMPTY_GROUP_NAME; ------------------ | | 682| 0|#define ONIGERR_EMPTY_GROUP_NAME -214 ------------------ 780| | 781| 8.06k| e = name_find(reg, name, name_end); 782| 8.06k| if (IS_NULL(e)) { ------------------ | | 311| 8.06k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 8.06k, False: 0] | | ------------------ ------------------ 783| 8.06k|# ifdef USE_ST_LIBRARY 784| 8.06k| if (IS_NULL(t)) { ------------------ | | 311| 8.06k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 2.01k, False: 6.05k] | | ------------------ ------------------ 785| 2.01k| t = onig_st_init_strend_table_with_size(5); 786| 2.01k| reg->name_table = (void* )t; 787| 2.01k| } 788| 8.06k| e = (NameEntry* )xmalloc(sizeof(NameEntry)); ------------------ | | 142| 8.06k|# define xmalloc malloc ------------------ 789| 8.06k| CHECK_NULL_RETURN_MEMERR(e); ------------------ | | 314| 8.06k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 8.06k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 8.06k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 790| | 791| 8.06k| e->name = strdup_with_null(reg->enc, name, name_end); 792| 8.06k| if (IS_NULL(e->name)) { ------------------ | | 311| 8.06k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 8.06k] | | ------------------ ------------------ 793| 0| xfree(e); ------------------ | | 145| 0|# define xfree free ------------------ 794| 0| return ONIGERR_MEMORY; ------------------ | | 632| 0|#define ONIGERR_MEMORY -5 ------------------ 795| 0| } 796| 8.06k| onig_st_insert_strend(t, e->name, (e->name + (name_end - name)), 797| 8.06k| (HashDataType )e); 798| | 799| 8.06k| e->name_len = name_end - name; 800| 8.06k| e->back_num = 0; 801| 8.06k| e->back_alloc = 0; 802| 8.06k| e->back_refs = (int* )NULL; 803| | 804| |# else 805| | 806| | if (IS_NULL(t)) { 807| | alloc = INIT_NAMES_ALLOC_NUM; 808| | t = (NameTable* )xmalloc(sizeof(NameTable)); 809| | CHECK_NULL_RETURN_MEMERR(t); 810| | t->e = NULL; 811| | t->alloc = 0; 812| | t->num = 0; 813| | 814| | t->e = (NameEntry* )xmalloc(sizeof(NameEntry) * alloc); 815| | if (IS_NULL(t->e)) { 816| | xfree(t); 817| | return ONIGERR_MEMORY; 818| | } 819| | t->alloc = alloc; 820| | reg->name_table = t; 821| | goto clear; 822| | } 823| | else if (t->num == t->alloc) { 824| | int i; 825| | NameEntry* p; 826| | 827| | alloc = t->alloc * 2; 828| | p = (NameEntry* )xrealloc(t->e, sizeof(NameEntry) * alloc); 829| | CHECK_NULL_RETURN_MEMERR(p); 830| | t->e = p; 831| | t->alloc = alloc; 832| | 833| | clear: 834| | for (i = t->num; i < t->alloc; i++) { 835| | t->e[i].name = NULL; 836| | t->e[i].name_len = 0; 837| | t->e[i].back_num = 0; 838| | t->e[i].back_alloc = 0; 839| | t->e[i].back_refs = (int* )NULL; 840| | } 841| | } 842| | e = &(t->e[t->num]); 843| | t->num++; 844| | e->name = strdup_with_null(reg->enc, name, name_end); 845| | if (IS_NULL(e->name)) return ONIGERR_MEMORY; 846| | e->name_len = name_end - name; 847| |# endif 848| 8.06k| } 849| | 850| 8.06k| if (e->back_num >= 1 && ------------------ | Branch (850:7): [True: 0, False: 8.06k] ------------------ 851| 8.06k| ! IS_SYNTAX_BV(env->syntax, ONIG_SYN_ALLOW_MULTIPLEX_DEFINITION_NAME)) { ------------------ | | 332| 0|#define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0) ------------------ | Branch (851:7): [True: 0, False: 0] ------------------ 852| 0| onig_scan_env_set_error_string(env, ONIGERR_MULTIPLEX_DEFINED_NAME, ------------------ | | 687| 0|#define ONIGERR_MULTIPLEX_DEFINED_NAME -219 ------------------ 853| 0| name, name_end); 854| 0| return ONIGERR_MULTIPLEX_DEFINED_NAME; ------------------ | | 687| 0|#define ONIGERR_MULTIPLEX_DEFINED_NAME -219 ------------------ 855| 0| } 856| | 857| 8.06k| e->back_num++; 858| 8.06k| if (e->back_num == 1) { ------------------ | Branch (858:7): [True: 8.06k, False: 0] ------------------ 859| 8.06k| e->back_ref1 = backref; 860| 8.06k| } 861| 0| else { 862| 0| if (e->back_num == 2) { ------------------ | Branch (862:9): [True: 0, False: 0] ------------------ 863| 0| alloc = INIT_NAME_BACKREFS_ALLOC_NUM; ------------------ | | 451| 0|# define INIT_NAME_BACKREFS_ALLOC_NUM 8 ------------------ 864| 0| e->back_refs = (int* )xmalloc(sizeof(int) * alloc); ------------------ | | 142| 0|# define xmalloc malloc ------------------ 865| 0| CHECK_NULL_RETURN_MEMERR(e->back_refs); ------------------ | | 314| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 866| 0| e->back_alloc = alloc; 867| 0| e->back_refs[0] = e->back_ref1; 868| 0| e->back_refs[1] = backref; 869| 0| } 870| 0| else { 871| 0| if (e->back_num > e->back_alloc) { ------------------ | Branch (871:11): [True: 0, False: 0] ------------------ 872| 0| int* p; 873| 0| alloc = e->back_alloc * 2; 874| 0| p = (int* )xrealloc(e->back_refs, sizeof(int) * alloc); ------------------ | | 143| 0|# define xrealloc realloc ------------------ 875| 0| CHECK_NULL_RETURN_MEMERR(p); ------------------ | | 314| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 876| 0| e->back_refs = p; 877| 0| e->back_alloc = alloc; 878| 0| } 879| 0| e->back_refs[e->back_num - 1] = backref; 880| 0| } 881| 0| } 882| | 883| 8.06k| return 0; 884| 8.06k|} regparse.c:strdup_with_null: 271| 8.06k|{ 272| 8.06k| ptrdiff_t slen; 273| 8.06k| int term_len, i; 274| 8.06k| UChar *r; ------------------ | | 76| 8.06k|# define UChar OnigUChar ------------------ 275| | 276| 8.06k| slen = end - s; 277| 8.06k| term_len = ONIGENC_MBC_MINLEN(enc); ------------------ | | 367| 8.06k|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) ------------------ 278| | 279| 8.06k| r = (UChar* )xmalloc(slen + term_len); ------------------ | | 142| 8.06k|# define xmalloc malloc ------------------ 280| 8.06k| CHECK_NULL_RETURN(r); ------------------ | | 313| 8.06k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 311| 8.06k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 8.06k] | | | | ------------------ | | ------------------ ------------------ 281| 8.06k| xmemcpy(r, s, slen); ------------------ | | 215| 8.06k|#define xmemcpy memcpy ------------------ 282| | 283| 16.1k| for (i = 0; i < term_len; i++) ------------------ | Branch (283:15): [True: 8.06k, False: 8.06k] ------------------ 284| 8.06k| r[slen + i] = (UChar )0; 285| | 286| 8.06k| return r; 287| 8.06k|} regparse.c:node_new_option: 1368| 1.95k|{ 1369| 1.95k| Node* node = node_new_enclose(ENCLOSE_OPTION); ------------------ | | 95| 1.95k|#define ENCLOSE_OPTION (1<<1) ------------------ 1370| 1.95k| CHECK_NULL_RETURN(node); ------------------ | | 313| 1.95k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 311| 1.95k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 1.95k] | | | | ------------------ | | ------------------ ------------------ 1371| 1.95k| NENCLOSE(node)->option = option; ------------------ | | 81| 1.95k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1372| 1.95k| return node; 1373| 1.95k|} regparse.c:add_code_range_to_buf0: 1672| 610k|{ 1673| 610k| int r, inc_n, pos; 1674| 610k| OnigCodePoint low, high, bound, x; 1675| 610k| OnigCodePoint n, *data; 1676| 610k| BBuf* bbuf; 1677| | 1678| 610k| if (from > to) { ------------------ | Branch (1678:7): [True: 0, False: 610k] ------------------ 1679| 0| n = from; from = to; to = n; 1680| 0| } 1681| | 1682| 610k| if (IS_NULL(*pbuf)) { ------------------ | | 311| 610k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 24.3k, False: 586k] | | ------------------ ------------------ 1683| 24.3k| r = new_code_range(pbuf); 1684| 24.3k| if (r) return r; ------------------ | Branch (1684:9): [True: 0, False: 24.3k] ------------------ 1685| 24.3k| bbuf = *pbuf; 1686| 24.3k| n = 0; 1687| 24.3k| } 1688| 586k| else { 1689| 586k| bbuf = *pbuf; 1690| 586k| GET_CODE_POINT(n, bbuf->p); ------------------ | | 710| 586k|#define GET_CODE_POINT(code,p) code = *((OnigCodePoint* )(p)) ------------------ 1691| 586k| } 1692| 610k| data = (OnigCodePoint* )(bbuf->p); 1693| 610k| data++; 1694| | 1695| 610k| bound = (from == 0) ? 0 : n; ------------------ | Branch (1695:11): [True: 0, False: 610k] ------------------ 1696| 2.78M| for (low = 0; low < bound; ) { ------------------ | Branch (1696:17): [True: 2.17M, False: 610k] ------------------ 1697| 2.17M| x = (low + bound) >> 1; 1698| 2.17M| if (from - 1 > data[x*2 + 1]) ------------------ | Branch (1698:9): [True: 2.17M, False: 0] ------------------ 1699| 2.17M| low = x + 1; 1700| 0| else 1701| 0| bound = x; 1702| 2.17M| } 1703| | 1704| 610k| high = (to == ONIG_LAST_CODE_POINT) ? n : low; ------------------ | | 317| 610k|#define ONIG_LAST_CODE_POINT (~((OnigCodePoint )0)) ------------------ | Branch (1704:10): [True: 0, False: 610k] ------------------ 1705| 610k| for (bound = n; high < bound; ) { ------------------ | Branch (1705:19): [True: 0, False: 610k] ------------------ 1706| 0| x = (high + bound) >> 1; 1707| 0| if (to + 1 >= data[x*2]) ------------------ | Branch (1707:9): [True: 0, False: 0] ------------------ 1708| 0| high = x + 1; 1709| 0| else 1710| 0| bound = x; 1711| 0| } 1712| | /* data[(low-1)*2+1] << from <= data[low*2] 1713| | * data[(high-1)*2+1] <= to << data[high*2] 1714| | */ 1715| | 1716| 610k| inc_n = low + 1 - high; 1717| 610k| if (n + inc_n > ONIG_MAX_MULTI_BYTE_RANGES_NUM) ------------------ | | 444| 610k|#define ONIG_MAX_MULTI_BYTE_RANGES_NUM 10000 ------------------ | Branch (1717:7): [True: 0, False: 610k] ------------------ 1718| 0| return ONIGERR_TOO_MANY_MULTI_BYTE_RANGES; ------------------ | | 674| 0|#define ONIGERR_TOO_MANY_MULTI_BYTE_RANGES -205 ------------------ 1719| | 1720| 610k| if (inc_n != 1) { ------------------ | Branch (1720:7): [True: 0, False: 610k] ------------------ 1721| 0| if (checkdup && from <= data[low*2+1] ------------------ | Branch (1721:9): [True: 0, False: 0] | Branch (1721:21): [True: 0, False: 0] ------------------ 1722| 0| && (data[low*2] <= from || data[low*2+1] <= to)) ------------------ | Branch (1722:6): [True: 0, False: 0] | Branch (1722:29): [True: 0, False: 0] ------------------ 1723| 0| CC_DUP_WARN(env, from, to); 1724| 0| if (from > data[low*2]) ------------------ | Branch (1724:9): [True: 0, False: 0] ------------------ 1725| 0| from = data[low*2]; 1726| 0| if (to < data[(high - 1)*2 + 1]) ------------------ | Branch (1726:9): [True: 0, False: 0] ------------------ 1727| 0| to = data[(high - 1)*2 + 1]; 1728| 0| } 1729| | 1730| 610k| if (inc_n != 0) { ------------------ | Branch (1730:7): [True: 610k, False: 0] ------------------ 1731| 610k| int from_pos = SIZE_CODE_POINT * (1 + high * 2); ------------------ | | 696| 610k|#define SIZE_CODE_POINT (int )sizeof(OnigCodePoint) ------------------ 1732| 610k| int to_pos = SIZE_CODE_POINT * (1 + (low + 1) * 2); ------------------ | | 696| 610k|#define SIZE_CODE_POINT (int )sizeof(OnigCodePoint) ------------------ 1733| | 1734| 610k| if (inc_n > 0) { ------------------ | Branch (1734:9): [True: 610k, False: 0] ------------------ 1735| 610k| if (high < n) { ------------------ | Branch (1735:11): [True: 0, False: 610k] ------------------ 1736| 0| int size = (n - high) * 2 * SIZE_CODE_POINT; ------------------ | | 696| 0|#define SIZE_CODE_POINT (int )sizeof(OnigCodePoint) ------------------ 1737| 0| BBUF_MOVE_RIGHT(bbuf, from_pos, to_pos, size); ------------------ | | 510| 0|#define BBUF_MOVE_RIGHT(buf,from,to,n) do {\ | | 511| 0| if ((unsigned int )((to)+(n)) > (buf)->alloc) BBUF_EXPAND((buf),(to) + (n));\ | | ------------------ | | | | 470| 0|#define BBUF_EXPAND(buf,low) do{\ | | | | 471| 0| UChar *tmp;\ | | | | ------------------ | | | | | | 76| 0|# define UChar OnigUChar | | | | ------------------ | | | | 472| 0| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | ------------------ | | | | | Branch (472:36): [True: 0, False: 0] | | | | ------------------ | | | | 473| 0| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | ------------------ | | | | | | 143| 0|# define xrealloc realloc | | | | ------------------ | | | | 474| 0| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | ------------------ | | | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | ------------------ | | | | | | | Branch (311:39): [True: 0, False: 0] | | | | | | ------------------ | | | | ------------------ | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | ------------------ | | | | | | 632| 0|#define ONIGERR_MEMORY -5 | | | | ------------------ | | | | 475| 0| (buf)->p = tmp;\ | | | | 476| 0|} while (0) | | | | ------------------ | | | | | Branch (476:10): [Folded - Ignored] | | | | ------------------ | | ------------------ | | | Branch (511:7): [True: 0, False: 0] | | ------------------ | | 512| 0| xmemmove((buf)->p + (to), (buf)->p + (from), (n));\ | | ------------------ | | | | 216| 0|#define xmemmove memmove | | ------------------ | | 513| 0| if ((unsigned int )((to)+(n)) > (buf)->used) (buf)->used = (to) + (n);\ | | ------------------ | | | Branch (513:7): [True: 0, False: 0] | | ------------------ | | 514| 0|} while (0) | | ------------------ | | | Branch (514:10): [Folded - Ignored] | | ------------------ ------------------ 1738| 0| } 1739| 610k| } 1740| 0| else { 1741| 0| BBUF_MOVE_LEFT_REDUCE(bbuf, from_pos, to_pos); ------------------ | | 522| 0|#define BBUF_MOVE_LEFT_REDUCE(buf,from,to) do {\ | | 523| 0| xmemmove((buf)->p + (to), (buf)->p + (from), (buf)->used - (from));\ | | ------------------ | | | | 216| 0|#define xmemmove memmove | | ------------------ | | 524| 0| (buf)->used -= (from - to);\ | | 525| 0|} while (0) | | ------------------ | | | Branch (525:10): [Folded - Ignored] | | ------------------ ------------------ 1742| 0| } 1743| 610k| } 1744| | 1745| 610k| pos = SIZE_CODE_POINT * (1 + low * 2); ------------------ | | 696| 610k|#define SIZE_CODE_POINT (int )sizeof(OnigCodePoint) ------------------ 1746| 610k| BBUF_ENSURE_SIZE(bbuf, pos + SIZE_CODE_POINT * 2); ------------------ | | 478| 610k|#define BBUF_ENSURE_SIZE(buf,size) do{\ | | 479| 610k| unsigned int new_alloc = (buf)->alloc;\ | | 480| 682k| while (new_alloc < (unsigned int )(size)) { new_alloc *= 2; }\ | | ------------------ | | | Branch (480:10): [True: 71.3k, False: 610k] | | ------------------ | | 481| 610k| if ((buf)->alloc != new_alloc) {\ | | ------------------ | | | Branch (481:7): [True: 71.3k, False: 539k] | | ------------------ | | 482| 71.3k| UChar *tmp;\ | | ------------------ | | | | 76| 71.3k|# define UChar OnigUChar | | ------------------ | | 483| 71.3k| tmp = (UChar* )xrealloc((buf)->p, new_alloc);\ | | ------------------ | | | | 143| 71.3k|# define xrealloc realloc | | ------------------ | | 484| 71.3k| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | ------------------ | | | | 311| 71.3k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 71.3k] | | | | ------------------ | | ------------------ | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ | | 485| 71.3k| (buf)->p = tmp;\ | | 486| 71.3k| (buf)->alloc = new_alloc;\ | | 487| 71.3k| }\ | | 488| 610k|} while (0) | | ------------------ | | | Branch (488:10): [Folded - Ignored] | | ------------------ ------------------ 1747| 610k| BBUF_WRITE_CODE_POINT(bbuf, pos, from); ------------------ | | 1645| 610k| BBUF_WRITE(bbuf, pos, &(code), SIZE_CODE_POINT) | | ------------------ | | | | 490| 610k|#define BBUF_WRITE(buf,pos,bytes,n) do{\ | | | | 491| 610k| int used = (pos) + (int )(n);\ | | | | 492| 610k| if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ | | | | ------------------ | | | | | | 470| 0|#define BBUF_EXPAND(buf,low) do{\ | | | | | | 471| 0| UChar *tmp;\ | | | | | | ------------------ | | | | | | | | 76| 0|# define UChar OnigUChar | | | | | | ------------------ | | | | | | 472| 0| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | | | ------------------ | | | | | | | Branch (472:36): [True: 0, False: 0] | | | | | | ------------------ | | | | | | 473| 0| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | | | ------------------ | | | | | | | | 143| 0|# define xrealloc realloc | | | | | | ------------------ | | | | | | 474| 0| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | | | ------------------ | | | | | | | | | Branch (311:39): [True: 0, False: 0] | | | | | | | | ------------------ | | | | | | ------------------ | | | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 632| 0|#define ONIGERR_MEMORY -5 | | | | | | ------------------ | | | | | | 475| 0| (buf)->p = tmp;\ | | | | | | 476| 0|} while (0) | | | | | | ------------------ | | | | | | | Branch (476:10): [Folded - Ignored] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (492:7): [True: 0, False: 610k] | | | | ------------------ | | | | 493| 610k| xmemcpy((buf)->p + (pos), (bytes), (n));\ | | | | ------------------ | | | | | | 215| 610k|#define xmemcpy memcpy | | | | ------------------ | | | | 494| 610k| if ((buf)->used < (unsigned int )used) (buf)->used = used;\ | | | | ------------------ | | | | | Branch (494:7): [True: 610k, False: 0] | | | | ------------------ | | | | 495| 610k|} while (0) | | | | ------------------ | | | | | Branch (495:10): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 1748| 610k| BBUF_WRITE_CODE_POINT(bbuf, pos + SIZE_CODE_POINT, to); ------------------ | | 1645| 610k| BBUF_WRITE(bbuf, pos, &(code), SIZE_CODE_POINT) | | ------------------ | | | | 490| 610k|#define BBUF_WRITE(buf,pos,bytes,n) do{\ | | | | 491| 610k| int used = (pos) + (int )(n);\ | | | | 492| 610k| if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ | | | | ------------------ | | | | | | 470| 0|#define BBUF_EXPAND(buf,low) do{\ | | | | | | 471| 0| UChar *tmp;\ | | | | | | ------------------ | | | | | | | | 76| 0|# define UChar OnigUChar | | | | | | ------------------ | | | | | | 472| 0| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | | | ------------------ | | | | | | | Branch (472:36): [True: 0, False: 0] | | | | | | ------------------ | | | | | | 473| 0| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | | | ------------------ | | | | | | | | 143| 0|# define xrealloc realloc | | | | | | ------------------ | | | | | | 474| 0| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | | | ------------------ | | | | | | | | | Branch (311:39): [True: 0, False: 0] | | | | | | | | ------------------ | | | | | | ------------------ | | | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 632| 0|#define ONIGERR_MEMORY -5 | | | | | | ------------------ | | | | | | 475| 0| (buf)->p = tmp;\ | | | | | | 476| 0|} while (0) | | | | | | ------------------ | | | | | | | Branch (476:10): [Folded - Ignored] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (492:7): [True: 0, False: 610k] | | | | ------------------ | | | | 493| 610k| xmemcpy((buf)->p + (pos), (bytes), (n));\ | | | | ------------------ | | | | | | 215| 610k|#define xmemcpy memcpy | | | | ------------------ | | | | 494| 610k| if ((buf)->used < (unsigned int )used) (buf)->used = used;\ | | | | ------------------ | | | | | Branch (494:7): [True: 610k, False: 0] | | | | ------------------ | | | | 495| 610k|} while (0) | | | | ------------------ | | | | | Branch (495:10): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 1749| 610k| n += inc_n; 1750| 610k| BBUF_WRITE_CODE_POINT(bbuf, 0, n); ------------------ | | 1645| 610k| BBUF_WRITE(bbuf, pos, &(code), SIZE_CODE_POINT) | | ------------------ | | | | 490| 610k|#define BBUF_WRITE(buf,pos,bytes,n) do{\ | | | | 491| 610k| int used = (pos) + (int )(n);\ | | | | 492| 610k| if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ | | | | ------------------ | | | | | | 470| 0|#define BBUF_EXPAND(buf,low) do{\ | | | | | | 471| 0| UChar *tmp;\ | | | | | | ------------------ | | | | | | | | 76| 0|# define UChar OnigUChar | | | | | | ------------------ | | | | | | 472| 0| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | | | ------------------ | | | | | | | Branch (472:36): [True: 0, False: 0] | | | | | | ------------------ | | | | | | 473| 0| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | | | ------------------ | | | | | | | | 143| 0|# define xrealloc realloc | | | | | | ------------------ | | | | | | 474| 0| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | | | ------------------ | | | | | | | | | Branch (311:39): [True: 0, False: 0] | | | | | | | | ------------------ | | | | | | ------------------ | | | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 632| 0|#define ONIGERR_MEMORY -5 | | | | | | ------------------ | | | | | | 475| 0| (buf)->p = tmp;\ | | | | | | 476| 0|} while (0) | | | | | | ------------------ | | | | | | | Branch (476:10): [Folded - Ignored] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (492:7): [True: 0, False: 610k] | | | | ------------------ | | | | 493| 610k| xmemcpy((buf)->p + (pos), (bytes), (n));\ | | | | ------------------ | | | | | | 215| 610k|#define xmemcpy memcpy | | | | ------------------ | | | | 494| 610k| if ((buf)->used < (unsigned int )used) (buf)->used = used;\ | | | | ------------------ | | | | | Branch (494:7): [True: 0, False: 610k] | | | | ------------------ | | | | 495| 610k|} while (0) | | | | ------------------ | | | | | Branch (495:10): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 1751| | 1752| 610k| return 0; 1753| 610k|} regparse.c:new_code_range: 1653| 24.3k|{ 1654| 24.3k|#define INIT_MULTI_BYTE_RANGE_SIZE (SIZE_CODE_POINT * 5) 1655| 24.3k| int r; 1656| 24.3k| OnigCodePoint n; 1657| 24.3k| BBuf* bbuf; 1658| | 1659| 24.3k| bbuf = *pbuf = (BBuf* )xmalloc(sizeof(BBuf)); ------------------ | | 142| 24.3k|# define xmalloc malloc ------------------ 1660| 24.3k| CHECK_NULL_RETURN_MEMERR(*pbuf); ------------------ | | 314| 24.3k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 24.3k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 24.3k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 1661| 24.3k| r = BBUF_INIT(*pbuf, INIT_MULTI_BYTE_RANGE_SIZE); ------------------ | | 460| 24.3k|#define BBUF_INIT(buf,size) onig_bbuf_init((BBuf* )(buf), (size)) ------------------ 1662| 24.3k| if (r) return r; ------------------ | Branch (1662:7): [True: 0, False: 24.3k] ------------------ 1663| | 1664| 24.3k| n = 0; 1665| 24.3k| BBUF_WRITE_CODE_POINT(bbuf, 0, n); ------------------ | | 1645| 24.3k| BBUF_WRITE(bbuf, pos, &(code), SIZE_CODE_POINT) | | ------------------ | | | | 490| 24.3k|#define BBUF_WRITE(buf,pos,bytes,n) do{\ | | | | 491| 24.3k| int used = (pos) + (int )(n);\ | | | | 492| 24.3k| if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ | | | | ------------------ | | | | | | 470| 0|#define BBUF_EXPAND(buf,low) do{\ | | | | | | 471| 0| UChar *tmp;\ | | | | | | ------------------ | | | | | | | | 76| 0|# define UChar OnigUChar | | | | | | ------------------ | | | | | | 472| 0| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | | | ------------------ | | | | | | | Branch (472:36): [True: 0, False: 0] | | | | | | ------------------ | | | | | | 473| 0| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | | | ------------------ | | | | | | | | 143| 0|# define xrealloc realloc | | | | | | ------------------ | | | | | | 474| 0| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | | | ------------------ | | | | | | | | | Branch (311:39): [True: 0, False: 0] | | | | | | | | ------------------ | | | | | | ------------------ | | | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 632| 0|#define ONIGERR_MEMORY -5 | | | | | | ------------------ | | | | | | 475| 0| (buf)->p = tmp;\ | | | | | | 476| 0|} while (0) | | | | | | ------------------ | | | | | | | Branch (476:10): [Folded - Ignored] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (492:7): [True: 0, False: 24.3k] | | | | ------------------ | | | | 493| 24.3k| xmemcpy((buf)->p + (pos), (bytes), (n));\ | | | | ------------------ | | | | | | 215| 24.3k|#define xmemcpy memcpy | | | | ------------------ | | | | 494| 24.3k| if ((buf)->used < (unsigned int )used) (buf)->used = used;\ | | | | ------------------ | | | | | Branch (494:7): [True: 24.3k, False: 0] | | | | ------------------ | | | | 495| 24.3k|} while (0) | | | | ------------------ | | | | | Branch (495:10): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 1666| 24.3k| return 0; 1667| 24.3k|} regparse.c:bitset_set_range: 193| 24.3k|{ 194| 24.3k| int i; 195| 3.13M| for (i = from; i <= to && i < SINGLE_BYTE_SIZE; i++) { ------------------ | | 426| 3.11M|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 425| 3.11M|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (195:18): [True: 3.11M, False: 24.3k] | Branch (195:29): [True: 3.11M, False: 0] ------------------ 196| 3.11M| BITSET_SET_BIT_CHKDUP(bs, i); ------------------ | | 176| 3.11M|#define BITSET_SET_BIT_CHKDUP(bs, pos) do { \ | | 177| 3.11M| if (BITSET_AT(bs, pos)) CC_DUP_WARN(env, pos, pos); \ | | ------------------ | | | | 448| 3.11M|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 445| 3.11M|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 427| 3.11M|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 3.11M|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 446| 3.11M|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 427| 3.11M|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 3.11M|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (448:36): [True: 0, False: 3.11M] | | | | ------------------ | | ------------------ | | 178| 3.11M| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 445| 3.11M|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 3.11M|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 3.11M|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 446| 3.11M|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 3.11M|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 3.11M|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | 179| 3.11M|} while (0) | | ------------------ | | | Branch (179:10): [Folded - Ignored] | | ------------------ ------------------ 197| 3.11M| } 198| 24.3k|} regparse.c:add_code_range_to_buf: 1757| 610k|{ 1758| 610k| return add_code_range_to_buf0(pbuf, env, from, to, 1); 1759| 610k|} regparse.c:node_new_cclass: 1141| 45.6k|{ 1142| 45.6k| Node* node = node_new(); 1143| 45.6k| CHECK_NULL_RETURN(node); ------------------ | | 313| 45.6k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 311| 45.6k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 45.6k] | | | | ------------------ | | ------------------ ------------------ 1144| | 1145| 45.6k| SET_NTYPE(node, NT_CCLASS); ------------------ | | 71| 45.6k| do { \ | | 72| 45.6k| int value = ntype; \ | | 73| 45.6k| memcpy(&((node)->u.base.type), &value, sizeof(int)); \ | | 74| 45.6k| } while (0) | | ------------------ | | | Branch (74:14): [Folded - Ignored] | | ------------------ ------------------ 1146| 45.6k| initialize_cclass(NCCLASS(node)); ------------------ | | 77| 45.6k|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 1147| 45.6k| return node; 1148| 45.6k|} regparse.c:initialize_cclass: 1132| 94.3k|{ 1133| 94.3k| BITSET_CLEAR(cc->bs); ------------------ | | 440| 94.3k|#define BITSET_CLEAR(bs) do {\ | | 441| 94.3k| int i;\ | | 442| 849k| for (i = 0; i < BITSET_SIZE; i++) { (bs)[i] = 0; } \ | | ------------------ | | | | 428| 849k|#define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM) | | | | ------------------ | | | | | | 426| 849k|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 849k|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM) | | | | ------------------ | | | | | | 427| 849k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 849k|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (442:15): [True: 754k, False: 94.3k] | | ------------------ | | 443| 94.3k|} while (0) | | ------------------ | | | Branch (443:10): [Folded - Ignored] | | ------------------ ------------------ 1134| | /* cc->base.flags = 0; */ 1135| 94.3k| cc->flags = 0; 1136| 94.3k| cc->mbuf = NULL; 1137| 94.3k|} regparse.c:add_ctype_to_cc: 4138| 24.3k|{ 4139| 24.3k| int maxcode; 4140| 24.3k| int c, r; 4141| 24.3k| const OnigCodePoint *ranges; 4142| 24.3k| OnigCodePoint sb_out; 4143| 24.3k| OnigEncoding enc = env->enc; 4144| | 4145| 24.3k| r = ONIGENC_GET_CTYPE_CODE_RANGE(enc, ctype, &sb_out, &ranges); ------------------ | | 407| 24.3k| (enc)->get_ctype_code_range(ctype,sbout,ranges,enc) ------------------ 4146| 24.3k| if (r == 0) { ------------------ | Branch (4146:7): [True: 24.3k, False: 0] ------------------ 4147| 24.3k| if (ascii_range) { ------------------ | Branch (4147:9): [True: 24.3k, False: 0] ------------------ 4148| 24.3k| CClassNode ccwork; 4149| 24.3k| initialize_cclass(&ccwork); 4150| 24.3k| r = add_ctype_to_cc_by_range(&ccwork, ctype, not, env, sb_out, 4151| 24.3k| ranges); 4152| 24.3k| if (r == 0) { ------------------ | Branch (4152:11): [True: 24.3k, False: 0] ------------------ 4153| 24.3k| if (not) { ------------------ | Branch (4153:6): [True: 0, False: 24.3k] ------------------ 4154| 0| r = add_code_range_to_buf0(&(ccwork.mbuf), env, 0x80, ONIG_LAST_CODE_POINT, FALSE); ------------------ | | 317| 0|#define ONIG_LAST_CODE_POINT (~((OnigCodePoint )0)) ------------------ r = add_code_range_to_buf0(&(ccwork.mbuf), env, 0x80, ONIG_LAST_CODE_POINT, FALSE); ------------------ | | 77| 0|# define FALSE 0 ------------------ 4155| 0| } 4156| 24.3k| else { 4157| 24.3k| CClassNode ccascii; 4158| 24.3k| initialize_cclass(&ccascii); 4159| 24.3k| if (ONIGENC_MBC_MINLEN(env->enc) > 1) { ------------------ | | 367| 24.3k|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) ------------------ | Branch (4159:8): [True: 0, False: 24.3k] ------------------ 4160| 0| r = add_code_range(&(ccascii.mbuf), env, 0x00, 0x7F); 4161| 0| } 4162| 24.3k| else { 4163| 24.3k| bitset_set_range(env, ccascii.bs, 0x00, 0x7F); 4164| 24.3k| r = 0; 4165| 24.3k| } 4166| 24.3k| if (r == 0) { ------------------ | Branch (4166:8): [True: 24.3k, False: 0] ------------------ 4167| 24.3k| r = and_cclass(&ccwork, &ccascii, env); 4168| 24.3k| } 4169| 24.3k| if (IS_NOT_NULL(ccascii.mbuf)) bbuf_free(ccascii.mbuf); ------------------ | | 312| 24.3k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 24.3k] | | ------------------ ------------------ 4170| 24.3k| } 4171| 24.3k| if (r == 0) { ------------------ | Branch (4171:6): [True: 24.3k, False: 0] ------------------ 4172| 24.3k| r = or_cclass(cc, &ccwork, env); 4173| 24.3k| } 4174| 24.3k| if (IS_NOT_NULL(ccwork.mbuf)) bbuf_free(ccwork.mbuf); ------------------ | | 312| 24.3k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 24.3k] | | ------------------ ------------------ 4175| 24.3k| } 4176| 24.3k| } 4177| 0| else { 4178| 0| r = add_ctype_to_cc_by_range(cc, ctype, not, env, sb_out, ranges); 4179| 0| } 4180| 24.3k| return r; 4181| 24.3k| } 4182| 0| else if (r != ONIG_NO_SUPPORT_CONFIG) { ------------------ | | 629| 0|#define ONIG_NO_SUPPORT_CONFIG -2 ------------------ | Branch (4182:12): [True: 0, False: 0] ------------------ 4183| 0| return r; 4184| 0| } 4185| | 4186| 0| maxcode = ascii_range ? 0x80 : SINGLE_BYTE_SIZE; ------------------ | | 426| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 425| 0|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (4186:13): [True: 0, False: 0] ------------------ 4187| 0| r = 0; 4188| 0| switch (ctype) { 4189| 0| case ONIGENC_CTYPE_ALPHA: ------------------ | | 295| 0|#define ONIGENC_CTYPE_ALPHA 1 ------------------ | Branch (4189:3): [True: 0, False: 0] ------------------ 4190| 0| case ONIGENC_CTYPE_BLANK: ------------------ | | 296| 0|#define ONIGENC_CTYPE_BLANK 2 ------------------ | Branch (4190:3): [True: 0, False: 0] ------------------ 4191| 0| case ONIGENC_CTYPE_CNTRL: ------------------ | | 297| 0|#define ONIGENC_CTYPE_CNTRL 3 ------------------ | Branch (4191:3): [True: 0, False: 0] ------------------ 4192| 0| case ONIGENC_CTYPE_DIGIT: ------------------ | | 298| 0|#define ONIGENC_CTYPE_DIGIT 4 ------------------ | Branch (4192:3): [True: 0, False: 0] ------------------ 4193| 0| case ONIGENC_CTYPE_LOWER: ------------------ | | 300| 0|#define ONIGENC_CTYPE_LOWER 6 ------------------ | Branch (4193:3): [True: 0, False: 0] ------------------ 4194| 0| case ONIGENC_CTYPE_PUNCT: ------------------ | | 302| 0|#define ONIGENC_CTYPE_PUNCT 8 ------------------ | Branch (4194:3): [True: 0, False: 0] ------------------ 4195| 0| case ONIGENC_CTYPE_SPACE: ------------------ | | 303| 0|#define ONIGENC_CTYPE_SPACE 9 ------------------ | Branch (4195:3): [True: 0, False: 0] ------------------ 4196| 0| case ONIGENC_CTYPE_UPPER: ------------------ | | 304| 0|#define ONIGENC_CTYPE_UPPER 10 ------------------ | Branch (4196:3): [True: 0, False: 0] ------------------ 4197| 0| case ONIGENC_CTYPE_XDIGIT: ------------------ | | 305| 0|#define ONIGENC_CTYPE_XDIGIT 11 ------------------ | Branch (4197:3): [True: 0, False: 0] ------------------ 4198| 0| case ONIGENC_CTYPE_ASCII: ------------------ | | 308| 0|#define ONIGENC_CTYPE_ASCII 14 ------------------ | Branch (4198:3): [True: 0, False: 0] ------------------ 4199| 0| case ONIGENC_CTYPE_ALNUM: ------------------ | | 307| 0|#define ONIGENC_CTYPE_ALNUM 13 /* alpha || digit */ ------------------ | Branch (4199:3): [True: 0, False: 0] ------------------ 4200| 0| if (not != 0) { ------------------ | Branch (4200:9): [True: 0, False: 0] ------------------ 4201| 0| for (c = 0; c < SINGLE_BYTE_SIZE; c++) { ------------------ | | 426| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 425| 0|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (4201:19): [True: 0, False: 0] ------------------ 4202| 0| if (! ONIGENC_IS_CODE_CTYPE(enc, (OnigCodePoint )c, ctype)) ------------------ | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) ------------------ | Branch (4202:6): [True: 0, False: 0] ------------------ 4203| 0| BITSET_SET_BIT_CHKDUP(cc->bs, c); ------------------ | | 176| 0|#define BITSET_SET_BIT_CHKDUP(bs, pos) do { \ | | 177| 0| if (BITSET_AT(bs, pos)) CC_DUP_WARN(env, pos, pos); \ | | ------------------ | | | | 448| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (448:36): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 178| 0| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | 179| 0|} while (0) | | ------------------ | | | Branch (179:10): [Folded - Ignored] | | ------------------ ------------------ 4204| 0| } 4205| 0| ADD_ALL_MULTI_BYTE_RANGE(enc, cc->mbuf); ------------------ | | 168| 0|#define ADD_ALL_MULTI_BYTE_RANGE(enc, mbuf) do {\ | | 169| 0| if (! ONIGENC_IS_SINGLEBYTE(enc)) {\ | | ------------------ | | | | 318| 0|#define ONIGENC_IS_SINGLEBYTE(enc) (ONIGENC_MBC_MAXLEN(enc) == 1) | | | | ------------------ | | | | | | 365| 0|#define ONIGENC_MBC_MAXLEN(enc) ((enc)->max_enc_len) | | | | ------------------ | | ------------------ | | | Branch (169:7): [True: 0, False: 0] | | ------------------ | | 170| 0| r = SET_ALL_MULTI_BYTE_RANGE(enc, &(mbuf));\ | | ------------------ | | | | 166| 0| add_code_range_to_buf(pbuf, env, MBCODE_START_POS(enc), ONIG_LAST_CODE_POINT) | | | | ------------------ | | | | | | 163| 0| (OnigCodePoint )(ONIGENC_MBC_MINLEN(enc) > 1 ? 0 : 0x80) | | | | | | ------------------ | | | | | | | | 367| 0|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) | | | | | | ------------------ | | | | | | | Branch (163:20): [True: 0, False: 0] | | | | | | ------------------ | | | | ------------------ | | | | add_code_range_to_buf(pbuf, env, MBCODE_START_POS(enc), ONIG_LAST_CODE_POINT) | | | | ------------------ | | | | | | 317| 0|#define ONIG_LAST_CODE_POINT (~((OnigCodePoint )0)) | | | | ------------------ | | ------------------ | | 171| 0| if (r) return r;\ | | ------------------ | | | Branch (171:9): [True: 0, False: 0] | | ------------------ | | 172| 0| }\ | | 173| 0|} while (0) | | ------------------ | | | Branch (173:10): [Folded - Ignored] | | ------------------ ------------------ 4206| 0| } 4207| 0| else { 4208| 0| for (c = 0; c < SINGLE_BYTE_SIZE; c++) { ------------------ | | 426| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 425| 0|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (4208:19): [True: 0, False: 0] ------------------ 4209| 0| if (ONIGENC_IS_CODE_CTYPE(enc, (OnigCodePoint )c, ctype)) ------------------ | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | ------------------ | | | Branch (375:48): [True: 0, False: 0] | | ------------------ ------------------ 4210| 0| BITSET_SET_BIT_CHKDUP(cc->bs, c); ------------------ | | 176| 0|#define BITSET_SET_BIT_CHKDUP(bs, pos) do { \ | | 177| 0| if (BITSET_AT(bs, pos)) CC_DUP_WARN(env, pos, pos); \ | | ------------------ | | | | 448| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (448:36): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 178| 0| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | 179| 0|} while (0) | | ------------------ | | | Branch (179:10): [Folded - Ignored] | | ------------------ ------------------ 4211| 0| } 4212| 0| } 4213| 0| break; 4214| | 4215| 0| case ONIGENC_CTYPE_GRAPH: ------------------ | | 299| 0|#define ONIGENC_CTYPE_GRAPH 5 ------------------ | Branch (4215:3): [True: 0, False: 0] ------------------ 4216| 0| case ONIGENC_CTYPE_PRINT: ------------------ | | 301| 0|#define ONIGENC_CTYPE_PRINT 7 ------------------ | Branch (4216:3): [True: 0, False: 0] ------------------ 4217| 0| if (not != 0) { ------------------ | Branch (4217:9): [True: 0, False: 0] ------------------ 4218| 0| for (c = 0; c < SINGLE_BYTE_SIZE; c++) { ------------------ | | 426| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 425| 0|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (4218:19): [True: 0, False: 0] ------------------ 4219| 0| if (! ONIGENC_IS_CODE_CTYPE(enc, (OnigCodePoint )c, ctype) ------------------ | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) ------------------ | Branch (4219:6): [True: 0, False: 0] ------------------ 4220| 0| || c >= maxcode) ------------------ | Branch (4220:9): [True: 0, False: 0] ------------------ 4221| 0| BITSET_SET_BIT_CHKDUP(cc->bs, c); ------------------ | | 176| 0|#define BITSET_SET_BIT_CHKDUP(bs, pos) do { \ | | 177| 0| if (BITSET_AT(bs, pos)) CC_DUP_WARN(env, pos, pos); \ | | ------------------ | | | | 448| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (448:36): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 178| 0| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | 179| 0|} while (0) | | ------------------ | | | Branch (179:10): [Folded - Ignored] | | ------------------ ------------------ 4222| 0| } 4223| 0| if (ascii_range) ------------------ | Branch (4223:11): [True: 0, False: 0] ------------------ 4224| 0| ADD_ALL_MULTI_BYTE_RANGE(enc, cc->mbuf); ------------------ | | 168| 0|#define ADD_ALL_MULTI_BYTE_RANGE(enc, mbuf) do {\ | | 169| 0| if (! ONIGENC_IS_SINGLEBYTE(enc)) {\ | | ------------------ | | | | 318| 0|#define ONIGENC_IS_SINGLEBYTE(enc) (ONIGENC_MBC_MAXLEN(enc) == 1) | | | | ------------------ | | | | | | 365| 0|#define ONIGENC_MBC_MAXLEN(enc) ((enc)->max_enc_len) | | | | ------------------ | | ------------------ | | | Branch (169:7): [True: 0, False: 0] | | ------------------ | | 170| 0| r = SET_ALL_MULTI_BYTE_RANGE(enc, &(mbuf));\ | | ------------------ | | | | 166| 0| add_code_range_to_buf(pbuf, env, MBCODE_START_POS(enc), ONIG_LAST_CODE_POINT) | | | | ------------------ | | | | | | 163| 0| (OnigCodePoint )(ONIGENC_MBC_MINLEN(enc) > 1 ? 0 : 0x80) | | | | | | ------------------ | | | | | | | | 367| 0|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) | | | | | | ------------------ | | | | | | | Branch (163:20): [True: 0, False: 0] | | | | | | ------------------ | | | | ------------------ | | | | add_code_range_to_buf(pbuf, env, MBCODE_START_POS(enc), ONIG_LAST_CODE_POINT) | | | | ------------------ | | | | | | 317| 0|#define ONIG_LAST_CODE_POINT (~((OnigCodePoint )0)) | | | | ------------------ | | ------------------ | | 171| 0| if (r) return r;\ | | ------------------ | | | Branch (171:9): [True: 0, False: 0] | | ------------------ | | 172| 0| }\ | | 173| 0|} while (0) | | ------------------ | | | Branch (173:10): [Folded - Ignored] | | ------------------ ------------------ 4225| 0| } 4226| 0| else { 4227| 0| for (c = 0; c < maxcode; c++) { ------------------ | Branch (4227:19): [True: 0, False: 0] ------------------ 4228| 0| if (ONIGENC_IS_CODE_CTYPE(enc, (OnigCodePoint )c, ctype)) ------------------ | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | ------------------ | | | Branch (375:48): [True: 0, False: 0] | | ------------------ ------------------ 4229| 0| BITSET_SET_BIT_CHKDUP(cc->bs, c); ------------------ | | 176| 0|#define BITSET_SET_BIT_CHKDUP(bs, pos) do { \ | | 177| 0| if (BITSET_AT(bs, pos)) CC_DUP_WARN(env, pos, pos); \ | | ------------------ | | | | 448| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (448:36): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 178| 0| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | 179| 0|} while (0) | | ------------------ | | | Branch (179:10): [Folded - Ignored] | | ------------------ ------------------ 4230| 0| } 4231| 0| if (! ascii_range) ------------------ | Branch (4231:11): [True: 0, False: 0] ------------------ 4232| 0| ADD_ALL_MULTI_BYTE_RANGE(enc, cc->mbuf); ------------------ | | 168| 0|#define ADD_ALL_MULTI_BYTE_RANGE(enc, mbuf) do {\ | | 169| 0| if (! ONIGENC_IS_SINGLEBYTE(enc)) {\ | | ------------------ | | | | 318| 0|#define ONIGENC_IS_SINGLEBYTE(enc) (ONIGENC_MBC_MAXLEN(enc) == 1) | | | | ------------------ | | | | | | 365| 0|#define ONIGENC_MBC_MAXLEN(enc) ((enc)->max_enc_len) | | | | ------------------ | | ------------------ | | | Branch (169:7): [True: 0, False: 0] | | ------------------ | | 170| 0| r = SET_ALL_MULTI_BYTE_RANGE(enc, &(mbuf));\ | | ------------------ | | | | 166| 0| add_code_range_to_buf(pbuf, env, MBCODE_START_POS(enc), ONIG_LAST_CODE_POINT) | | | | ------------------ | | | | | | 163| 0| (OnigCodePoint )(ONIGENC_MBC_MINLEN(enc) > 1 ? 0 : 0x80) | | | | | | ------------------ | | | | | | | | 367| 0|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) | | | | | | ------------------ | | | | | | | Branch (163:20): [True: 0, False: 0] | | | | | | ------------------ | | | | ------------------ | | | | add_code_range_to_buf(pbuf, env, MBCODE_START_POS(enc), ONIG_LAST_CODE_POINT) | | | | ------------------ | | | | | | 317| 0|#define ONIG_LAST_CODE_POINT (~((OnigCodePoint )0)) | | | | ------------------ | | ------------------ | | 171| 0| if (r) return r;\ | | ------------------ | | | Branch (171:9): [True: 0, False: 0] | | ------------------ | | 172| 0| }\ | | 173| 0|} while (0) | | ------------------ | | | Branch (173:10): [Folded - Ignored] | | ------------------ ------------------ 4233| 0| } 4234| 0| break; 4235| | 4236| 0| case ONIGENC_CTYPE_WORD: ------------------ | | 306| 0|#define ONIGENC_CTYPE_WORD 12 ------------------ | Branch (4236:3): [True: 0, False: 0] ------------------ 4237| 0| if (not == 0) { ------------------ | Branch (4237:9): [True: 0, False: 0] ------------------ 4238| 0| for (c = 0; c < maxcode; c++) { ------------------ | Branch (4238:19): [True: 0, False: 0] ------------------ 4239| 0| if (ONIGENC_IS_CODE_WORD(enc, c)) BITSET_SET_BIT_CHKDUP(cc->bs, c); ------------------ | | 404| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | ------------------ | | | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (375:48): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ if (ONIGENC_IS_CODE_WORD(enc, c)) BITSET_SET_BIT_CHKDUP(cc->bs, c); ------------------ | | 176| 0|#define BITSET_SET_BIT_CHKDUP(bs, pos) do { \ | | 177| 0| if (BITSET_AT(bs, pos)) CC_DUP_WARN(env, pos, pos); \ | | ------------------ | | | | 448| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (448:36): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 178| 0| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | 179| 0|} while (0) | | ------------------ | | | Branch (179:10): [Folded - Ignored] | | ------------------ ------------------ 4240| 0| } 4241| 0| if (! ascii_range) ------------------ | Branch (4241:11): [True: 0, False: 0] ------------------ 4242| 0| ADD_ALL_MULTI_BYTE_RANGE(enc, cc->mbuf); ------------------ | | 168| 0|#define ADD_ALL_MULTI_BYTE_RANGE(enc, mbuf) do {\ | | 169| 0| if (! ONIGENC_IS_SINGLEBYTE(enc)) {\ | | ------------------ | | | | 318| 0|#define ONIGENC_IS_SINGLEBYTE(enc) (ONIGENC_MBC_MAXLEN(enc) == 1) | | | | ------------------ | | | | | | 365| 0|#define ONIGENC_MBC_MAXLEN(enc) ((enc)->max_enc_len) | | | | ------------------ | | ------------------ | | | Branch (169:7): [True: 0, False: 0] | | ------------------ | | 170| 0| r = SET_ALL_MULTI_BYTE_RANGE(enc, &(mbuf));\ | | ------------------ | | | | 166| 0| add_code_range_to_buf(pbuf, env, MBCODE_START_POS(enc), ONIG_LAST_CODE_POINT) | | | | ------------------ | | | | | | 163| 0| (OnigCodePoint )(ONIGENC_MBC_MINLEN(enc) > 1 ? 0 : 0x80) | | | | | | ------------------ | | | | | | | | 367| 0|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) | | | | | | ------------------ | | | | | | | Branch (163:20): [True: 0, False: 0] | | | | | | ------------------ | | | | ------------------ | | | | add_code_range_to_buf(pbuf, env, MBCODE_START_POS(enc), ONIG_LAST_CODE_POINT) | | | | ------------------ | | | | | | 317| 0|#define ONIG_LAST_CODE_POINT (~((OnigCodePoint )0)) | | | | ------------------ | | ------------------ | | 171| 0| if (r) return r;\ | | ------------------ | | | Branch (171:9): [True: 0, False: 0] | | ------------------ | | 172| 0| }\ | | 173| 0|} while (0) | | ------------------ | | | Branch (173:10): [Folded - Ignored] | | ------------------ ------------------ 4243| 0| } 4244| 0| else { 4245| 0| for (c = 0; c < SINGLE_BYTE_SIZE; c++) { ------------------ | | 426| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 425| 0|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (4245:19): [True: 0, False: 0] ------------------ 4246| 0| if ((ONIGENC_CODE_TO_MBCLEN(enc, c) > 0) /* check invalid code point */ ------------------ | | 370| 0|#define ONIGENC_CODE_TO_MBCLEN(enc,code) (enc)->code_to_mbclen(code,enc) ------------------ | Branch (4246:6): [True: 0, False: 0] ------------------ 4247| 0| && (! ONIGENC_IS_CODE_WORD(enc, c) || c >= maxcode)) ------------------ | | 404| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | ------------------ | | | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | ------------------ ------------------ | Branch (4247:10): [True: 0, False: 0] | Branch (4247:44): [True: 0, False: 0] ------------------ 4248| 0| BITSET_SET_BIT_CHKDUP(cc->bs, c); ------------------ | | 176| 0|#define BITSET_SET_BIT_CHKDUP(bs, pos) do { \ | | 177| 0| if (BITSET_AT(bs, pos)) CC_DUP_WARN(env, pos, pos); \ | | ------------------ | | | | 448| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (448:36): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 178| 0| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | 179| 0|} while (0) | | ------------------ | | | Branch (179:10): [Folded - Ignored] | | ------------------ ------------------ 4249| 0| } 4250| 0| if (ascii_range) ------------------ | Branch (4250:11): [True: 0, False: 0] ------------------ 4251| 0| ADD_ALL_MULTI_BYTE_RANGE(enc, cc->mbuf); ------------------ | | 168| 0|#define ADD_ALL_MULTI_BYTE_RANGE(enc, mbuf) do {\ | | 169| 0| if (! ONIGENC_IS_SINGLEBYTE(enc)) {\ | | ------------------ | | | | 318| 0|#define ONIGENC_IS_SINGLEBYTE(enc) (ONIGENC_MBC_MAXLEN(enc) == 1) | | | | ------------------ | | | | | | 365| 0|#define ONIGENC_MBC_MAXLEN(enc) ((enc)->max_enc_len) | | | | ------------------ | | ------------------ | | | Branch (169:7): [True: 0, False: 0] | | ------------------ | | 170| 0| r = SET_ALL_MULTI_BYTE_RANGE(enc, &(mbuf));\ | | ------------------ | | | | 166| 0| add_code_range_to_buf(pbuf, env, MBCODE_START_POS(enc), ONIG_LAST_CODE_POINT) | | | | ------------------ | | | | | | 163| 0| (OnigCodePoint )(ONIGENC_MBC_MINLEN(enc) > 1 ? 0 : 0x80) | | | | | | ------------------ | | | | | | | | 367| 0|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) | | | | | | ------------------ | | | | | | | Branch (163:20): [True: 0, False: 0] | | | | | | ------------------ | | | | ------------------ | | | | add_code_range_to_buf(pbuf, env, MBCODE_START_POS(enc), ONIG_LAST_CODE_POINT) | | | | ------------------ | | | | | | 317| 0|#define ONIG_LAST_CODE_POINT (~((OnigCodePoint )0)) | | | | ------------------ | | ------------------ | | 171| 0| if (r) return r;\ | | ------------------ | | | Branch (171:9): [True: 0, False: 0] | | ------------------ | | 172| 0| }\ | | 173| 0|} while (0) | | ------------------ | | | Branch (173:10): [Folded - Ignored] | | ------------------ ------------------ 4252| 0| } 4253| 0| break; 4254| | 4255| 0| default: ------------------ | Branch (4255:3): [True: 0, False: 0] ------------------ 4256| 0| return ONIGERR_PARSER_BUG; ------------------ | | 634| 0|#define ONIGERR_PARSER_BUG -11 ------------------ 4257| 0| break; 4258| 0| } 4259| | 4260| 0| return r; 4261| 0|} regparse.c:add_ctype_to_cc_by_range: 4067| 24.3k|{ 4068| 24.3k| int i, r; 4069| 24.3k| OnigCodePoint j; 4070| | 4071| 24.3k| int n = ONIGENC_CODE_RANGE_NUM(mbr); ------------------ | | 139| 24.3k|#define ONIGENC_CODE_RANGE_NUM(range) ((int )range[0]) ------------------ 4072| | 4073| 24.3k| if (not == 0) { ------------------ | Branch (4073:7): [True: 24.3k, False: 0] ------------------ 4074| 65.4k| for (i = 0; i < n; i++) { ------------------ | Branch (4074:17): [True: 65.4k, False: 0] ------------------ 4075| 65.4k| for (j = ONIGENC_CODE_RANGE_FROM(mbr, i); ------------------ | | 140| 65.4k|#define ONIGENC_CODE_RANGE_FROM(range,i) range[((i)*2) + 1] ------------------ 4076| 241k| j <= ONIGENC_CODE_RANGE_TO(mbr, i); j++) { ------------------ | | 141| 241k|#define ONIGENC_CODE_RANGE_TO(range,i) range[((i)*2) + 2] ------------------ | Branch (4076:4): [True: 200k, False: 41.1k] ------------------ 4077| 200k| if (j >= sb_out) { ------------------ | Branch (4077:6): [True: 24.3k, False: 176k] ------------------ 4078| 24.3k| if (j > ONIGENC_CODE_RANGE_FROM(mbr, i)) { ------------------ | | 140| 24.3k|#define ONIGENC_CODE_RANGE_FROM(range,i) range[((i)*2) + 1] ------------------ | Branch (4078:8): [True: 0, False: 24.3k] ------------------ 4079| 0| r = add_code_range_to_buf(&(cc->mbuf), env, j, 4080| 0| ONIGENC_CODE_RANGE_TO(mbr, i)); ------------------ | | 141| 0|#define ONIGENC_CODE_RANGE_TO(range,i) range[((i)*2) + 2] ------------------ 4081| 0| if (r != 0) return r; ------------------ | Branch (4081:10): [True: 0, False: 0] ------------------ 4082| 0| i++; 4083| 0| } 4084| | 4085| 24.3k| goto sb_end; 4086| 24.3k| } 4087| 176k| BITSET_SET_BIT_CHKDUP(cc->bs, j); ------------------ | | 176| 176k|#define BITSET_SET_BIT_CHKDUP(bs, pos) do { \ | | 177| 176k| if (BITSET_AT(bs, pos)) CC_DUP_WARN(env, pos, pos); \ | | ------------------ | | | | 448| 176k|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 445| 176k|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 427| 176k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 176k|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 446| 176k|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 427| 176k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 176k|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (448:36): [True: 0, False: 176k] | | | | ------------------ | | ------------------ | | 178| 176k| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 445| 176k|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 176k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 176k|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 446| 176k|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 176k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 176k|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | 179| 176k|} while (0) | | ------------------ | | | Branch (179:10): [Folded - Ignored] | | ------------------ ------------------ 4088| 176k| } 4089| 65.4k| } 4090| | 4091| 24.3k| sb_end: 4092| 635k| for ( ; i < n; i++) { ------------------ | Branch (4092:13): [True: 610k, False: 24.3k] ------------------ 4093| 610k| r = add_code_range_to_buf(&(cc->mbuf), env, 4094| 610k| ONIGENC_CODE_RANGE_FROM(mbr, i), ------------------ | | 140| 610k|#define ONIGENC_CODE_RANGE_FROM(range,i) range[((i)*2) + 1] ------------------ 4095| 610k| ONIGENC_CODE_RANGE_TO(mbr, i)); ------------------ | | 141| 610k|#define ONIGENC_CODE_RANGE_TO(range,i) range[((i)*2) + 2] ------------------ 4096| 610k| if (r != 0) return r; ------------------ | Branch (4096:11): [True: 0, False: 610k] ------------------ 4097| 610k| } 4098| 24.3k| } 4099| 0| else { 4100| 0| OnigCodePoint prev = 0; 4101| | 4102| 0| for (i = 0; i < n; i++) { ------------------ | Branch (4102:17): [True: 0, False: 0] ------------------ 4103| 0| for (j = prev; 4104| 0| j < ONIGENC_CODE_RANGE_FROM(mbr, i); j++) { ------------------ | | 140| 0|#define ONIGENC_CODE_RANGE_FROM(range,i) range[((i)*2) + 1] ------------------ | Branch (4104:5): [True: 0, False: 0] ------------------ 4105| 0| if (j >= sb_out) { ------------------ | Branch (4105:6): [True: 0, False: 0] ------------------ 4106| 0| goto sb_end2; 4107| 0| } 4108| 0| BITSET_SET_BIT_CHKDUP(cc->bs, j); ------------------ | | 176| 0|#define BITSET_SET_BIT_CHKDUP(bs, pos) do { \ | | 177| 0| if (BITSET_AT(bs, pos)) CC_DUP_WARN(env, pos, pos); \ | | ------------------ | | | | 448| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (448:36): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 178| 0| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | 179| 0|} while (0) | | ------------------ | | | Branch (179:10): [Folded - Ignored] | | ------------------ ------------------ 4109| 0| } 4110| 0| prev = ONIGENC_CODE_RANGE_TO(mbr, i) + 1; ------------------ | | 141| 0|#define ONIGENC_CODE_RANGE_TO(range,i) range[((i)*2) + 2] ------------------ 4111| 0| } 4112| 0| for (j = prev; j < sb_out; j++) { ------------------ | Branch (4112:20): [True: 0, False: 0] ------------------ 4113| 0| BITSET_SET_BIT_CHKDUP(cc->bs, j); ------------------ | | 176| 0|#define BITSET_SET_BIT_CHKDUP(bs, pos) do { \ | | 177| 0| if (BITSET_AT(bs, pos)) CC_DUP_WARN(env, pos, pos); \ | | ------------------ | | | | 448| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (448:36): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 178| 0| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | 179| 0|} while (0) | | ------------------ | | | Branch (179:10): [Folded - Ignored] | | ------------------ ------------------ 4114| 0| } 4115| | 4116| 0| sb_end2: 4117| 0| prev = sb_out; 4118| | 4119| 0| for (i = 0; i < n; i++) { ------------------ | Branch (4119:17): [True: 0, False: 0] ------------------ 4120| 0| if (prev < ONIGENC_CODE_RANGE_FROM(mbr, i)) { ------------------ | | 140| 0|#define ONIGENC_CODE_RANGE_FROM(range,i) range[((i)*2) + 1] ------------------ | Branch (4120:11): [True: 0, False: 0] ------------------ 4121| 0| r = add_code_range_to_buf(&(cc->mbuf), env, prev, 4122| 0| ONIGENC_CODE_RANGE_FROM(mbr, i) - 1); ------------------ | | 140| 0|#define ONIGENC_CODE_RANGE_FROM(range,i) range[((i)*2) + 1] ------------------ 4123| 0| if (r != 0) return r; ------------------ | Branch (4123:6): [True: 0, False: 0] ------------------ 4124| 0| } 4125| 0| prev = ONIGENC_CODE_RANGE_TO(mbr, i) + 1; ------------------ | | 141| 0|#define ONIGENC_CODE_RANGE_TO(range,i) range[((i)*2) + 2] ------------------ 4126| 0| } 4127| 0| if (prev < 0x7fffffff) { ------------------ | Branch (4127:9): [True: 0, False: 0] ------------------ 4128| 0| r = add_code_range_to_buf(&(cc->mbuf), env, prev, 0x7fffffff); 4129| 0| if (r != 0) return r; ------------------ | Branch (4129:11): [True: 0, False: 0] ------------------ 4130| 0| } 4131| 0| } 4132| | 4133| 24.3k| return 0; 4134| 24.3k|} regparse.c:and_cclass: 1978| 24.3k|{ 1979| 24.3k| OnigEncoding enc = env->enc; 1980| 24.3k| int r, not1, not2; 1981| 24.3k| BBuf *buf1, *buf2, *pbuf = 0; 1982| 24.3k| BitSetRef bsr1, bsr2; 1983| 24.3k| BitSet bs1, bs2; 1984| | 1985| 24.3k| not1 = IS_NCCLASS_NOT(dest); ------------------ | | 809| 24.3k|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 802| 24.3k|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 799| 24.3k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ 1986| 24.3k| bsr1 = dest->bs; 1987| 24.3k| buf1 = dest->mbuf; 1988| 24.3k| not2 = IS_NCCLASS_NOT(cc); ------------------ | | 809| 24.3k|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 802| 24.3k|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 799| 24.3k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ 1989| 24.3k| bsr2 = cc->bs; 1990| 24.3k| buf2 = cc->mbuf; 1991| | 1992| 24.3k| if (not1 != 0) { ------------------ | Branch (1992:7): [True: 0, False: 24.3k] ------------------ 1993| 0| bitset_invert_to(bsr1, bs1); 1994| 0| bsr1 = bs1; 1995| 0| } 1996| 24.3k| if (not2 != 0) { ------------------ | Branch (1996:7): [True: 0, False: 24.3k] ------------------ 1997| 0| bitset_invert_to(bsr2, bs2); 1998| 0| bsr2 = bs2; 1999| 0| } 2000| 24.3k| bitset_and(bsr1, bsr2); 2001| 24.3k| if (bsr1 != dest->bs) { ------------------ | Branch (2001:7): [True: 0, False: 24.3k] ------------------ 2002| 0| bitset_copy(dest->bs, bsr1); 2003| 0| bsr1 = dest->bs; 2004| 0| } 2005| 24.3k| if (not1 != 0) { ------------------ | Branch (2005:7): [True: 0, False: 24.3k] ------------------ 2006| 0| bitset_invert(dest->bs); 2007| 0| } 2008| | 2009| 24.3k| if (! ONIGENC_IS_SINGLEBYTE(enc)) { ------------------ | | 318| 24.3k|#define ONIGENC_IS_SINGLEBYTE(enc) (ONIGENC_MBC_MAXLEN(enc) == 1) | | ------------------ | | | | 365| 24.3k|#define ONIGENC_MBC_MAXLEN(enc) ((enc)->max_enc_len) | | ------------------ ------------------ | Branch (2009:7): [True: 24.3k, False: 0] ------------------ 2010| 24.3k| if (not1 != 0 && not2 != 0) { ------------------ | Branch (2010:9): [True: 0, False: 24.3k] | Branch (2010:22): [True: 0, False: 0] ------------------ 2011| 0| r = or_code_range_buf(enc, buf1, 0, buf2, 0, &pbuf, env); 2012| 0| } 2013| 24.3k| else { 2014| 24.3k| r = and_code_range_buf(buf1, not1, buf2, not2, &pbuf, env); 2015| 24.3k| if (r == 0 && not1 != 0) { ------------------ | Branch (2015:11): [True: 24.3k, False: 0] | Branch (2015:21): [True: 0, False: 24.3k] ------------------ 2016| 0| BBuf *tbuf = 0; 2017| 0| r = not_code_range_buf(enc, pbuf, &tbuf, env); 2018| 0| bbuf_free(pbuf); 2019| 0| pbuf = tbuf; 2020| 0| } 2021| 24.3k| } 2022| 24.3k| if (r != 0) { ------------------ | Branch (2022:9): [True: 0, False: 24.3k] ------------------ 2023| 0| bbuf_free(pbuf); 2024| 0| return r; 2025| 0| } 2026| | 2027| 24.3k| dest->mbuf = pbuf; 2028| 24.3k| bbuf_free(buf1); 2029| 24.3k| return r; 2030| 24.3k| } 2031| 0| return 0; 2032| 24.3k|} regparse.c:bitset_and: 225| 24.3k|{ 226| 24.3k| int i; 227| 219k| for (i = 0; i < BITSET_SIZE; i++) { dest[i] &= bs[i]; } ------------------ | | 428| 219k|#define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM) | | ------------------ | | | | 426| 219k|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | | | ------------------ | | | | | | 425| 219k|#define BITS_PER_BYTE 8 | | | | ------------------ | | ------------------ | | #define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM) | | ------------------ | | | | 427| 219k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | ------------------ | | | | | | 425| 219k|#define BITS_PER_BYTE 8 | | | | ------------------ | | ------------------ ------------------ | Branch (227:15): [True: 194k, False: 24.3k] ------------------ 228| 24.3k|} regparse.c:or_code_range_buf: 1825| 24.3k|{ 1826| 24.3k| int r; 1827| 24.3k| OnigCodePoint i, n1, *data1; 1828| 24.3k| OnigCodePoint from, to; 1829| | 1830| 24.3k| *pbuf = (BBuf* )NULL; 1831| 24.3k| if (IS_NULL(bbuf1) && IS_NULL(bbuf2)) { ------------------ | | 311| 48.6k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 24.3k, False: 0] | | ------------------ ------------------ if (IS_NULL(bbuf1) && IS_NULL(bbuf2)) { ------------------ | | 311| 24.3k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 24.3k, False: 0] | | ------------------ ------------------ 1832| 24.3k| if (not1 != 0 || not2 != 0) ------------------ | Branch (1832:9): [True: 0, False: 24.3k] | Branch (1832:22): [True: 0, False: 24.3k] ------------------ 1833| 0| return SET_ALL_MULTI_BYTE_RANGE(enc, pbuf); ------------------ | | 166| 0| add_code_range_to_buf(pbuf, env, MBCODE_START_POS(enc), ONIG_LAST_CODE_POINT) | | ------------------ | | | | 163| 0| (OnigCodePoint )(ONIGENC_MBC_MINLEN(enc) > 1 ? 0 : 0x80) | | | | ------------------ | | | | | | 367| 0|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) | | | | ------------------ | | | | | Branch (163:20): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | add_code_range_to_buf(pbuf, env, MBCODE_START_POS(enc), ONIG_LAST_CODE_POINT) | | ------------------ | | | | 317| 0|#define ONIG_LAST_CODE_POINT (~((OnigCodePoint )0)) | | ------------------ ------------------ 1834| 24.3k| return 0; 1835| 24.3k| } 1836| | 1837| 0| r = 0; 1838| 0| if (IS_NULL(bbuf2)) ------------------ | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 0] | | ------------------ ------------------ 1839| 0| SWAP_BBUF_NOT(bbuf1, not1, bbuf2, not2); ------------------ | | 1815| 0|#define SWAP_BBUF_NOT(bbuf1, not1, bbuf2, not2) do {\ | | 1816| 0| BBuf *tbuf; \ | | 1817| 0| int tnot; \ | | 1818| 0| tnot = not1; not1 = not2; not2 = tnot; \ | | 1819| 0| tbuf = bbuf1; bbuf1 = bbuf2; bbuf2 = tbuf; \ | | 1820| 0|} while (0) | | ------------------ | | | Branch (1820:10): [Folded - Ignored] | | ------------------ ------------------ 1840| | 1841| 0| if (IS_NULL(bbuf1)) { ------------------ | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 0] | | ------------------ ------------------ 1842| 0| if (not1 != 0) { ------------------ | Branch (1842:9): [True: 0, False: 0] ------------------ 1843| 0| return SET_ALL_MULTI_BYTE_RANGE(enc, pbuf); ------------------ | | 166| 0| add_code_range_to_buf(pbuf, env, MBCODE_START_POS(enc), ONIG_LAST_CODE_POINT) | | ------------------ | | | | 163| 0| (OnigCodePoint )(ONIGENC_MBC_MINLEN(enc) > 1 ? 0 : 0x80) | | | | ------------------ | | | | | | 367| 0|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) | | | | ------------------ | | | | | Branch (163:20): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | add_code_range_to_buf(pbuf, env, MBCODE_START_POS(enc), ONIG_LAST_CODE_POINT) | | ------------------ | | | | 317| 0|#define ONIG_LAST_CODE_POINT (~((OnigCodePoint )0)) | | ------------------ ------------------ 1844| 0| } 1845| 0| else { 1846| 0| if (not2 == 0) { ------------------ | Branch (1846:11): [True: 0, False: 0] ------------------ 1847| 0| return bbuf_clone(pbuf, bbuf2); 1848| 0| } 1849| 0| else { 1850| 0| return not_code_range_buf(enc, bbuf2, pbuf, env); 1851| 0| } 1852| 0| } 1853| 0| } 1854| | 1855| 0| if (not1 != 0) ------------------ | Branch (1855:7): [True: 0, False: 0] ------------------ 1856| 0| SWAP_BBUF_NOT(bbuf1, not1, bbuf2, not2); ------------------ | | 1815| 0|#define SWAP_BBUF_NOT(bbuf1, not1, bbuf2, not2) do {\ | | 1816| 0| BBuf *tbuf; \ | | 1817| 0| int tnot; \ | | 1818| 0| tnot = not1; not1 = not2; not2 = tnot; \ | | 1819| 0| tbuf = bbuf1; bbuf1 = bbuf2; bbuf2 = tbuf; \ | | 1820| 0|} while (0) | | ------------------ | | | Branch (1820:10): [Folded - Ignored] | | ------------------ ------------------ 1857| | 1858| 0| data1 = (OnigCodePoint* )(bbuf1->p); 1859| 0| GET_CODE_POINT(n1, data1); ------------------ | | 710| 0|#define GET_CODE_POINT(code,p) code = *((OnigCodePoint* )(p)) ------------------ 1860| 0| data1++; 1861| | 1862| 0| if (not2 == 0 && not1 == 0) { /* 1 OR 2 */ ------------------ | Branch (1862:7): [True: 0, False: 0] | Branch (1862:20): [True: 0, False: 0] ------------------ 1863| 0| r = bbuf_clone(pbuf, bbuf2); 1864| 0| } 1865| 0| else if (not1 == 0) { /* 1 OR (not 2) */ ------------------ | Branch (1865:12): [True: 0, False: 0] ------------------ 1866| 0| r = not_code_range_buf(enc, bbuf2, pbuf, env); 1867| 0| } 1868| 0| if (r != 0) return r; ------------------ | Branch (1868:7): [True: 0, False: 0] ------------------ 1869| | 1870| 0| for (i = 0; i < n1; i++) { ------------------ | Branch (1870:15): [True: 0, False: 0] ------------------ 1871| 0| from = data1[i*2]; 1872| 0| to = data1[i*2+1]; 1873| 0| r = add_code_range_to_buf(pbuf, env, from, to); 1874| 0| if (r != 0) return r; ------------------ | Branch (1874:9): [True: 0, False: 0] ------------------ 1875| 0| } 1876| 0| return 0; 1877| 0|} regparse.c:and_code_range_buf: 1921| 24.3k|{ 1922| 24.3k| int r; 1923| 24.3k| OnigCodePoint i, j, n1, n2, *data1, *data2; 1924| 24.3k| OnigCodePoint from, to, from1, to1, from2, to2; 1925| | 1926| 24.3k| *pbuf = (BBuf* )NULL; 1927| 24.3k| if (IS_NULL(bbuf1)) { ------------------ | | 311| 24.3k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 24.3k] | | ------------------ ------------------ 1928| 0| if (not1 != 0 && IS_NOT_NULL(bbuf2)) /* not1 != 0 -> not2 == 0 */ ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ | Branch (1928:9): [True: 0, False: 0] ------------------ 1929| 0| return bbuf_clone(pbuf, bbuf2); 1930| 0| return 0; 1931| 0| } 1932| 24.3k| else if (IS_NULL(bbuf2)) { ------------------ | | 311| 24.3k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 24.3k, False: 0] | | ------------------ ------------------ 1933| 24.3k| if (not2 != 0) ------------------ | Branch (1933:9): [True: 0, False: 24.3k] ------------------ 1934| 0| return bbuf_clone(pbuf, bbuf1); 1935| 24.3k| return 0; 1936| 24.3k| } 1937| | 1938| 0| if (not1 != 0) ------------------ | Branch (1938:7): [True: 0, False: 0] ------------------ 1939| 0| SWAP_BBUF_NOT(bbuf1, not1, bbuf2, not2); ------------------ | | 1815| 0|#define SWAP_BBUF_NOT(bbuf1, not1, bbuf2, not2) do {\ | | 1816| 0| BBuf *tbuf; \ | | 1817| 0| int tnot; \ | | 1818| 0| tnot = not1; not1 = not2; not2 = tnot; \ | | 1819| 0| tbuf = bbuf1; bbuf1 = bbuf2; bbuf2 = tbuf; \ | | 1820| 0|} while (0) | | ------------------ | | | Branch (1820:10): [Folded - Ignored] | | ------------------ ------------------ 1940| | 1941| 0| data1 = (OnigCodePoint* )(bbuf1->p); 1942| 0| data2 = (OnigCodePoint* )(bbuf2->p); 1943| 0| GET_CODE_POINT(n1, data1); ------------------ | | 710| 0|#define GET_CODE_POINT(code,p) code = *((OnigCodePoint* )(p)) ------------------ 1944| 0| GET_CODE_POINT(n2, data2); ------------------ | | 710| 0|#define GET_CODE_POINT(code,p) code = *((OnigCodePoint* )(p)) ------------------ 1945| 0| data1++; 1946| 0| data2++; 1947| | 1948| 0| if (not2 == 0 && not1 == 0) { /* 1 AND 2 */ ------------------ | Branch (1948:7): [True: 0, False: 0] | Branch (1948:20): [True: 0, False: 0] ------------------ 1949| 0| for (i = 0; i < n1; i++) { ------------------ | Branch (1949:17): [True: 0, False: 0] ------------------ 1950| 0| from1 = data1[i*2]; 1951| 0| to1 = data1[i*2+1]; 1952| 0| for (j = 0; j < n2; j++) { ------------------ | Branch (1952:19): [True: 0, False: 0] ------------------ 1953| 0| from2 = data2[j*2]; 1954| 0| to2 = data2[j*2+1]; 1955| 0| if (from2 > to1) break; ------------------ | Branch (1955:6): [True: 0, False: 0] ------------------ 1956| 0| if (to2 < from1) continue; ------------------ | Branch (1956:6): [True: 0, False: 0] ------------------ 1957| 0| from = MAX(from1, from2); ------------------ | | 309| 0|#define MAX(a,b) (((a)<(b))?(b):(a)) | | ------------------ | | | Branch (309:19): [True: 0, False: 0] | | ------------------ ------------------ 1958| 0| to = MIN(to1, to2); ------------------ | | 308| 0|#define MIN(a,b) (((a)>(b))?(b):(a)) | | ------------------ | | | Branch (308:19): [True: 0, False: 0] | | ------------------ ------------------ 1959| 0| r = add_code_range_to_buf(pbuf, env, from, to); 1960| 0| if (r != 0) return r; ------------------ | Branch (1960:6): [True: 0, False: 0] ------------------ 1961| 0| } 1962| 0| } 1963| 0| } 1964| 0| else if (not1 == 0) { /* 1 AND (not 2) */ ------------------ | Branch (1964:12): [True: 0, False: 0] ------------------ 1965| 0| for (i = 0; i < n1; i++) { ------------------ | Branch (1965:17): [True: 0, False: 0] ------------------ 1966| 0| from1 = data1[i*2]; 1967| 0| to1 = data1[i*2+1]; 1968| 0| r = and_code_range1(pbuf, env, from1, to1, data2, n2); 1969| 0| if (r != 0) return r; ------------------ | Branch (1969:11): [True: 0, False: 0] ------------------ 1970| 0| } 1971| 0| } 1972| | 1973| 0| return 0; 1974| 0|} regparse.c:or_cclass: 2036| 24.3k|{ 2037| 24.3k| OnigEncoding enc = env->enc; 2038| 24.3k| int r, not1, not2; 2039| 24.3k| BBuf *buf1, *buf2, *pbuf = 0; 2040| 24.3k| BitSetRef bsr1, bsr2; 2041| 24.3k| BitSet bs1, bs2; 2042| | 2043| 24.3k| not1 = IS_NCCLASS_NOT(dest); ------------------ | | 809| 24.3k|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 802| 24.3k|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 799| 24.3k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ 2044| 24.3k| bsr1 = dest->bs; 2045| 24.3k| buf1 = dest->mbuf; 2046| 24.3k| not2 = IS_NCCLASS_NOT(cc); ------------------ | | 809| 24.3k|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 802| 24.3k|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 799| 24.3k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ 2047| 24.3k| bsr2 = cc->bs; 2048| 24.3k| buf2 = cc->mbuf; 2049| | 2050| 24.3k| if (not1 != 0) { ------------------ | Branch (2050:7): [True: 0, False: 24.3k] ------------------ 2051| 0| bitset_invert_to(bsr1, bs1); 2052| 0| bsr1 = bs1; 2053| 0| } 2054| 24.3k| if (not2 != 0) { ------------------ | Branch (2054:7): [True: 0, False: 24.3k] ------------------ 2055| 0| bitset_invert_to(bsr2, bs2); 2056| 0| bsr2 = bs2; 2057| 0| } 2058| 24.3k| bitset_or(bsr1, bsr2); 2059| 24.3k| if (bsr1 != dest->bs) { ------------------ | Branch (2059:7): [True: 0, False: 24.3k] ------------------ 2060| 0| bitset_copy(dest->bs, bsr1); 2061| 0| bsr1 = dest->bs; 2062| 0| } 2063| 24.3k| if (not1 != 0) { ------------------ | Branch (2063:7): [True: 0, False: 24.3k] ------------------ 2064| 0| bitset_invert(dest->bs); 2065| 0| } 2066| | 2067| 24.3k| if (! ONIGENC_IS_SINGLEBYTE(enc)) { ------------------ | | 318| 24.3k|#define ONIGENC_IS_SINGLEBYTE(enc) (ONIGENC_MBC_MAXLEN(enc) == 1) | | ------------------ | | | | 365| 24.3k|#define ONIGENC_MBC_MAXLEN(enc) ((enc)->max_enc_len) | | ------------------ ------------------ | Branch (2067:7): [True: 24.3k, False: 0] ------------------ 2068| 24.3k| if (not1 != 0 && not2 != 0) { ------------------ | Branch (2068:9): [True: 0, False: 24.3k] | Branch (2068:22): [True: 0, False: 0] ------------------ 2069| 0| r = and_code_range_buf(buf1, 0, buf2, 0, &pbuf, env); 2070| 0| } 2071| 24.3k| else { 2072| 24.3k| r = or_code_range_buf(enc, buf1, not1, buf2, not2, &pbuf, env); 2073| 24.3k| if (r == 0 && not1 != 0) { ------------------ | Branch (2073:11): [True: 24.3k, False: 0] | Branch (2073:21): [True: 0, False: 24.3k] ------------------ 2074| 0| BBuf *tbuf = 0; 2075| 0| r = not_code_range_buf(enc, pbuf, &tbuf, env); 2076| 0| bbuf_free(pbuf); 2077| 0| pbuf = tbuf; 2078| 0| } 2079| 24.3k| } 2080| 24.3k| if (r != 0) { ------------------ | Branch (2080:9): [True: 0, False: 24.3k] ------------------ 2081| 0| bbuf_free(pbuf); 2082| 0| return r; 2083| 0| } 2084| | 2085| 24.3k| dest->mbuf = pbuf; 2086| 24.3k| bbuf_free(buf1); 2087| 24.3k| return r; 2088| 24.3k| } 2089| 0| else 2090| 0| return 0; 2091| 24.3k|} regparse.c:bitset_or: 232| 24.3k|{ 233| 24.3k| int i; 234| 219k| for (i = 0; i < BITSET_SIZE; i++) { dest[i] |= bs[i]; } ------------------ | | 428| 219k|#define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM) | | ------------------ | | | | 426| 219k|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | | | ------------------ | | | | | | 425| 219k|#define BITS_PER_BYTE 8 | | | | ------------------ | | ------------------ | | #define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM) | | ------------------ | | | | 427| 219k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | ------------------ | | | | | | 425| 219k|#define BITS_PER_BYTE 8 | | | | ------------------ | | ------------------ ------------------ | Branch (234:15): [True: 194k, False: 24.3k] ------------------ 235| 24.3k|} regparse.c:parse_char_class: 4562| 28.7k|{ 4563| 28.7k| int r, neg, len, fetched, and_start; 4564| 28.7k| OnigCodePoint v, vs; 4565| 28.7k| UChar *p; ------------------ | | 76| 28.7k|# define UChar OnigUChar ------------------ 4566| 28.7k| Node* node; 4567| 28.7k| Node* asc_node; 4568| 28.7k| CClassNode *cc, *prev_cc; 4569| 28.7k| CClassNode *asc_cc, *asc_prev_cc; 4570| 28.7k| CClassNode work_cc, asc_work_cc; 4571| | 4572| 28.7k| enum CCSTATE state; 4573| 28.7k| enum CCVALTYPE val_type, in_type; 4574| 28.7k| int val_israw, in_israw; 4575| | 4576| 28.7k| *np = *asc_np = NULL_NODE; ------------------ | | 283| 28.7k|#define NULL_NODE ((Node* )0) ------------------ 4577| 28.7k| env->parse_depth++; 4578| 28.7k| if (env->parse_depth > ParseDepthLimit) ------------------ | Branch (4578:7): [True: 0, False: 28.7k] ------------------ 4579| 0| return ONIGERR_PARSE_DEPTH_LIMIT_OVER; ------------------ | | 639| 0|#define ONIGERR_PARSE_DEPTH_LIMIT_OVER -16 ------------------ 4580| 28.7k| prev_cc = asc_prev_cc = (CClassNode* )NULL; 4581| 28.7k| r = fetch_token_in_cc(tok, src, end, env); 4582| 28.7k| if (r == TK_CHAR && tok->u.c == '^' && tok->escaped == 0) { ------------------ | Branch (4582:7): [True: 13.1k, False: 15.6k] | Branch (4582:23): [True: 11.1k, False: 1.99k] | Branch (4582:42): [True: 11.1k, False: 0] ------------------ 4583| 11.1k| neg = 1; 4584| 11.1k| r = fetch_token_in_cc(tok, src, end, env); 4585| 11.1k| } 4586| 17.6k| else { 4587| 17.6k| neg = 0; 4588| 17.6k| } 4589| | 4590| 28.7k| if (r < 0) return r; ------------------ | Branch (4590:7): [True: 0, False: 28.7k] ------------------ 4591| 28.7k| if (r == TK_CC_CLOSE) { ------------------ | Branch (4591:7): [True: 0, False: 28.7k] ------------------ 4592| 0| if (! code_exist_check((OnigCodePoint )']', ------------------ | Branch (4592:9): [True: 0, False: 0] ------------------ 4593| 0| *src, env->pattern_end, 1, env)) 4594| 0| return ONIGERR_EMPTY_CHAR_CLASS; ------------------ | | 647| 0|#define ONIGERR_EMPTY_CHAR_CLASS -102 ------------------ 4595| | 4596| 0| CC_ESC_WARN(env, (UChar* )"]"); 4597| 0| r = tok->type = TK_CHAR; /* allow []...] */ 4598| 0| } 4599| | 4600| 28.7k| *np = node = node_new_cclass(); 4601| 28.7k| CHECK_NULL_RETURN_MEMERR(node); ------------------ | | 314| 28.7k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 28.7k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 28.7k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 4602| 28.7k| cc = NCCLASS(node); ------------------ | | 77| 28.7k|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 4603| | 4604| 28.7k| if (IS_IGNORECASE(env->option)) { ------------------ | | 396| 28.7k|#define IS_IGNORECASE(option) ((option) & ONIG_OPTION_IGNORECASE) | | ------------------ | | | | 454| 28.7k|#define ONIG_OPTION_IGNORECASE 1U | | ------------------ | | | Branch (396:35): [True: 0, False: 28.7k] | | ------------------ ------------------ 4605| 0| *asc_np = asc_node = node_new_cclass(); 4606| 0| CHECK_NULL_RETURN_MEMERR(asc_node); ------------------ | | 314| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 632| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 4607| 0| asc_cc = NCCLASS(asc_node); ------------------ | | 77| 0|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 4608| 0| } 4609| 28.7k| else { 4610| 28.7k| asc_node = NULL_NODE; ------------------ | | 283| 28.7k|#define NULL_NODE ((Node* )0) ------------------ 4611| 28.7k| asc_cc = NULL; 4612| 28.7k| } 4613| | 4614| 28.7k| and_start = 0; 4615| 28.7k| state = CCS_START; 4616| 28.7k| p = *src; 4617| 105k| while (r != TK_CC_CLOSE) { ------------------ | Branch (4617:10): [True: 76.2k, False: 28.7k] ------------------ 4618| 76.2k| fetched = 0; 4619| 76.2k| switch (r) { 4620| 45.3k| case TK_CHAR: ------------------ | Branch (4620:5): [True: 45.3k, False: 30.8k] ------------------ 4621| 45.3k| if ((tok->u.code >= SINGLE_BYTE_SIZE) || ------------------ | | 426| 45.3k|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 425| 45.3k|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (4621:11): [True: 0, False: 45.3k] ------------------ 4622| 45.3k| (len = ONIGENC_CODE_TO_MBCLEN(env->enc, tok->u.c)) > 1) { ------------------ | | 370| 45.3k|#define ONIGENC_CODE_TO_MBCLEN(enc,code) (enc)->code_to_mbclen(code,enc) ------------------ | Branch (4622:4): [True: 0, False: 45.3k] ------------------ 4623| 0| in_type = CCV_CODE_POINT; 4624| 0| } 4625| 45.3k| else if (len < 0) { ------------------ | Branch (4625:16): [True: 0, False: 45.3k] ------------------ 4626| 0| r = len; 4627| 0| goto err; 4628| 0| } 4629| 45.3k| else { 4630| 45.3k| sb_char: 4631| 45.3k| in_type = CCV_SB; 4632| 45.3k| } 4633| 45.3k| v = (OnigCodePoint )tok->u.c; 4634| 45.3k| in_israw = 0; 4635| 45.3k| goto val_entry2; 4636| 0| break; 4637| | 4638| 0| case TK_RAW_BYTE: ------------------ | Branch (4638:5): [True: 0, False: 76.2k] ------------------ 4639| | /* tok->base != 0 : octal or hexadec. */ 4640| 0| if (! ONIGENC_IS_SINGLEBYTE(env->enc) && tok->base != 0) { ------------------ | | 318| 0|#define ONIGENC_IS_SINGLEBYTE(enc) (ONIGENC_MBC_MAXLEN(enc) == 1) | | ------------------ | | | | 365| 0|#define ONIGENC_MBC_MAXLEN(enc) ((enc)->max_enc_len) | | ------------------ ------------------ | Branch (4640:11): [True: 0, False: 0] | Branch (4640:48): [True: 0, False: 0] ------------------ 4641| 0| UChar buf[ONIGENC_CODE_TO_MBC_MAXLEN]; ------------------ | | 76| 0|# define UChar OnigUChar ------------------ 4642| 0| UChar* bufe = buf + ONIGENC_CODE_TO_MBC_MAXLEN; ------------------ | | 76| 0|# define UChar OnigUChar ------------------ UChar* bufe = buf + ONIGENC_CODE_TO_MBC_MAXLEN; ------------------ | | 289| 0|#define ONIGENC_CODE_TO_MBC_MAXLEN 7 ------------------ 4643| 0| UChar* psave = p; ------------------ | | 76| 0|# define UChar OnigUChar ------------------ 4644| 0| int i, base = tok->base; 4645| | 4646| 0| buf[0] = (UChar )tok->u.c; 4647| 0| for (i = 1; i < ONIGENC_MBC_MAXLEN(env->enc); i++) { ------------------ | | 365| 0|#define ONIGENC_MBC_MAXLEN(enc) ((enc)->max_enc_len) ------------------ | Branch (4647:14): [True: 0, False: 0] ------------------ 4648| 0| r = fetch_token_in_cc(tok, &p, end, env); 4649| 0| if (r < 0) goto err; ------------------ | Branch (4649:8): [True: 0, False: 0] ------------------ 4650| 0| if (r != TK_RAW_BYTE || tok->base != base) { ------------------ | Branch (4650:8): [True: 0, False: 0] | Branch (4650:28): [True: 0, False: 0] ------------------ 4651| 0| fetched = 1; 4652| 0| break; 4653| 0| } 4654| 0| buf[i] = (UChar )tok->u.c; 4655| 0| } 4656| | 4657| 0| if (i < ONIGENC_MBC_MINLEN(env->enc)) { ------------------ | | 367| 0|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) ------------------ | Branch (4657:6): [True: 0, False: 0] ------------------ 4658| 0| r = ONIGERR_TOO_SHORT_MULTI_BYTE_STRING; ------------------ | | 675| 0|#define ONIGERR_TOO_SHORT_MULTI_BYTE_STRING -206 ------------------ 4659| 0| goto err; 4660| 0| } 4661| | 4662| 0| if (env->enc == ONIG_ENCODING_EUC_JP || ------------------ | | 247| 0|# define ONIG_ENCODING_EUC_JP (&OnigEncodingEUC_JP) ------------------ | Branch (4662:6): [True: 0, False: 0] ------------------ 4663| 0| env->enc == ONIG_ENCODING_SJIS) { ------------------ | | 266| 0|# define ONIG_ENCODING_SJIS ONIG_ENCODING_SHIFT_JIS | | ------------------ | | | | 251| 0|# define ONIG_ENCODING_SHIFT_JIS (&OnigEncodingShift_JIS) | | ------------------ ------------------ | Branch (4663:3): [True: 0, False: 0] ------------------ 4664| | /* Strict version of enclen does not handle invalid single code 4665| | * point for SJIS and EUC-JP...*/ 4666| 0| len = enclen_approximate(env->enc, buf, buf + i); ------------------ | | 94| 0|#define enclen_approximate(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN_APPROX(enc,p,e)) | | ------------------ | | | | 363| 0|#define ONIGENC_MBC_ENC_LEN_APPROX(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | ------------------ | | | Branch (94:38): [True: 0, False: 0] | | ------------------ ------------------ 4667| 0| } 4668| 0| else { 4669| 0| len = enclen(env->enc, buf, buf + i); ------------------ | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 0] | | ------------------ ------------------ 4670| 0| } 4671| 0| if (i < len) { ------------------ | Branch (4671:6): [True: 0, False: 0] ------------------ 4672| 0| r = ONIGERR_TOO_SHORT_MULTI_BYTE_STRING; ------------------ | | 675| 0|#define ONIGERR_TOO_SHORT_MULTI_BYTE_STRING -206 ------------------ 4673| 0| goto err; 4674| 0| } 4675| 0| else if (i > len) { /* fetch back */ ------------------ | Branch (4675:11): [True: 0, False: 0] ------------------ 4676| 0| p = psave; 4677| 0| for (i = 1; i < len; i++) { ------------------ | Branch (4677:16): [True: 0, False: 0] ------------------ 4678| 0| (void)fetch_token_in_cc(tok, &p, end, env); 4679| | /* no need to check the retun value (already checked above) */ 4680| 0| } 4681| 0| fetched = 0; 4682| 0| } 4683| | 4684| 0| if (i == 1) { ------------------ | Branch (4684:6): [True: 0, False: 0] ------------------ 4685| 0| v = (OnigCodePoint )buf[0]; 4686| 0| goto raw_single; 4687| 0| } 4688| 0| else { 4689| 0| v = ONIGENC_MBC_TO_CODE(env->enc, buf, bufe); ------------------ | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) ------------------ 4690| 0| in_type = CCV_CODE_POINT; 4691| 0| } 4692| 0| } 4693| 0| else { 4694| 0| v = (OnigCodePoint )tok->u.c; 4695| 0| raw_single: 4696| 0| in_type = CCV_SB; 4697| 0| } 4698| 0| in_israw = 1; 4699| 0| goto val_entry2; 4700| 0| break; 4701| | 4702| 23.4k| case TK_CODE_POINT: ------------------ | Branch (4702:5): [True: 23.4k, False: 52.8k] ------------------ 4703| 23.4k| v = tok->u.code; 4704| 23.4k| in_israw = 1; 4705| 23.4k| val_entry: 4706| 23.4k| len = ONIGENC_CODE_TO_MBCLEN(env->enc, v); ------------------ | | 370| 23.4k|#define ONIGENC_CODE_TO_MBCLEN(enc,code) (enc)->code_to_mbclen(code,enc) ------------------ 4707| 23.4k| if (len < 0) { ------------------ | Branch (4707:11): [True: 0, False: 23.4k] ------------------ 4708| 0| r = len; 4709| 0| goto err; 4710| 0| } 4711| 23.4k| in_type = (len == 1 ? CCV_SB : CCV_CODE_POINT); ------------------ | Branch (4711:18): [True: 23.4k, False: 0] ------------------ 4712| 68.8k| val_entry2: 4713| 68.8k| r = next_state_val(cc, asc_cc, &vs, v, &val_israw, in_israw, in_type, &val_type, 4714| 68.8k| &state, env); 4715| 68.8k| if (r != 0) goto err; ------------------ | Branch (4715:11): [True: 0, False: 68.8k] ------------------ 4716| 68.8k| break; 4717| | 4718| 68.8k| case TK_POSIX_BRACKET_OPEN: ------------------ | Branch (4718:5): [True: 0, False: 76.2k] ------------------ 4719| 0| r = parse_posix_bracket(cc, asc_cc, &p, end, env); 4720| 0| if (r < 0) goto err; ------------------ | Branch (4720:11): [True: 0, False: 0] ------------------ 4721| 0| if (r == 1) { /* is not POSIX bracket */ ------------------ | Branch (4721:11): [True: 0, False: 0] ------------------ 4722| 0| CC_ESC_WARN(env, (UChar* )"["); 4723| 0| p = tok->backp; 4724| 0| v = (OnigCodePoint )tok->u.c; 4725| 0| in_israw = 0; 4726| 0| goto val_entry; 4727| 0| } 4728| 0| goto next_class; 4729| 0| break; 4730| | 4731| 7.44k| case TK_CHAR_TYPE: ------------------ | Branch (4731:5): [True: 7.44k, False: 68.8k] ------------------ 4732| 7.44k| r = add_ctype_to_cc(cc, tok->u.prop.ctype, tok->u.prop.not, 4733| 7.44k| IS_ASCII_RANGE(env->option), env); ------------------ | | 406| 7.44k|#define IS_ASCII_RANGE(option) ((option) & ONIG_OPTION_ASCII_RANGE) | | ------------------ | | | | 470| 7.44k|#define ONIG_OPTION_ASCII_RANGE (ONIG_OPTION_NOTEOS << 1) | | | | ------------------ | | | | | | 468| 7.44k|#define ONIG_OPTION_NOTEOS (ONIG_OPTION_NOTBOS << 1) | | | | | | ------------------ | | | | | | | | 467| 7.44k|#define ONIG_OPTION_NOTBOS (ONIG_OPTION_NOTEOL << 1) | | | | | | | | ------------------ | | | | | | | | | | 466| 7.44k|#define ONIG_OPTION_NOTEOL (ONIG_OPTION_NOTBOL << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 465| 7.44k|#define ONIG_OPTION_NOTBOL (ONIG_OPTION_CAPTURE_GROUP << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 463| 7.44k|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 462| 7.44k|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 461| 7.44k|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | 460| 7.44k|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | 459| 7.44k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | 458| 7.44k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | 456| 7.44k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 455| 7.44k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 454| 7.44k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 4734| 7.44k| if (r != 0) return r; ------------------ | Branch (4734:11): [True: 0, False: 7.44k] ------------------ 4735| 7.44k| if (IS_NOT_NULL(asc_cc)) { ------------------ | | 312| 7.44k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 7.44k] | | ------------------ ------------------ 4736| 0| if (tok->u.prop.ctype != ONIGENC_CTYPE_WORD) ------------------ | | 306| 0|#define ONIGENC_CTYPE_WORD 12 ------------------ | Branch (4736:6): [True: 0, False: 0] ------------------ 4737| 0| r = add_ctype_to_cc(asc_cc, tok->u.prop.ctype, tok->u.prop.not, 4738| 0| IS_ASCII_RANGE(env->option), env); ------------------ | | 406| 0|#define IS_ASCII_RANGE(option) ((option) & ONIG_OPTION_ASCII_RANGE) | | ------------------ | | | | 470| 0|#define ONIG_OPTION_ASCII_RANGE (ONIG_OPTION_NOTEOS << 1) | | | | ------------------ | | | | | | 468| 0|#define ONIG_OPTION_NOTEOS (ONIG_OPTION_NOTBOS << 1) | | | | | | ------------------ | | | | | | | | 467| 0|#define ONIG_OPTION_NOTBOS (ONIG_OPTION_NOTEOL << 1) | | | | | | | | ------------------ | | | | | | | | | | 466| 0|#define ONIG_OPTION_NOTEOL (ONIG_OPTION_NOTBOL << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 465| 0|#define ONIG_OPTION_NOTBOL (ONIG_OPTION_CAPTURE_GROUP << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 463| 0|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 462| 0|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 461| 0|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | 460| 0|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | 459| 0|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | 458| 0|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | 456| 0|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 455| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 454| 0|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 4739| 0| if (r != 0) return r; ------------------ | Branch (4739:6): [True: 0, False: 0] ------------------ 4740| 0| } 4741| | 4742| 7.44k| next_class: 4743| 7.44k| r = next_state_class(cc, asc_cc, &vs, &val_type, &state, env); 4744| 7.44k| if (r != 0) goto err; ------------------ | Branch (4744:11): [True: 0, False: 7.44k] ------------------ 4745| 7.44k| break; 4746| | 4747| 7.44k| case TK_CHAR_PROPERTY: ------------------ | Branch (4747:5): [True: 0, False: 76.2k] ------------------ 4748| 0| { 4749| 0| int ctype; 4750| | 4751| 0| ctype = fetch_char_property_to_ctype(&p, end, env); 4752| 0| if (ctype < 0) return ctype; ------------------ | Branch (4752:6): [True: 0, False: 0] ------------------ 4753| 0| r = add_ctype_to_cc(cc, ctype, tok->u.prop.not, 0, env); 4754| 0| if (r != 0) return r; ------------------ | Branch (4754:6): [True: 0, False: 0] ------------------ 4755| 0| if (IS_NOT_NULL(asc_cc)) { ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ 4756| 0| if (ctype != ONIGENC_CTYPE_ASCII) ------------------ | | 308| 0|#define ONIGENC_CTYPE_ASCII 14 ------------------ | Branch (4756:8): [True: 0, False: 0] ------------------ 4757| 0| r = add_ctype_to_cc(asc_cc, ctype, tok->u.prop.not, 0, env); 4758| 0| if (r != 0) return r; ------------------ | Branch (4758:8): [True: 0, False: 0] ------------------ 4759| 0| } 4760| 0| goto next_class; 4761| 0| } 4762| 0| break; 4763| | 4764| 0| case TK_CC_RANGE: ------------------ | Branch (4764:5): [True: 0, False: 76.2k] ------------------ 4765| 0| if (state == CCS_VALUE) { ------------------ | Branch (4765:11): [True: 0, False: 0] ------------------ 4766| 0| r = fetch_token_in_cc(tok, &p, end, env); 4767| 0| if (r < 0) goto err; ------------------ | Branch (4767:6): [True: 0, False: 0] ------------------ 4768| 0| fetched = 1; 4769| 0| if (r == TK_CC_CLOSE) { /* allow [x-] */ ------------------ | Branch (4769:6): [True: 0, False: 0] ------------------ 4770| 0| range_end_val: 4771| 0| v = (OnigCodePoint )'-'; 4772| 0| in_israw = 0; 4773| 0| goto val_entry; 4774| 0| } 4775| 0| else if (r == TK_CC_AND) { ------------------ | Branch (4775:11): [True: 0, False: 0] ------------------ 4776| 0| CC_ESC_WARN(env, (UChar* )"-"); 4777| 0| goto range_end_val; 4778| 0| } 4779| | 4780| 0| if (val_type == CCV_CLASS) { ------------------ | Branch (4780:6): [True: 0, False: 0] ------------------ 4781| 0| r = ONIGERR_UNMATCHED_RANGE_SPECIFIER_IN_CHAR_CLASS; ------------------ | | 656| 0|#define ONIGERR_UNMATCHED_RANGE_SPECIFIER_IN_CHAR_CLASS -112 ------------------ 4782| 0| goto err; 4783| 0| } 4784| | 4785| 0| state = CCS_RANGE; 4786| 0| } 4787| 0| else if (state == CCS_START) { ------------------ | Branch (4787:16): [True: 0, False: 0] ------------------ 4788| | /* [-xa] is allowed */ 4789| 0| v = (OnigCodePoint )tok->u.c; 4790| 0| in_israw = 0; 4791| | 4792| 0| r = fetch_token_in_cc(tok, &p, end, env); 4793| 0| if (r < 0) goto err; ------------------ | Branch (4793:6): [True: 0, False: 0] ------------------ 4794| 0| fetched = 1; 4795| | /* [--x] or [a&&-x] is warned. */ 4796| 0| if (r == TK_CC_RANGE || and_start != 0) ------------------ | Branch (4796:6): [True: 0, False: 0] | Branch (4796:26): [True: 0, False: 0] ------------------ 4797| 0| CC_ESC_WARN(env, (UChar* )"-"); 4798| | 4799| 0| goto val_entry; 4800| 0| } 4801| 0| else if (state == CCS_RANGE) { ------------------ | Branch (4801:16): [True: 0, False: 0] ------------------ 4802| 0| CC_ESC_WARN(env, (UChar* )"-"); 4803| 0| goto sb_char; /* [!--x] is allowed */ 4804| 0| } 4805| 0| else { /* CCS_COMPLETE */ 4806| 0| r = fetch_token_in_cc(tok, &p, end, env); 4807| 0| if (r < 0) goto err; ------------------ | Branch (4807:6): [True: 0, False: 0] ------------------ 4808| 0| fetched = 1; 4809| 0| if (r == TK_CC_CLOSE) goto range_end_val; /* allow [a-b-] */ ------------------ | Branch (4809:6): [True: 0, False: 0] ------------------ 4810| 0| else if (r == TK_CC_AND) { ------------------ | Branch (4810:11): [True: 0, False: 0] ------------------ 4811| 0| CC_ESC_WARN(env, (UChar* )"-"); 4812| 0| goto range_end_val; 4813| 0| } 4814| | 4815| 0| if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_ALLOW_DOUBLE_RANGE_OP_IN_CC)) { ------------------ | | 332| 0|#define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0) | | ------------------ | | | Branch (332:35): [True: 0, False: 0] | | ------------------ ------------------ 4816| 0| CC_ESC_WARN(env, (UChar* )"-"); 4817| 0| goto range_end_val; /* [0-9-a] is allowed as [0-9\-a] */ 4818| 0| } 4819| 0| r = ONIGERR_UNMATCHED_RANGE_SPECIFIER_IN_CHAR_CLASS; ------------------ | | 656| 0|#define ONIGERR_UNMATCHED_RANGE_SPECIFIER_IN_CHAR_CLASS -112 ------------------ 4820| 0| goto err; 4821| 0| } 4822| 0| break; 4823| | 4824| 0| case TK_CC_CC_OPEN: /* [ */ ------------------ | Branch (4824:5): [True: 0, False: 76.2k] ------------------ 4825| 0| { 4826| 0| Node *anode, *aasc_node; 4827| 0| CClassNode* acc; 4828| | 4829| 0| r = parse_char_class(&anode, &aasc_node, tok, &p, end, env); 4830| 0| if (r == 0) { ------------------ | Branch (4830:6): [True: 0, False: 0] ------------------ 4831| 0| acc = NCCLASS(anode); ------------------ | | 77| 0|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 4832| 0| r = or_cclass(cc, acc, env); 4833| 0| } 4834| 0| if (r == 0 && IS_NOT_NULL(aasc_node)) { ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ | Branch (4834:6): [True: 0, False: 0] ------------------ 4835| 0| acc = NCCLASS(aasc_node); ------------------ | | 77| 0|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 4836| 0| r = or_cclass(asc_cc, acc, env); 4837| 0| } 4838| 0| onig_node_free(anode); 4839| 0| onig_node_free(aasc_node); 4840| 0| if (r != 0) goto err; ------------------ | Branch (4840:6): [True: 0, False: 0] ------------------ 4841| 0| } 4842| 0| break; 4843| | 4844| 0| case TK_CC_AND: /* && */ ------------------ | Branch (4844:5): [True: 0, False: 76.2k] ------------------ 4845| 0| { 4846| 0| if (state == CCS_VALUE) { ------------------ | Branch (4846:6): [True: 0, False: 0] ------------------ 4847| 0| r = next_state_val(cc, asc_cc, &vs, 0, &val_israw, 0, val_type, 4848| 0| &val_type, &state, env); 4849| 0| if (r != 0) goto err; ------------------ | Branch (4849:8): [True: 0, False: 0] ------------------ 4850| 0| } 4851| | /* initialize local variables */ 4852| 0| and_start = 1; 4853| 0| state = CCS_START; 4854| | 4855| 0| if (IS_NOT_NULL(prev_cc)) { ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ 4856| 0| r = and_cclass(prev_cc, cc, env); 4857| 0| if (r != 0) goto err; ------------------ | Branch (4857:8): [True: 0, False: 0] ------------------ 4858| 0| bbuf_free(cc->mbuf); 4859| 0| if (IS_NOT_NULL(asc_cc)) { ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ 4860| 0| r = and_cclass(asc_prev_cc, asc_cc, env); 4861| 0| if (r != 0) goto err; ------------------ | Branch (4861:10): [True: 0, False: 0] ------------------ 4862| 0| bbuf_free(asc_cc->mbuf); 4863| 0| } 4864| 0| } 4865| 0| else { 4866| 0| prev_cc = cc; 4867| 0| cc = &work_cc; 4868| 0| if (IS_NOT_NULL(asc_cc)) { ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ 4869| 0| asc_prev_cc = asc_cc; 4870| 0| asc_cc = &asc_work_cc; 4871| 0| } 4872| 0| } 4873| 0| initialize_cclass(cc); 4874| 0| if (IS_NOT_NULL(asc_cc)) ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ 4875| 0| initialize_cclass(asc_cc); 4876| 0| } 4877| 0| break; 4878| | 4879| 0| case TK_EOT: ------------------ | Branch (4879:5): [True: 0, False: 76.2k] ------------------ 4880| 0| r = ONIGERR_PREMATURE_END_OF_CHAR_CLASS; ------------------ | | 648| 0|#define ONIGERR_PREMATURE_END_OF_CHAR_CLASS -103 ------------------ 4881| 0| goto err; 4882| 0| break; 4883| 0| default: ------------------ | Branch (4883:5): [True: 0, False: 76.2k] ------------------ 4884| 0| r = ONIGERR_PARSER_BUG; ------------------ | | 634| 0|#define ONIGERR_PARSER_BUG -11 ------------------ 4885| 0| goto err; 4886| 0| break; 4887| 76.2k| } 4888| | 4889| 76.2k| if (fetched) ------------------ | Branch (4889:9): [True: 0, False: 76.2k] ------------------ 4890| 0| r = tok->type; 4891| 76.2k| else { 4892| 76.2k| r = fetch_token_in_cc(tok, &p, end, env); 4893| 76.2k| if (r < 0) goto err; ------------------ | Branch (4893:11): [True: 0, False: 76.2k] ------------------ 4894| 76.2k| } 4895| 76.2k| } 4896| | 4897| 28.7k| if (state == CCS_VALUE) { ------------------ | Branch (4897:7): [True: 28.7k, False: 0] ------------------ 4898| 28.7k| r = next_state_val(cc, asc_cc, &vs, 0, &val_israw, 0, val_type, 4899| 28.7k| &val_type, &state, env); 4900| 28.7k| if (r != 0) goto err; ------------------ | Branch (4900:9): [True: 0, False: 28.7k] ------------------ 4901| 28.7k| } 4902| | 4903| 28.7k| if (IS_NOT_NULL(prev_cc)) { ------------------ | | 312| 28.7k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 28.7k] | | ------------------ ------------------ 4904| 0| r = and_cclass(prev_cc, cc, env); 4905| 0| if (r != 0) goto err; ------------------ | Branch (4905:9): [True: 0, False: 0] ------------------ 4906| 0| bbuf_free(cc->mbuf); 4907| 0| cc = prev_cc; 4908| 0| if (IS_NOT_NULL(asc_cc)) { ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ 4909| 0| r = and_cclass(asc_prev_cc, asc_cc, env); 4910| 0| if (r != 0) goto err; ------------------ | Branch (4910:11): [True: 0, False: 0] ------------------ 4911| 0| bbuf_free(asc_cc->mbuf); 4912| 0| asc_cc = asc_prev_cc; 4913| 0| } 4914| 0| } 4915| | 4916| 28.7k| if (neg != 0) { ------------------ | Branch (4916:7): [True: 11.1k, False: 17.6k] ------------------ 4917| 11.1k| NCCLASS_SET_NOT(cc); ------------------ | | 807| 11.1k|#define NCCLASS_SET_NOT(nd) NCCLASS_FLAG_SET(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 800| 11.1k|#define NCCLASS_FLAG_SET(cc,flag) (NCCLASS_FLAGS(cc) |= (flag)) | | | | ------------------ | | | | | | 799| 11.1k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ 4918| 11.1k| if (IS_NOT_NULL(asc_cc)) ------------------ | | 312| 11.1k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 11.1k] | | ------------------ ------------------ 4919| 11.1k| NCCLASS_SET_NOT(asc_cc); ------------------ | | 807| 0|#define NCCLASS_SET_NOT(nd) NCCLASS_FLAG_SET(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 800| 0|#define NCCLASS_FLAG_SET(cc,flag) (NCCLASS_FLAGS(cc) |= (flag)) | | | | ------------------ | | | | | | 799| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ 4920| 11.1k| } 4921| 17.6k| else { 4922| 17.6k| NCCLASS_CLEAR_NOT(cc); ------------------ | | 808| 17.6k|#define NCCLASS_CLEAR_NOT(nd) NCCLASS_FLAG_CLEAR(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 801| 17.6k|#define NCCLASS_FLAG_CLEAR(cc,flag) (NCCLASS_FLAGS(cc) &= ~(flag)) | | | | ------------------ | | | | | | 799| 17.6k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ 4923| 17.6k| if (IS_NOT_NULL(asc_cc)) ------------------ | | 312| 17.6k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 17.6k] | | ------------------ ------------------ 4924| 17.6k| NCCLASS_CLEAR_NOT(asc_cc); ------------------ | | 808| 0|#define NCCLASS_CLEAR_NOT(nd) NCCLASS_FLAG_CLEAR(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 801| 0|#define NCCLASS_FLAG_CLEAR(cc,flag) (NCCLASS_FLAGS(cc) &= ~(flag)) | | | | ------------------ | | | | | | 799| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ 4925| 17.6k| } 4926| 28.7k| if (IS_NCCLASS_NOT(cc) && ------------------ | | 809| 28.7k|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 802| 57.5k|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 799| 28.7k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | | | | Branch (802:37): [True: 11.1k, False: 17.6k] | | | | ------------------ | | ------------------ ------------------ 4927| 28.7k| IS_SYNTAX_BV(env->syntax, ONIG_SYN_NOT_NEWLINE_IN_NEGATIVE_CC)) { ------------------ | | 332| 11.1k|#define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0) | | ------------------ | | | Branch (332:35): [True: 0, False: 11.1k] | | ------------------ ------------------ 4928| 0| int is_empty; 4929| | 4930| 0| is_empty = (IS_NULL(cc->mbuf) ? 1 : 0); ------------------ | | 311| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (311:39): [True: 0, False: 0] | | ------------------ ------------------ 4931| 0| if (is_empty != 0) ------------------ | Branch (4931:9): [True: 0, False: 0] ------------------ 4932| 0| BITSET_IS_EMPTY(cc->bs, is_empty); ------------------ | | 181| 0|#define BITSET_IS_EMPTY(bs,empty) do {\ | | 182| 0| int i;\ | | 183| 0| empty = 1;\ | | 184| 0| for (i = 0; i < BITSET_SIZE; i++) {\ | | ------------------ | | | | 428| 0|#define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM) | | | | ------------------ | | | | | | 426| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM) | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (184:15): [True: 0, False: 0] | | ------------------ | | 185| 0| if ((bs)[i] != 0) {\ | | ------------------ | | | Branch (185:9): [True: 0, False: 0] | | ------------------ | | 186| 0| empty = 0; break;\ | | 187| 0| }\ | | 188| 0| }\ | | 189| 0|} while (0) | | ------------------ | | | Branch (189:10): [Folded - Ignored] | | ------------------ ------------------ 4933| | 4934| 0| if (is_empty == 0) { ------------------ | Branch (4934:9): [True: 0, False: 0] ------------------ 4935| 0|#define NEWLINE_CODE 0x0a 4936| | 4937| 0| if (ONIGENC_IS_CODE_NEWLINE(env->enc, NEWLINE_CODE)) { ------------------ | | 378| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_NEWLINE) | | ------------------ | | | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (375:48): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 4938| 0| if (ONIGENC_CODE_TO_MBCLEN(env->enc, NEWLINE_CODE) == 1) ------------------ | | 370| 0|#define ONIGENC_CODE_TO_MBCLEN(enc,code) (enc)->code_to_mbclen(code,enc) ------------------ | Branch (4938:6): [True: 0, False: 0] ------------------ 4939| 0| BITSET_SET_BIT_CHKDUP(cc->bs, NEWLINE_CODE); ------------------ | | 176| 0|#define BITSET_SET_BIT_CHKDUP(bs, pos) do { \ | | 177| 0| if (BITSET_AT(bs, pos)) CC_DUP_WARN(env, pos, pos); \ | | ------------------ | | | | 448| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (448:36): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 178| 0| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | 179| 0|} while (0) | | ------------------ | | | Branch (179:10): [Folded - Ignored] | | ------------------ ------------------ 4940| 0| else { 4941| 0| r = add_code_range(&(cc->mbuf), env, NEWLINE_CODE, NEWLINE_CODE); ------------------ | | 4935| 0|#define NEWLINE_CODE 0x0a ------------------ r = add_code_range(&(cc->mbuf), env, NEWLINE_CODE, NEWLINE_CODE); ------------------ | | 4935| 0|#define NEWLINE_CODE 0x0a ------------------ 4942| 0| if (r < 0) goto err; ------------------ | Branch (4942:8): [True: 0, False: 0] ------------------ 4943| 0| } 4944| 0| } 4945| 0| } 4946| 0| } 4947| 28.7k| *src = p; 4948| 28.7k| env->parse_depth--; 4949| 28.7k| return 0; 4950| | 4951| 0| err: 4952| 0| if (cc != NCCLASS(*np)) ------------------ | | 77| 0|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ | Branch (4952:7): [True: 0, False: 0] ------------------ 4953| 0| bbuf_free(cc->mbuf); 4954| 0| if (IS_NOT_NULL(asc_cc) && (asc_cc != NCCLASS(*asc_np))) ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ if (IS_NOT_NULL(asc_cc) && (asc_cc != NCCLASS(*asc_np))) ------------------ | | 77| 0|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ | Branch (4954:30): [True: 0, False: 0] ------------------ 4955| 0| bbuf_free(asc_cc->mbuf); 4956| 0| return r; 4957| 28.7k|} regparse.c:fetch_token_in_cc: 2980| 116k|{ 2981| 116k| int num; 2982| 116k| OnigCodePoint c, c2; 2983| 116k| const OnigSyntaxType* syn = env->syntax; 2984| 116k| OnigEncoding enc = env->enc; 2985| 116k| UChar* prev; ------------------ | | 76| 116k|# define UChar OnigUChar ------------------ 2986| 116k| UChar* p = *src; ------------------ | | 76| 116k|# define UChar OnigUChar ------------------ 2987| 116k| PFETCH_READY; ------------------ | | 295| 116k|# define PFETCH_READY UChar* pfetch_prev = NULL; (void)pfetch_prev | | ------------------ | | | | 76| 116k|# define UChar OnigUChar | | ------------------ ------------------ 2988| | 2989| 116k| if (PEND) { ------------------ | | 299| 116k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 116k] | | | Branch (299:23): [True: 116k, False: 0] | | ------------------ ------------------ 2990| 0| tok->type = TK_EOT; 2991| 0| return tok->type; 2992| 0| } 2993| | 2994| 116k| PFETCH(c); ------------------ | | 305| 116k|#define PFETCH(c) do { \ | | 306| 116k| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 116k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 116k] | | ------------------ | | 307| 116k| pfetch_prev = p; \ | | 308| 116k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 116k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 116k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 116k] | | | | ------------------ | | ------------------ | | 309| 116k|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 2995| 116k| tok->type = TK_CHAR; 2996| 116k| tok->base = 0; 2997| 116k| tok->u.c = c; 2998| 116k| tok->escaped = 0; 2999| | 3000| 116k| if (c == ']') { ------------------ | Branch (3000:7): [True: 28.7k, False: 87.4k] ------------------ 3001| 28.7k| tok->type = TK_CC_CLOSE; 3002| 28.7k| } 3003| 87.4k| else if (c == '-') { ------------------ | Branch (3003:12): [True: 0, False: 87.4k] ------------------ 3004| 0| tok->type = TK_CC_RANGE; 3005| 0| } 3006| 87.4k| else if (c == MC_ESC(syn)) { ------------------ | | 761| 87.4k|#define MC_ESC(syn) (syn)->meta_char_table.esc ------------------ | Branch (3006:12): [True: 32.7k, False: 54.6k] ------------------ 3007| 32.7k| if (! IS_SYNTAX_BV(syn, ONIG_SYN_BACKSLASH_ESCAPE_IN_CC)) ------------------ | | 332| 32.7k|#define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0) ------------------ | Branch (3007:9): [True: 0, False: 32.7k] ------------------ 3008| 0| goto end; 3009| | 3010| 32.7k| if (PEND) return ONIGERR_END_PATTERN_AT_ESCAPE; ------------------ | | 299| 32.7k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 32.7k] | | | Branch (299:23): [True: 32.7k, False: 0] | | ------------------ ------------------ if (PEND) return ONIGERR_END_PATTERN_AT_ESCAPE; ------------------ | | 649| 0|#define ONIGERR_END_PATTERN_AT_ESCAPE -104 ------------------ 3011| | 3012| 32.7k| PFETCH(c); ------------------ | | 305| 32.7k|#define PFETCH(c) do { \ | | 306| 32.7k| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 32.7k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 32.7k] | | ------------------ | | 307| 32.7k| pfetch_prev = p; \ | | 308| 32.7k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 32.7k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 32.7k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 32.7k] | | | | ------------------ | | ------------------ | | 309| 32.7k|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 3013| 32.7k| tok->escaped = 1; 3014| 32.7k| tok->u.c = c; 3015| 32.7k| switch (c) { 3016| 0| case 'w': ------------------ | Branch (3016:5): [True: 0, False: 32.7k] ------------------ 3017| 0| tok->type = TK_CHAR_TYPE; 3018| 0| tok->u.prop.ctype = ONIGENC_CTYPE_WORD; ------------------ | | 306| 0|#define ONIGENC_CTYPE_WORD 12 ------------------ 3019| 0| tok->u.prop.not = 0; 3020| 0| break; 3021| 0| case 'W': ------------------ | Branch (3021:5): [True: 0, False: 32.7k] ------------------ 3022| 0| tok->type = TK_CHAR_TYPE; 3023| 0| tok->u.prop.ctype = ONIGENC_CTYPE_WORD; ------------------ | | 306| 0|#define ONIGENC_CTYPE_WORD 12 ------------------ 3024| 0| tok->u.prop.not = 1; 3025| 0| break; 3026| 0| case 'd': ------------------ | Branch (3026:5): [True: 0, False: 32.7k] ------------------ 3027| 0| tok->type = TK_CHAR_TYPE; 3028| 0| tok->u.prop.ctype = ONIGENC_CTYPE_DIGIT; ------------------ | | 298| 0|#define ONIGENC_CTYPE_DIGIT 4 ------------------ 3029| 0| tok->u.prop.not = 0; 3030| 0| break; 3031| 0| case 'D': ------------------ | Branch (3031:5): [True: 0, False: 32.7k] ------------------ 3032| 0| tok->type = TK_CHAR_TYPE; 3033| 0| tok->u.prop.ctype = ONIGENC_CTYPE_DIGIT; ------------------ | | 298| 0|#define ONIGENC_CTYPE_DIGIT 4 ------------------ 3034| 0| tok->u.prop.not = 1; 3035| 0| break; 3036| 7.44k| case 's': ------------------ | Branch (3036:5): [True: 7.44k, False: 25.3k] ------------------ 3037| 7.44k| tok->type = TK_CHAR_TYPE; 3038| 7.44k| tok->u.prop.ctype = ONIGENC_CTYPE_SPACE; ------------------ | | 303| 7.44k|#define ONIGENC_CTYPE_SPACE 9 ------------------ 3039| 7.44k| tok->u.prop.not = 0; 3040| 7.44k| break; 3041| 0| case 'S': ------------------ | Branch (3041:5): [True: 0, False: 32.7k] ------------------ 3042| 0| tok->type = TK_CHAR_TYPE; 3043| 0| tok->u.prop.ctype = ONIGENC_CTYPE_SPACE; ------------------ | | 303| 0|#define ONIGENC_CTYPE_SPACE 9 ------------------ 3044| 0| tok->u.prop.not = 1; 3045| 0| break; 3046| 0| case 'h': ------------------ | Branch (3046:5): [True: 0, False: 32.7k] ------------------ 3047| 0| if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_H_XDIGIT)) break; ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) ------------------ | Branch (3047:11): [True: 0, False: 0] ------------------ 3048| 0| tok->type = TK_CHAR_TYPE; 3049| 0| tok->u.prop.ctype = ONIGENC_CTYPE_XDIGIT; ------------------ | | 305| 0|#define ONIGENC_CTYPE_XDIGIT 11 ------------------ 3050| 0| tok->u.prop.not = 0; 3051| 0| break; 3052| 0| case 'H': ------------------ | Branch (3052:5): [True: 0, False: 32.7k] ------------------ 3053| 0| if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_H_XDIGIT)) break; ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) ------------------ | Branch (3053:11): [True: 0, False: 0] ------------------ 3054| 0| tok->type = TK_CHAR_TYPE; 3055| 0| tok->u.prop.ctype = ONIGENC_CTYPE_XDIGIT; ------------------ | | 305| 0|#define ONIGENC_CTYPE_XDIGIT 11 ------------------ 3056| 0| tok->u.prop.not = 1; 3057| 0| break; 3058| | 3059| 0| case 'p': ------------------ | Branch (3059:5): [True: 0, False: 32.7k] ------------------ 3060| 0| case 'P': ------------------ | Branch (3060:5): [True: 0, False: 32.7k] ------------------ 3061| 0| if (PEND) break; ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 0] | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ 3062| | 3063| 0| c2 = PPEEK; ------------------ | | 319| 0|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | ------------------ | | | | 291| 0|#define PEND_VALUE 0 | | ------------------ | | | Branch (319:23): [True: 0, False: 0] | | ------------------ ------------------ 3064| 0| if (c2 == '{' && ------------------ | Branch (3064:11): [True: 0, False: 0] ------------------ 3065| 0| IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_P_BRACE_CHAR_PROPERTY)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 3066| 0| PINC; ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3067| 0| tok->type = TK_CHAR_PROPERTY; 3068| 0| tok->u.prop.not = (c == 'P' ? 1 : 0); ------------------ | Branch (3068:21): [True: 0, False: 0] ------------------ 3069| | 3070| 0| if (!PEND && IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_P_BRACE_CIRCUMFLEX_NOT)) { ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ if (!PEND && IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_P_BRACE_CIRCUMFLEX_NOT)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ | Branch (3070:6): [True: 0, False: 0] ------------------ 3071| 0| PFETCH(c2); ------------------ | | 305| 0|#define PFETCH(c) do { \ | | 306| 0| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 0] | | ------------------ | | 307| 0| pfetch_prev = p; \ | | 308| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 309| 0|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 3072| 0| if (c2 == '^') { ------------------ | Branch (3072:8): [True: 0, False: 0] ------------------ 3073| 0| tok->u.prop.not = (tok->u.prop.not == 0 ? 1 : 0); ------------------ | Branch (3073:25): [True: 0, False: 0] ------------------ 3074| 0| } 3075| 0| else 3076| 0| PUNFETCH; ------------------ | | 300| 0|#define PUNFETCH p = pfetch_prev ------------------ 3077| 0| } 3078| 0| } 3079| 0| else { 3080| 0| onig_syntax_warn(env, "invalid Unicode Property \\%c", c); 3081| 0| } 3082| 0| break; 3083| | 3084| 0| case 'x': ------------------ | Branch (3084:5): [True: 0, False: 32.7k] ------------------ 3085| 0| if (PEND) break; ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 0] | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ 3086| | 3087| 0| prev = p; 3088| 0| if (PPEEK_IS('{') && IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_X_BRACE_HEX8)) { ------------------ | | 320| 0|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 0|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | | | ------------------ | | | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 291| 0|#define PEND_VALUE 0 | | | | ------------------ | | | | | Branch (319:23): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | | Branch (320:22): [True: 0, False: 0] | | ------------------ ------------------ if (PPEEK_IS('{') && IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_X_BRACE_HEX8)) { ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) | | ------------------ | | | Branch (330:35): [True: 0, False: 0] | | ------------------ ------------------ 3089| 0| PINC; ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3090| 0| num = scan_unsigned_hexadecimal_number(&p, end, 0, 8, enc); 3091| 0| if (num < 0) return ONIGERR_TOO_BIG_WIDE_CHAR_VALUE; ------------------ | | 694| 0|#define ONIGERR_TOO_BIG_WIDE_CHAR_VALUE -401 ------------------ | Branch (3091:6): [True: 0, False: 0] ------------------ 3092| 0| if (!PEND) { ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ | Branch (3092:6): [True: 0, False: 0] ------------------ 3093| 0| c2 = PPEEK; ------------------ | | 319| 0|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | ------------------ | | | | 291| 0|#define PEND_VALUE 0 | | ------------------ | | | Branch (319:23): [True: 0, False: 0] | | ------------------ ------------------ 3094| 0| if (ONIGENC_IS_CODE_XDIGIT(enc, c2)) ------------------ | | 402| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_XDIGIT) | | ------------------ | | | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (375:48): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 3095| 0| return ONIGERR_TOO_LONG_WIDE_CHAR_VALUE; ------------------ | | 681| 0|#define ONIGERR_TOO_LONG_WIDE_CHAR_VALUE -212 ------------------ 3096| 0| } 3097| | 3098| 0| if (p > prev + enclen(enc, prev, end) && !PEND && (PPEEK_IS('}'))) { ------------------ | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 0] | | ------------------ ------------------ if (p > prev + enclen(enc, prev, end) && !PEND && (PPEEK_IS('}'))) { ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ if (p > prev + enclen(enc, prev, end) && !PEND && (PPEEK_IS('}'))) { ------------------ | | 320| 0|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 0|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | | | ------------------ | | | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 291| 0|#define PEND_VALUE 0 | | | | ------------------ | | | | | Branch (319:23): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ | Branch (3098:6): [True: 0, False: 0] | Branch (3098:43): [True: 0, False: 0] | Branch (3098:52): [True: 0, False: 0] ------------------ 3099| 0| PINC; ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3100| 0| tok->type = TK_CODE_POINT; 3101| 0| tok->base = 16; 3102| 0| tok->u.code = (OnigCodePoint )num; 3103| 0| } 3104| 0| else { 3105| | /* can't read nothing or invalid format */ 3106| 0| p = prev; 3107| 0| } 3108| 0| } 3109| 0| else if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_X_HEX2)) { ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) | | ------------------ | | | Branch (330:35): [True: 0, False: 0] | | ------------------ ------------------ 3110| 0| num = scan_unsigned_hexadecimal_number(&p, end, 0, 2, enc); 3111| 0| if (num < 0) return ONIGERR_TOO_BIG_NUMBER; ------------------ | | 669| 0|#define ONIGERR_TOO_BIG_NUMBER -200 ------------------ | Branch (3111:6): [True: 0, False: 0] ------------------ 3112| 0| if (p == prev) { /* can't read nothing. */ ------------------ | Branch (3112:6): [True: 0, False: 0] ------------------ 3113| 0| num = 0; /* but, it's not error */ 3114| 0| } 3115| 0| tok->type = TK_RAW_BYTE; 3116| 0| tok->base = 16; 3117| 0| tok->u.c = num; 3118| 0| } 3119| 0| break; 3120| | 3121| 0| case 'u': ------------------ | Branch (3121:5): [True: 0, False: 32.7k] ------------------ 3122| 0| if (PEND) break; ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 0] | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ 3123| | 3124| 0| prev = p; 3125| 0| if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_U_HEX4)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 3126| 0| num = scan_unsigned_hexadecimal_number(&p, end, 4, 4, enc); 3127| 0| if (num < -1) return ONIGERR_TOO_SHORT_DIGITS; ------------------ | | 680| 0|#define ONIGERR_TOO_SHORT_DIGITS -211 ------------------ | Branch (3127:6): [True: 0, False: 0] ------------------ 3128| 0| else if (num < 0) return ONIGERR_TOO_BIG_NUMBER; ------------------ | | 669| 0|#define ONIGERR_TOO_BIG_NUMBER -200 ------------------ | Branch (3128:11): [True: 0, False: 0] ------------------ 3129| 0| if (p == prev) { /* can't read nothing. */ ------------------ | Branch (3129:6): [True: 0, False: 0] ------------------ 3130| 0| num = 0; /* but, it's not error */ 3131| 0| } 3132| 0| tok->type = TK_CODE_POINT; 3133| 0| tok->base = 16; 3134| 0| tok->u.code = (OnigCodePoint )num; 3135| 0| } 3136| 0| break; 3137| | 3138| 0| case 'o': ------------------ | Branch (3138:5): [True: 0, False: 32.7k] ------------------ 3139| 0| if (PEND) break; ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 0] | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ 3140| | 3141| 0| prev = p; 3142| 0| if (PPEEK_IS('{') && IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_O_BRACE_OCTAL)) { ------------------ | | 320| 0|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 0|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | | | ------------------ | | | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 291| 0|#define PEND_VALUE 0 | | | | ------------------ | | | | | Branch (319:23): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | | Branch (320:22): [True: 0, False: 0] | | ------------------ ------------------ if (PPEEK_IS('{') && IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_O_BRACE_OCTAL)) { ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) | | ------------------ | | | Branch (330:35): [True: 0, False: 0] | | ------------------ ------------------ 3143| 0| PINC; ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3144| 0| num = scan_unsigned_octal_number(&p, end, 11, enc); 3145| 0| if (num < 0) return ONIGERR_TOO_BIG_WIDE_CHAR_VALUE; ------------------ | | 694| 0|#define ONIGERR_TOO_BIG_WIDE_CHAR_VALUE -401 ------------------ | Branch (3145:6): [True: 0, False: 0] ------------------ 3146| 0| if (!PEND) { ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ | Branch (3146:6): [True: 0, False: 0] ------------------ 3147| 0| c2 = PPEEK; ------------------ | | 319| 0|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | ------------------ | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | ------------------ | | | | 291| 0|#define PEND_VALUE 0 | | ------------------ | | | Branch (319:23): [True: 0, False: 0] | | ------------------ ------------------ 3148| 0| if (ONIGENC_IS_CODE_DIGIT(enc, c2) && c2 < '8') ------------------ | | 400| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_DIGIT) | | ------------------ | | | | 375| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (375:48): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ | Branch (3148:42): [True: 0, False: 0] ------------------ 3149| 0| return ONIGERR_TOO_LONG_WIDE_CHAR_VALUE; ------------------ | | 681| 0|#define ONIGERR_TOO_LONG_WIDE_CHAR_VALUE -212 ------------------ 3150| 0| } 3151| | 3152| 0| if (p > prev + enclen(enc, prev, end) && !PEND && (PPEEK_IS('}'))) { ------------------ | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 0] | | ------------------ ------------------ if (p > prev + enclen(enc, prev, end) && !PEND && (PPEEK_IS('}'))) { ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ if (p > prev + enclen(enc, prev, end) && !PEND && (PPEEK_IS('}'))) { ------------------ | | 320| 0|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 0|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | | | ------------------ | | | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 291| 0|#define PEND_VALUE 0 | | | | ------------------ | | | | | Branch (319:23): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ | Branch (3152:6): [True: 0, False: 0] | Branch (3152:43): [True: 0, False: 0] | Branch (3152:52): [True: 0, False: 0] ------------------ 3153| 0| PINC; ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3154| 0| tok->type = TK_CODE_POINT; 3155| 0| tok->base = 8; 3156| 0| tok->u.code = (OnigCodePoint )num; 3157| 0| } 3158| 0| else { 3159| | /* can't read nothing or invalid format */ 3160| 0| p = prev; 3161| 0| } 3162| 0| } 3163| 0| break; 3164| | 3165| 0| case '0': ------------------ | Branch (3165:5): [True: 0, False: 32.7k] ------------------ 3166| 0| case '1': case '2': case '3': case '4': case '5': case '6': case '7': ------------------ | Branch (3166:5): [True: 0, False: 32.7k] | Branch (3166:15): [True: 0, False: 32.7k] | Branch (3166:25): [True: 0, False: 32.7k] | Branch (3166:35): [True: 0, False: 32.7k] | Branch (3166:45): [True: 0, False: 32.7k] | Branch (3166:55): [True: 0, False: 32.7k] | Branch (3166:65): [True: 0, False: 32.7k] ------------------ 3167| 0| if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_OCTAL3)) { ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) | | ------------------ | | | Branch (330:35): [True: 0, False: 0] | | ------------------ ------------------ 3168| 0| PUNFETCH; ------------------ | | 300| 0|#define PUNFETCH p = pfetch_prev ------------------ 3169| 0| prev = p; 3170| 0| num = scan_unsigned_octal_number(&p, end, 3, enc); 3171| 0| if (num < 0 || 0xff < num) return ONIGERR_TOO_BIG_NUMBER; ------------------ | | 669| 0|#define ONIGERR_TOO_BIG_NUMBER -200 ------------------ | Branch (3171:6): [True: 0, False: 0] | Branch (3171:17): [True: 0, False: 0] ------------------ 3172| 0| if (p == prev) { /* can't read nothing. */ ------------------ | Branch (3172:6): [True: 0, False: 0] ------------------ 3173| 0| num = 0; /* but, it's not error */ 3174| 0| } 3175| 0| tok->type = TK_RAW_BYTE; 3176| 0| tok->base = 8; 3177| 0| tok->u.c = num; 3178| 0| } 3179| 0| break; 3180| | 3181| 25.3k| default: ------------------ | Branch (3181:5): [True: 25.3k, False: 7.44k] ------------------ 3182| 25.3k| PUNFETCH; ------------------ | | 300| 25.3k|#define PUNFETCH p = pfetch_prev ------------------ 3183| 25.3k| num = fetch_escaped_value(&p, end, env, &c2); 3184| 25.3k| if (num < 0) return num; ------------------ | Branch (3184:11): [True: 0, False: 25.3k] ------------------ 3185| 25.3k| if ((OnigCodePoint )tok->u.c != c2) { ------------------ | Branch (3185:11): [True: 23.4k, False: 1.88k] ------------------ 3186| 23.4k| tok->u.code = (OnigCodePoint )c2; 3187| 23.4k| tok->type = TK_CODE_POINT; 3188| 23.4k| } 3189| 25.3k| break; 3190| 32.7k| } 3191| 32.7k| } 3192| 54.6k| else if (c == '[') { ------------------ | Branch (3192:12): [True: 0, False: 54.6k] ------------------ 3193| 0| if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_POSIX_BRACKET) && (PPEEK_IS(':'))) { ------------------ | | 330| 0|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) | | ------------------ | | | Branch (330:35): [True: 0, False: 0] | | ------------------ ------------------ if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_POSIX_BRACKET) && (PPEEK_IS(':'))) { ------------------ | | 320| 0|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 0|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | | | ------------------ | | | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 291| 0|#define PEND_VALUE 0 | | | | ------------------ | | | | | Branch (319:23): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ | Branch (3193:57): [True: 0, False: 0] ------------------ 3194| 0| OnigCodePoint send[] = { (OnigCodePoint )':', (OnigCodePoint )']' }; 3195| 0| tok->backp = p; /* point at '[' is read */ 3196| 0| PINC; ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3197| 0| if (str_exist_check_with_esc(send, 2, p, end, ------------------ | Branch (3197:11): [True: 0, False: 0] ------------------ 3198| 0| (OnigCodePoint )']', enc, syn)) { 3199| 0| tok->type = TK_POSIX_BRACKET_OPEN; 3200| 0| } 3201| 0| else { 3202| 0| PUNFETCH; ------------------ | | 300| 0|#define PUNFETCH p = pfetch_prev ------------------ 3203| 0| goto cc_in_cc; 3204| 0| } 3205| 0| } 3206| 0| else { 3207| 0| cc_in_cc: 3208| 0| if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_CCLASS_SET_OP)) { ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 3209| 0| tok->type = TK_CC_CC_OPEN; 3210| 0| } 3211| 0| else { 3212| 0| CC_ESC_WARN(env, (UChar* )"["); 3213| 0| } 3214| 0| } 3215| 0| } 3216| 54.6k| else if (c == '&') { ------------------ | Branch (3216:12): [True: 0, False: 54.6k] ------------------ 3217| 0| if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_CCLASS_SET_OP) && ------------------ | | 331| 0|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 0, False: 0] | | ------------------ ------------------ 3218| 0| !PEND && (PPEEK_IS('&'))) { ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ !PEND && (PPEEK_IS('&'))) { ------------------ | | 320| 0|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 0|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 369| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | | | ------------------ | | | | #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 291| 0|#define PEND_VALUE 0 | | | | ------------------ | | | | | Branch (319:23): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ | Branch (3218:2): [True: 0, False: 0] | Branch (3218:11): [True: 0, False: 0] ------------------ 3219| 0| PINC; ------------------ | | 301| 0|#define PINC do { \ | | 302| 0| pfetch_prev = p; \ | | 303| 0| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 0|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 364| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3220| 0| tok->type = TK_CC_AND; 3221| 0| } 3222| 0| } 3223| | 3224| 116k| end: 3225| 116k| *src = p; 3226| 116k| return tok->type; 3227| 116k|} regparse.c:next_state_val: 4456| 97.6k|{ 4457| 97.6k| int r; 4458| | 4459| 97.6k| switch (*state) { 4460| 76.2k| case CCS_VALUE: ------------------ | Branch (4460:3): [True: 76.2k, False: 21.3k] ------------------ 4461| 76.2k| if (*type == CCV_SB) { ------------------ | Branch (4461:9): [True: 68.8k, False: 7.44k] ------------------ 4462| 68.8k| BITSET_SET_BIT_CHKDUP(cc->bs, (int )(*from)); ------------------ | | 176| 68.8k|#define BITSET_SET_BIT_CHKDUP(bs, pos) do { \ | | 177| 68.8k| if (BITSET_AT(bs, pos)) CC_DUP_WARN(env, pos, pos); \ | | ------------------ | | | | 448| 68.8k|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 445| 68.8k|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 427| 68.8k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 68.8k|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 446| 68.8k|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 427| 68.8k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 68.8k|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (448:36): [True: 0, False: 68.8k] | | | | ------------------ | | ------------------ | | 178| 68.8k| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 445| 68.8k|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 68.8k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 68.8k|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 446| 68.8k|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 68.8k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 68.8k|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | 179| 68.8k|} while (0) | | ------------------ | | | Branch (179:10): [Folded - Ignored] | | ------------------ ------------------ 4463| 68.8k| if (IS_NOT_NULL(asc_cc)) ------------------ | | 312| 68.8k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 68.8k] | | ------------------ ------------------ 4464| 68.8k| BITSET_SET_BIT(asc_cc->bs, (int )(*from)); ------------------ | | 449| 0|#define BITSET_SET_BIT(bs, pos) BS_ROOM(bs,pos) |= BS_BIT(pos) | | ------------------ | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | #define BITSET_SET_BIT(bs, pos) BS_ROOM(bs,pos) |= BS_BIT(pos) | | ------------------ | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 4465| 68.8k| } 4466| 7.44k| else if (*type == CCV_CODE_POINT) { ------------------ | Branch (4466:14): [True: 0, False: 7.44k] ------------------ 4467| 0| r = add_code_range(&(cc->mbuf), env, *from, *from); 4468| 0| if (r < 0) return r; ------------------ | Branch (4468:11): [True: 0, False: 0] ------------------ 4469| 0| if (IS_NOT_NULL(asc_cc)) { ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ 4470| 0| r = add_code_range0(&(asc_cc->mbuf), env, *from, *from, 0); 4471| 0| if (r < 0) return r; ------------------ | Branch (4471:6): [True: 0, False: 0] ------------------ 4472| 0| } 4473| 0| } 4474| 76.2k| break; 4475| | 4476| 76.2k| case CCS_RANGE: ------------------ | Branch (4476:3): [True: 0, False: 97.6k] ------------------ 4477| 0| if (intype == *type) { ------------------ | Branch (4477:9): [True: 0, False: 0] ------------------ 4478| 0| if (intype == CCV_SB) { ------------------ | Branch (4478:11): [True: 0, False: 0] ------------------ 4479| 0| if (*from > 0xff || to > 0xff) ------------------ | Branch (4479:6): [True: 0, False: 0] | Branch (4479:22): [True: 0, False: 0] ------------------ 4480| 0| return ONIGERR_INVALID_CODE_POINT_VALUE; ------------------ | | 692| 0|#define ONIGERR_INVALID_CODE_POINT_VALUE -400 ------------------ 4481| | 4482| 0| if (*from > to) { ------------------ | Branch (4482:6): [True: 0, False: 0] ------------------ 4483| 0| if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_ALLOW_EMPTY_RANGE_IN_CC)) ------------------ | | 332| 0|#define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0) | | ------------------ | | | Branch (332:35): [True: 0, False: 0] | | ------------------ ------------------ 4484| 0| goto ccs_range_end; 4485| 0| else 4486| 0| return ONIGERR_EMPTY_RANGE_IN_CHAR_CLASS; ------------------ | | 672| 0|#define ONIGERR_EMPTY_RANGE_IN_CHAR_CLASS -203 ------------------ 4487| 0| } 4488| 0| bitset_set_range(env, cc->bs, (int )*from, (int )to); 4489| 0| if (IS_NOT_NULL(asc_cc)) ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ 4490| 0| bitset_set_range(env, asc_cc->bs, (int )*from, (int )to); 4491| 0| } 4492| 0| else { 4493| 0| r = add_code_range(&(cc->mbuf), env, *from, to); 4494| 0| if (r < 0) return r; ------------------ | Branch (4494:6): [True: 0, False: 0] ------------------ 4495| 0| if (IS_NOT_NULL(asc_cc)) { ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ 4496| 0| r = add_code_range0(&(asc_cc->mbuf), env, *from, to, 0); 4497| 0| if (r < 0) return r; ------------------ | Branch (4497:8): [True: 0, False: 0] ------------------ 4498| 0| } 4499| 0| } 4500| 0| } 4501| 0| else { 4502| 0| if (*from > to) { ------------------ | Branch (4502:11): [True: 0, False: 0] ------------------ 4503| 0| if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_ALLOW_EMPTY_RANGE_IN_CC)) ------------------ | | 332| 0|#define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0) | | ------------------ | | | Branch (332:35): [True: 0, False: 0] | | ------------------ ------------------ 4504| 0| goto ccs_range_end; 4505| 0| else 4506| 0| return ONIGERR_EMPTY_RANGE_IN_CHAR_CLASS; ------------------ | | 672| 0|#define ONIGERR_EMPTY_RANGE_IN_CHAR_CLASS -203 ------------------ 4507| 0| } 4508| 0| bitset_set_range(env, cc->bs, (int )*from, (int )(to < 0xff ? to : 0xff)); ------------------ | Branch (4508:57): [True: 0, False: 0] ------------------ 4509| 0| r = add_code_range(&(cc->mbuf), env, (OnigCodePoint )*from, to); 4510| 0| if (r < 0) return r; ------------------ | Branch (4510:11): [True: 0, False: 0] ------------------ 4511| 0| if (IS_NOT_NULL(asc_cc)) { ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ 4512| 0| bitset_set_range(env, asc_cc->bs, (int )*from, (int )(to < 0xff ? to : 0xff)); ------------------ | Branch (4512:56): [True: 0, False: 0] ------------------ 4513| 0| r = add_code_range0(&(asc_cc->mbuf), env, (OnigCodePoint )*from, to, 0); 4514| 0| if (r < 0) return r; ------------------ | Branch (4514:6): [True: 0, False: 0] ------------------ 4515| 0| } 4516| 0| } 4517| 0| ccs_range_end: 4518| 0| *state = CCS_COMPLETE; 4519| 0| break; 4520| | 4521| 0| case CCS_COMPLETE: ------------------ | Branch (4521:3): [True: 0, False: 97.6k] ------------------ 4522| 21.3k| case CCS_START: ------------------ | Branch (4522:3): [True: 21.3k, False: 76.2k] ------------------ 4523| 21.3k| *state = CCS_VALUE; 4524| 21.3k| break; 4525| | 4526| 0| default: ------------------ | Branch (4526:3): [True: 0, False: 97.6k] ------------------ 4527| 0| break; 4528| 97.6k| } 4529| | 4530| 97.6k| *from_israw = to_israw; 4531| 97.6k| *from = to; 4532| 97.6k| *type = intype; 4533| 97.6k| return 0; 4534| 97.6k|} regparse.c:next_state_class: 4423| 7.44k|{ 4424| 7.44k| int r; 4425| | 4426| 7.44k| if (*state == CCS_RANGE) ------------------ | Branch (4426:7): [True: 0, False: 7.44k] ------------------ 4427| 0| return ONIGERR_CHAR_CLASS_VALUE_AT_END_OF_RANGE; ------------------ | | 654| 0|#define ONIGERR_CHAR_CLASS_VALUE_AT_END_OF_RANGE -110 ------------------ 4428| | 4429| 7.44k| if (*state == CCS_VALUE && *type != CCV_CLASS) { ------------------ | Branch (4429:7): [True: 0, False: 7.44k] | Branch (4429:30): [True: 0, False: 0] ------------------ 4430| 0| if (*type == CCV_SB) { ------------------ | Branch (4430:9): [True: 0, False: 0] ------------------ 4431| 0| BITSET_SET_BIT_CHKDUP(cc->bs, (int )(*vs)); ------------------ | | 176| 0|#define BITSET_SET_BIT_CHKDUP(bs, pos) do { \ | | 177| 0| if (BITSET_AT(bs, pos)) CC_DUP_WARN(env, pos, pos); \ | | ------------------ | | | | 448| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (448:36): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 178| 0| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | 179| 0|} while (0) | | ------------------ | | | Branch (179:10): [Folded - Ignored] | | ------------------ ------------------ 4432| 0| if (IS_NOT_NULL(asc_cc)) ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ 4433| 0| BITSET_SET_BIT(asc_cc->bs, (int )(*vs)); ------------------ | | 449| 0|#define BITSET_SET_BIT(bs, pos) BS_ROOM(bs,pos) |= BS_BIT(pos) | | ------------------ | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | #define BITSET_SET_BIT(bs, pos) BS_ROOM(bs,pos) |= BS_BIT(pos) | | ------------------ | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 4434| 0| } 4435| 0| else if (*type == CCV_CODE_POINT) { ------------------ | Branch (4435:14): [True: 0, False: 0] ------------------ 4436| 0| r = add_code_range(&(cc->mbuf), env, *vs, *vs); 4437| 0| if (r < 0) return r; ------------------ | Branch (4437:11): [True: 0, False: 0] ------------------ 4438| 0| if (IS_NOT_NULL(asc_cc)) { ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ 4439| 0| r = add_code_range0(&(asc_cc->mbuf), env, *vs, *vs, 0); 4440| 0| if (r < 0) return r; ------------------ | Branch (4440:6): [True: 0, False: 0] ------------------ 4441| 0| } 4442| 0| } 4443| 0| } 4444| | 4445| 7.44k| *state = CCS_VALUE; 4446| 7.44k| *type = CCV_CLASS; 4447| 7.44k| return 0; 4448| 7.44k|} regparse.c:is_onechar_cclass: 6078| 28.7k|{ 6079| 28.7k| const OnigCodePoint not_found = ONIG_LAST_CODE_POINT; ------------------ | | 317| 28.7k|#define ONIG_LAST_CODE_POINT (~((OnigCodePoint )0)) ------------------ 6080| 28.7k| OnigCodePoint c = not_found; 6081| 28.7k| int i; 6082| 28.7k| BBuf *bbuf = cc->mbuf; 6083| | 6084| 28.7k| if (IS_NCCLASS_NOT(cc)) return 0; ------------------ | | 809| 28.7k|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 802| 28.7k|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 799| 28.7k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | | | | Branch (802:37): [True: 11.1k, False: 17.6k] | | | | ------------------ | | ------------------ ------------------ 6085| | 6086| | /* check bbuf */ 6087| 17.6k| if (IS_NOT_NULL(bbuf)) { ------------------ | | 312| 17.6k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 17.6k] | | ------------------ ------------------ 6088| 0| OnigCodePoint n, *data; 6089| 0| GET_CODE_POINT(n, bbuf->p); ------------------ | | 710| 0|#define GET_CODE_POINT(code,p) code = *((OnigCodePoint* )(p)) ------------------ 6090| 0| data = (OnigCodePoint* )(bbuf->p) + 1; 6091| 0| if ((n == 1) && (data[0] == data[1])) { ------------------ | Branch (6091:9): [True: 0, False: 0] | Branch (6091:21): [True: 0, False: 0] ------------------ 6092| | /* only one char found in the bbuf, save the code point. */ 6093| 0| c = data[0]; 6094| 0| if (((c < SINGLE_BYTE_SIZE) && BITSET_AT(cc->bs, c))) { ------------------ | | 426| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 425| 0|#define BITS_PER_BYTE 8 | | ------------------ ------------------ if (((c < SINGLE_BYTE_SIZE) && BITSET_AT(cc->bs, c))) { ------------------ | | 448| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 445| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 446| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 427| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 425| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (448:36): [True: 0, False: 0] | | ------------------ ------------------ | Branch (6094:12): [True: 0, False: 0] ------------------ 6095| | /* skip if c is included in the bitset */ 6096| 0| c = not_found; 6097| 0| } 6098| 0| } 6099| 0| else { 6100| 0| return 0; /* the bbuf contains multiple chars */ 6101| 0| } 6102| 0| } 6103| | 6104| | /* check bitset */ 6105| 31.2k| for (i = 0; i < BITSET_SIZE; i++) { ------------------ | | 428| 31.2k|#define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM) | | ------------------ | | | | 426| 31.2k|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | | | ------------------ | | | | | | 425| 31.2k|#define BITS_PER_BYTE 8 | | | | ------------------ | | ------------------ | | #define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM) | | ------------------ | | | | 427| 31.2k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | ------------------ | | | | | | 425| 31.2k|#define BITS_PER_BYTE 8 | | | | ------------------ | | ------------------ ------------------ | Branch (6105:15): [True: 31.2k, False: 0] ------------------ 6106| 31.2k| Bits b1 = cc->bs[i]; 6107| 31.2k| if (b1 != 0) { ------------------ | Branch (6107:9): [True: 31.2k, False: 0] ------------------ 6108| 31.2k| if (((b1 & (b1 - 1)) == 0) && (c == not_found)) { ------------------ | Branch (6108:11): [True: 27.3k, False: 3.97k] | Branch (6108:37): [True: 13.6k, False: 13.6k] ------------------ 6109| 13.6k| c = BITS_IN_ROOM * i + countbits(b1 - 1); ------------------ | | 427| 13.6k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | ------------------ | | | | 425| 13.6k|#define BITS_PER_BYTE 8 | | ------------------ ------------------ 6110| 17.6k| } else { 6111| 17.6k| return 0; /* the character class contains multiple chars */ 6112| 17.6k| } 6113| 31.2k| } 6114| 31.2k| } 6115| | 6116| 0| if (c != not_found) { ------------------ | Branch (6116:7): [True: 0, False: 0] ------------------ 6117| 0| *code = c; 6118| 0| return 1; 6119| 0| } 6120| | 6121| | /* the character class contains no char. */ 6122| 0| return 0; 6123| 0|} regparse.c:countbits: 6068| 13.6k|{ 6069| 13.6k| bits = (bits & 0x55555555) + ((bits >> 1) & 0x55555555); 6070| 13.6k| bits = (bits & 0x33333333) + ((bits >> 2) & 0x33333333); 6071| 13.6k| bits = (bits & 0x0f0f0f0f) + ((bits >> 4) & 0x0f0f0f0f); 6072| 13.6k| bits = (bits & 0x00ff00ff) + ((bits >> 8) & 0x00ff00ff); 6073| 13.6k| return (bits & 0x0000ffff) + ((bits >>16) & 0x0000ffff); 6074| 13.6k|} regparse.c:node_new_anychar: 1165| 19.3k|{ 1166| 19.3k| Node* node = node_new(); 1167| 19.3k| CHECK_NULL_RETURN(node); ------------------ | | 313| 19.3k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 311| 19.3k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 19.3k] | | | | ------------------ | | ------------------ ------------------ 1168| | 1169| 19.3k| SET_NTYPE(node, NT_CANY); ------------------ | | 71| 19.3k| do { \ | | 72| 19.3k| int value = ntype; \ | | 73| 19.3k| memcpy(&((node)->u.base.type), &value, sizeof(int)); \ | | 74| 19.3k| } while (0) | | ------------------ | | | Branch (74:14): [Folded - Ignored] | | ------------------ ------------------ 1170| 19.3k| return node; 1171| 19.3k|} regparse.c:node_new_quantifier: 1305| 57.1k|{ 1306| 57.1k| Node* node = node_new(); 1307| 57.1k| CHECK_NULL_RETURN(node); ------------------ | | 313| 57.1k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 311| 57.1k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 57.1k] | | | | ------------------ | | ------------------ ------------------ 1308| | 1309| 57.1k| SET_NTYPE(node, NT_QTFR); ------------------ | | 71| 57.1k| do { \ | | 72| 57.1k| int value = ntype; \ | | 73| 57.1k| memcpy(&((node)->u.base.type), &value, sizeof(int)); \ | | 74| 57.1k| } while (0) | | ------------------ | | | Branch (74:14): [Folded - Ignored] | | ------------------ ------------------ 1310| 57.1k| NQTFR(node)->state = 0; ------------------ | | 80| 57.1k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1311| 57.1k| NQTFR(node)->target = NULL; ------------------ | | 80| 57.1k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1312| 57.1k| NQTFR(node)->lower = lower; ------------------ | | 80| 57.1k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1313| 57.1k| NQTFR(node)->upper = upper; ------------------ | | 80| 57.1k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1314| 57.1k| NQTFR(node)->greedy = 1; ------------------ | | 80| 57.1k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1315| 57.1k| NQTFR(node)->target_empty_info = NQ_TARGET_ISNOT_EMPTY; ------------------ | | 80| 57.1k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ NQTFR(node)->target_empty_info = NQ_TARGET_ISNOT_EMPTY; ------------------ | | 122| 57.1k|#define NQ_TARGET_ISNOT_EMPTY 0 ------------------ 1316| 57.1k| NQTFR(node)->head_exact = NULL_NODE; ------------------ | | 80| 57.1k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ NQTFR(node)->head_exact = NULL_NODE; ------------------ | | 283| 57.1k|#define NULL_NODE ((Node* )0) ------------------ 1317| 57.1k| NQTFR(node)->next_head_exact = NULL_NODE; ------------------ | | 80| 57.1k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ NQTFR(node)->next_head_exact = NULL_NODE; ------------------ | | 283| 57.1k|#define NULL_NODE ((Node* )0) ------------------ 1318| 57.1k| NQTFR(node)->is_referred = 0; ------------------ | | 80| 57.1k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1319| 57.1k| if (by_number != 0) ------------------ | Branch (1319:7): [True: 0, False: 57.1k] ------------------ 1320| 0| NQTFR(node)->state |= NST_BY_NUMBER; ------------------ | | 80| 0|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ NQTFR(node)->state |= NST_BY_NUMBER; ------------------ | | 142| 0|#define NST_BY_NUMBER (1<<14) /* {n,m} */ ------------------ 1321| | 1322| |#ifdef USE_COMBINATION_EXPLOSION_CHECK 1323| | NQTFR(node)->comb_exp_check_num = 0; 1324| |#endif 1325| | 1326| 57.1k| return node; 1327| 57.1k|} regparse.c:set_quantifier: 5403| 57.1k|{ 5404| 57.1k| QtfrNode* qn; 5405| | 5406| 57.1k| qn = NQTFR(qnode); ------------------ | | 80| 57.1k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 5407| 57.1k| if (qn->lower == 1 && qn->upper == 1) { ------------------ | Branch (5407:7): [True: 34.0k, False: 23.1k] | Branch (5407:25): [True: 0, False: 34.0k] ------------------ 5408| 0| return 1; 5409| 0| } 5410| | 5411| 57.1k| switch (NTYPE(target)) { ------------------ | | 69| 57.1k|#define NTYPE(node) ((node)->u.base.type) ------------------ 5412| 1.96k| case NT_STR: ------------------ | | 38| 1.96k|#define NT_STR 0 ------------------ | Branch (5412:3): [True: 1.96k, False: 55.1k] ------------------ 5413| 1.96k| if (! group) { ------------------ | Branch (5413:9): [True: 0, False: 1.96k] ------------------ 5414| 0| StrNode* sn = NSTR(target); ------------------ | | 76| 0|#define NSTR(node) (&((node)->u.str)) ------------------ 5415| 0| if (str_node_can_be_split(sn, env->enc)) { ------------------ | Branch (5415:11): [True: 0, False: 0] ------------------ 5416| 0| Node* n = str_node_split_last_char(sn, env->enc); 5417| 0| if (IS_NOT_NULL(n)) { ------------------ | | 312| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (312:39): [True: 0, False: 0] | | ------------------ ------------------ 5418| 0| qn->target = n; 5419| 0| return 2; 5420| 0| } 5421| 0| } 5422| 0| } 5423| 1.96k| break; 5424| | 5425| 1.96k| case NT_QTFR: ------------------ | | 43| 0|#define NT_QTFR 5 ------------------ | Branch (5425:3): [True: 0, False: 57.1k] ------------------ 5426| 0| { /* check redundant double repeat. */ 5427| | /* verbose warn (?:.?)? etc... but not warn (.?)? etc... */ 5428| 0| QtfrNode* qnt = NQTFR(target); ------------------ | | 80| 0|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 5429| 0| int nestq_num = popular_quantifier_num(qn); 5430| 0| int targetq_num = popular_quantifier_num(qnt); 5431| | 5432| 0|#ifdef USE_WARNING_REDUNDANT_NESTED_REPEAT_OPERATOR 5433| 0| if (nestq_num >= 0 && targetq_num >= 0 && ------------------ | Branch (5433:11): [True: 0, False: 0] | Branch (5433:29): [True: 0, False: 0] ------------------ 5434| 0| IS_SYNTAX_BV(env->syntax, ONIG_SYN_WARN_REDUNDANT_NESTED_REPEAT)) { ------------------ | | 332| 0|#define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0) | | ------------------ | | | Branch (332:35): [True: 0, False: 0] | | ------------------ ------------------ 5435| 0| switch (ReduceTypeTable[targetq_num][nestq_num]) { 5436| 0| case RQ_ASIS: ------------------ | Branch (5436:2): [True: 0, False: 0] ------------------ 5437| 0| break; 5438| | 5439| 0| case RQ_DEL: ------------------ | Branch (5439:2): [True: 0, False: 0] ------------------ 5440| 0| if (onig_warn != onig_null_warn) { ------------------ | Branch (5440:8): [True: 0, False: 0] ------------------ 5441| 0| onig_syntax_warn(env, "regular expression has redundant nested repeat operator '%s'", 5442| 0| PopularQStr[targetq_num]); 5443| 0| } 5444| 0| goto warn_exit; 5445| 0| break; 5446| | 5447| 0| default: ------------------ | Branch (5447:2): [True: 0, False: 0] ------------------ 5448| 0| if (onig_warn != onig_null_warn) { ------------------ | Branch (5448:8): [True: 0, False: 0] ------------------ 5449| 0| onig_syntax_warn(env, "nested repeat operator '%s' and '%s' was replaced with '%s' in regular expression", 5450| 0| PopularQStr[targetq_num], PopularQStr[nestq_num], 5451| 0| ReduceQStr[ReduceTypeTable[targetq_num][nestq_num]]); 5452| 0| } 5453| 0| goto warn_exit; 5454| 0| break; 5455| 0| } 5456| 0| } 5457| | 5458| 0| warn_exit: 5459| 0|#endif 5460| 0| if (targetq_num >= 0) { ------------------ | Branch (5460:11): [True: 0, False: 0] ------------------ 5461| 0| if (nestq_num >= 0) { ------------------ | Branch (5461:6): [True: 0, False: 0] ------------------ 5462| 0| onig_reduce_nested_quantifier(qnode, target); 5463| 0| goto q_exit; 5464| 0| } 5465| 0| else if (targetq_num == 1 || targetq_num == 2) { /* * or + */ ------------------ | Branch (5465:11): [True: 0, False: 0] | Branch (5465:31): [True: 0, False: 0] ------------------ 5466| | /* (?:a*){n,m}, (?:a+){n,m} => (?:a*){n,n}, (?:a+){n,n} */ 5467| 0| if (! IS_REPEAT_INFINITE(qn->upper) && qn->upper > 1 && qn->greedy) { ------------------ | | 422| 0|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 421| 0|#define REPEAT_INFINITE -1 | | ------------------ ------------------ | Branch (5467:8): [True: 0, False: 0] | Branch (5467:43): [True: 0, False: 0] | Branch (5467:60): [True: 0, False: 0] ------------------ 5468| 0| qn->upper = (qn->lower == 0 ? 1 : qn->lower); ------------------ | Branch (5468:19): [True: 0, False: 0] ------------------ 5469| 0| } 5470| 0| } 5471| 0| } 5472| 0| } 5473| 0| break; 5474| | 5475| 55.1k| default: ------------------ | Branch (5475:3): [True: 55.1k, False: 1.96k] ------------------ 5476| 55.1k| break; 5477| 57.1k| } 5478| | 5479| 57.1k| qn->target = target; 5480| 57.1k| q_exit: 5481| 57.1k| return 0; 5482| 57.1k|} regparse.c:node_new_enclose_memory: 1354| 10.0k|{ 1355| 10.0k| Node* node = node_new_enclose(ENCLOSE_MEMORY); ------------------ | | 94| 10.0k|#define ENCLOSE_MEMORY (1<<0) ------------------ 1356| 10.0k| CHECK_NULL_RETURN(node); ------------------ | | 313| 10.0k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 311| 10.0k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (311:39): [True: 0, False: 10.0k] | | | | ------------------ | | ------------------ ------------------ 1357| 10.0k| if (is_named != 0) ------------------ | Branch (1357:7): [True: 8.06k, False: 1.99k] ------------------ 1358| 8.06k| SET_ENCLOSE_STATUS(node, NST_NAMED_GROUP); ------------------ | | 144| 8.06k|#define SET_ENCLOSE_STATUS(node,f) (node)->u.enclose.state |= (f) ------------------ 1359| | 1360| 10.0k|#ifdef USE_SUBEXP_CALL 1361| 10.0k| NENCLOSE(node)->option = option; ------------------ | | 81| 10.0k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1362| 10.0k|#endif 1363| 10.0k| return node; 1364| 10.0k|} regparse.c:scan_env_set_mem_node: 1052| 10.0k|{ 1053| 10.0k| if (env->num_mem >= num) ------------------ | Branch (1053:7): [True: 10.0k, False: 0] ------------------ 1054| 10.0k| SCANENV_MEM_NODES(env)[num] = node; ------------------ | | 287| 10.0k| (IS_NOT_NULL((senv)->mem_nodes_dynamic) ? \ | | ------------------ | | | | 312| 10.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | | | ------------------ | | | | | Branch (312:39): [True: 0, False: 10.0k] | | | | ------------------ | | ------------------ | | 288| 10.0k| (senv)->mem_nodes_dynamic : (senv)->mem_nodes_static) ------------------ 1055| 0| else 1056| 0| return ONIGERR_PARSER_BUG; ------------------ | | 634| 0|#define ONIGERR_PARSER_BUG -11 ------------------ 1057| 10.0k| return 0; 1058| 10.0k|} onig_st_init_table_with_size: 582| 2.01k|{ 583| 2.01k| st_table *tab; 584| 2.01k| int n; 585| | 586| |#ifdef HASH_LOG 587| |#if HASH_LOG+0 < 0 588| | { 589| | const char *e = getenv("ST_HASH_LOG"); 590| | if (!e || !*e) init_st = 1; 591| | } 592| |#endif 593| | if (init_st == 0) { 594| | init_st = 1; 595| | atexit(stat_col); 596| | } 597| |#endif 598| | 599| 2.01k| n = get_power2(size); 600| 2.01k|#ifndef RUBY 601| 2.01k| if (n < 0) ------------------ | Branch (601:9): [True: 0, False: 2.01k] ------------------ 602| 0| return NULL; 603| 2.01k|#endif 604| 2.01k| tab = (st_table *) malloc(sizeof (st_table)); 605| 2.01k|#ifndef RUBY 606| 2.01k| if (tab == NULL) ------------------ | Branch (606:9): [True: 0, False: 2.01k] ------------------ 607| 0| return NULL; 608| 2.01k|#endif 609| 2.01k| tab->type = type; 610| 2.01k| tab->entry_power = n; 611| 2.01k| tab->bin_power = features[n].bin_power; 612| 2.01k| tab->size_ind = features[n].size_ind; 613| 2.01k| if (n <= MAX_POWER2_FOR_TABLES_WITHOUT_BINS) ------------------ | | 343| 2.01k|#define MAX_POWER2_FOR_TABLES_WITHOUT_BINS 4 ------------------ | Branch (613:9): [True: 2.01k, False: 0] ------------------ 614| 2.01k| tab->bins = NULL; 615| 0| else { 616| 0| tab->bins = (st_index_t *) malloc(bins_size(tab)); 617| 0|#ifndef RUBY 618| 0| if (tab->bins == NULL) { ------------------ | Branch (618:13): [True: 0, False: 0] ------------------ 619| 0| free(tab); 620| 0| return NULL; 621| 0| } 622| 0|#endif 623| 0| } 624| 2.01k| tab->entries = (st_table_entry *) malloc(get_allocated_entries(tab) 625| 2.01k| * sizeof(st_table_entry)); 626| 2.01k|#ifndef RUBY 627| 2.01k| if (tab->entries == NULL) { ------------------ | Branch (627:9): [True: 0, False: 2.01k] ------------------ 628| 0| st_free_table(tab); ------------------ | | 193| 0|# define st_free_table onig_st_free_table ------------------ 629| 0| return NULL; 630| 0| } 631| 2.01k|#endif 632| |#ifdef ST_DEBUG 633| | memset(tab->entries, ST_INIT_VAL_BYTE, 634| | get_allocated_entries(tab) * sizeof(st_table_entry)); 635| | if (tab->bins != NULL) 636| | memset(tab->bins, ST_INIT_VAL_BYTE, bins_size(tab)); 637| |#endif 638| 2.01k| make_tab_empty(tab); 639| 2.01k| tab->rebuilds_num = 0; 640| |#ifdef ST_DEBUG 641| | st_check(tab); 642| |#endif 643| 2.01k| return tab; 644| 2.01k|} onig_st_free_table: 716| 2.01k|{ 717| 2.01k| if (tab->bins != NULL) ------------------ | Branch (717:9): [True: 0, False: 2.01k] ------------------ 718| 0| free(tab->bins); 719| 2.01k| free(tab->entries); 720| 2.01k| free(tab); 721| 2.01k|} onig_st_lookup: 1110| 6.05k|{ 1111| 6.05k| st_index_t bin; 1112| 6.05k| st_hash_t hash = do_hash(key, tab); 1113| | 1114| 6.05k| retry: 1115| 6.05k| if (tab->bins == NULL) { ------------------ | Branch (1115:9): [True: 6.05k, False: 0] ------------------ 1116| 6.05k| bin = find_entry(tab, hash, key); 1117| 6.05k| if (EXPECT(bin == REBUILT_TABLE_ENTRY_IND, 0)) ------------------ | | 117| 6.05k|#define EXPECT(expr, val) __builtin_expect(expr, val) | | ------------------ | | | Branch (117:27): [True: 0, False: 6.05k] | | ------------------ ------------------ 1118| 0| goto retry; 1119| 6.05k| if (bin == UNDEFINED_ENTRY_IND) ------------------ | | 399| 6.05k|#define UNDEFINED_ENTRY_IND (~(st_index_t) 0) ------------------ | Branch (1119:6): [True: 6.05k, False: 0] ------------------ 1120| 6.05k| return 0; 1121| 6.05k| } 1122| 0| else { 1123| 0| bin = find_table_entry_ind(tab, hash, key); 1124| 0| if (EXPECT(bin == REBUILT_TABLE_ENTRY_IND, 0)) ------------------ | | 117| 0|#define EXPECT(expr, val) __builtin_expect(expr, val) | | ------------------ | | | Branch (117:27): [True: 0, False: 0] | | ------------------ ------------------ 1125| 0| goto retry; 1126| 0| if (bin == UNDEFINED_ENTRY_IND) ------------------ | | 399| 0|#define UNDEFINED_ENTRY_IND (~(st_index_t) 0) ------------------ | Branch (1126:6): [True: 0, False: 0] ------------------ 1127| 0| return 0; 1128| 0| bin -= ENTRY_BASE; ------------------ | | 391| 0|#define ENTRY_BASE 2 ------------------ 1129| 0| } 1130| 0| if (value != 0) ------------------ | Branch (1130:9): [True: 0, False: 0] ------------------ 1131| 0| *value = tab->entries[bin].record; 1132| 0| return 1; 1133| 6.05k|} onig_st_insert: 1182| 8.06k|{ 1183| 8.06k| st_table_entry *entry; 1184| 8.06k| st_index_t bin; 1185| 8.06k| st_index_t ind; 1186| 8.06k| st_hash_t hash_value; 1187| 8.06k| st_index_t bin_ind; 1188| 8.06k| int new_p; 1189| | 1190| 8.06k| hash_value = do_hash(key, tab); 1191| 8.06k| retry: 1192| 8.06k| rebuild_table_if_necessary(tab); 1193| 8.06k| if (tab->bins == NULL) { ------------------ | Branch (1193:9): [True: 8.06k, False: 0] ------------------ 1194| 8.06k| bin = find_entry(tab, hash_value, key); 1195| 8.06k| if (EXPECT(bin == REBUILT_TABLE_ENTRY_IND, 0)) ------------------ | | 117| 8.06k|#define EXPECT(expr, val) __builtin_expect(expr, val) | | ------------------ | | | Branch (117:27): [True: 0, False: 8.06k] | | ------------------ ------------------ 1196| 0| goto retry; 1197| 8.06k| new_p = bin == UNDEFINED_ENTRY_IND; ------------------ | | 399| 8.06k|#define UNDEFINED_ENTRY_IND (~(st_index_t) 0) ------------------ 1198| 8.06k| if (new_p) ------------------ | Branch (1198:6): [True: 8.06k, False: 0] ------------------ 1199| 8.06k| tab->num_entries++; 1200| 8.06k| bin_ind = UNDEFINED_BIN_IND; ------------------ | | 400| 8.06k|#define UNDEFINED_BIN_IND (~(st_index_t) 0) ------------------ 1201| 8.06k| } 1202| 0| else { 1203| 0| bin = find_table_bin_ptr_and_reserve(tab, &hash_value, 1204| 0| key, &bin_ind); 1205| 0| if (EXPECT(bin == REBUILT_TABLE_ENTRY_IND, 0)) ------------------ | | 117| 0|#define EXPECT(expr, val) __builtin_expect(expr, val) | | ------------------ | | | Branch (117:27): [True: 0, False: 0] | | ------------------ ------------------ 1206| 0| goto retry; 1207| 0| new_p = bin == UNDEFINED_ENTRY_IND; ------------------ | | 399| 0|#define UNDEFINED_ENTRY_IND (~(st_index_t) 0) ------------------ 1208| 0| bin -= ENTRY_BASE; ------------------ | | 391| 0|#define ENTRY_BASE 2 ------------------ 1209| 0| } 1210| 8.06k| if (new_p) { ------------------ | Branch (1210:9): [True: 8.06k, False: 0] ------------------ 1211| 8.06k| st_assert(tab->entries_bound < get_allocated_entries(tab)); ------------------ | | 128| 8.06k|#define st_assert(cond) ((void)(0 && (cond))) | | ------------------ | | | Branch (128:33): [Folded - Ignored] | | | Branch (128:38): [True: 0, False: 0] | | ------------------ ------------------ 1212| 8.06k| ind = tab->entries_bound++; 1213| 8.06k| entry = &tab->entries[ind]; 1214| 8.06k| entry->hash = hash_value; 1215| 8.06k| entry->key = key; 1216| 8.06k| entry->record = value; 1217| 8.06k| if (bin_ind != UNDEFINED_BIN_IND) ------------------ | | 400| 8.06k|#define UNDEFINED_BIN_IND (~(st_index_t) 0) ------------------ | Branch (1217:6): [True: 0, False: 8.06k] ------------------ 1218| 0| set_bin(tab->bins, get_size_ind(tab), bin_ind, ind + ENTRY_BASE); ------------------ | | 391| 0|#define ENTRY_BASE 2 ------------------ 1219| |#ifdef ST_DEBUG 1220| | st_check(tab); 1221| |#endif 1222| 8.06k| return 0; 1223| 8.06k| } 1224| 0| tab->entries[bin].record = value; 1225| |#ifdef ST_DEBUG 1226| | st_check(tab); 1227| |#endif 1228| 0| return 1; 1229| 8.06k|} onig_st_foreach: 1723| 2.01k|{ 1724| 2.01k| return st_general_foreach(tab, func, NULL, arg, FALSE); ------------------ | | 77| 2.01k|# define FALSE 0 ------------------ 1725| 2.01k|} st.c:get_power2: 348| 2.01k|{ 349| 2.01k| unsigned int n; 350| | 351| 8.06k| for (n = 0; size != 0; n++) ------------------ | Branch (351:17): [True: 6.05k, False: 2.01k] ------------------ 352| 6.05k| size >>= 1; 353| 2.01k| if (n <= MAX_POWER2) ------------------ | | 210| 2.01k|#define MAX_POWER2 62 ------------------ | Branch (353:9): [True: 2.01k, False: 0] ------------------ 354| 2.01k| return n < MINIMAL_POWER2 ? MINIMAL_POWER2 : n; ------------------ | | 335| 2.01k|#define MINIMAL_POWER2 2 ------------------ return n < MINIMAL_POWER2 ? MINIMAL_POWER2 : n; ------------------ | | 335| 0|#define MINIMAL_POWER2 2 ------------------ | Branch (354:16): [True: 0, False: 2.01k] ------------------ 355| |#ifdef RUBY 356| | /* Ran out of the table entries */ 357| | rb_raise(rb_eRuntimeError, "st_table too big"); 358| |#endif 359| | /* should raise exception */ 360| 0| return -1; 361| 2.01k|} st.c:get_allocated_entries: 466| 10.0k|{ 467| 10.0k| return ((st_index_t) 1)<entry_power; 468| 10.0k|} st.c:make_tab_empty: 487| 2.01k|{ 488| 2.01k| tab->num_entries = 0; 489| 2.01k| tab->entries_start = tab->entries_bound = 0; 490| 2.01k| if (tab->bins != NULL) ------------------ | Branch (490:9): [True: 0, False: 2.01k] ------------------ 491| 0| initialize_bins(tab); 492| 2.01k|} st.c:do_hash: 326| 14.1k|{ 327| 14.1k| st_hash_t hash = (st_hash_t)(tab->type->hash)(key); 328| | 329| | /* RESERVED_HASH_VAL is used for a deleted entry. Map it into 330| | another value. Such mapping should be extremely rare. */ 331| 14.1k| return hash == RESERVED_HASH_VAL ? RESERVED_HASH_SUBSTITUTION_VAL : hash; ------------------ | | 317| 14.1k|#define RESERVED_HASH_VAL (~(st_hash_t) 0) ------------------ return hash == RESERVED_HASH_VAL ? RESERVED_HASH_SUBSTITUTION_VAL : hash; ------------------ | | 318| 0|#define RESERVED_HASH_SUBSTITUTION_VAL ((st_hash_t) 0) ------------------ | Branch (331:12): [True: 0, False: 14.1k] ------------------ 332| 14.1k|} st.c:find_entry: 881| 22.1k|{ 882| 22.1k| int eq_p, rebuilt_p; 883| 22.1k| st_index_t i, bound; 884| 22.1k| st_table_entry *entries; 885| | 886| 22.1k| bound = tab->entries_bound; 887| 22.1k| entries = tab->entries; 888| 46.3k| for (i = tab->entries_start; i < bound; i++) { ------------------ | Branch (888:34): [True: 32.2k, False: 14.1k] ------------------ 889| 32.2k| DO_PTR_EQUAL_CHECK(tab, &entries[i], hash_value, key, eq_p, rebuilt_p); ------------------ | | 187| 32.2k| do { \ | | 188| 32.2k| unsigned int _old_rebuilds_num = (tab)->rebuilds_num; \ | | 189| 32.2k| res = PTR_EQUAL(tab, ptr, hash_val, key); \ | | ------------------ | | | | 182| 32.2k| ((ptr)->hash == (hash_val) && EQUAL((tab), (key_), (ptr)->key)) | | | | ------------------ | | | | | | 180| 8.06k|#define EQUAL(tab,x,y) ((x) == (y) || (*(tab)->type->compare)((x),(y)) == 0) | | | | | | ------------------ | | | | | | | Branch (180:25): [True: 8.06k, False: 0] | | | | | | | Branch (180:39): [True: 0, False: 0] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (182:6): [True: 8.06k, False: 24.2k] | | | | ------------------ | | ------------------ | | 190| 32.2k| rebuilt_p = _old_rebuilds_num != (tab)->rebuilds_num; \ | | 191| 32.2k| } while (FALSE) | | ------------------ | | | | 77| 32.2k|# define FALSE 0 | | | | ------------------ | | | | | Branch (77:18): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 890| 32.2k| if (EXPECT(rebuilt_p, 0)) ------------------ | | 117| 32.2k|#define EXPECT(expr, val) __builtin_expect(expr, val) | | ------------------ | | | Branch (117:27): [True: 0, False: 32.2k] | | ------------------ ------------------ 891| 0| return REBUILT_TABLE_ENTRY_IND; ------------------ | | 404| 0|#define REBUILT_TABLE_ENTRY_IND (~(st_index_t) 1) ------------------ 892| 32.2k| if (eq_p) ------------------ | Branch (892:6): [True: 8.06k, False: 24.2k] ------------------ 893| 8.06k| return i; 894| 32.2k| } 895| 14.1k| return UNDEFINED_ENTRY_IND; ------------------ | | 399| 14.1k|#define UNDEFINED_ENTRY_IND (~(st_index_t) 0) ------------------ 896| 22.1k|} st.c:rebuild_table_if_necessary: 1169| 8.06k|{ 1170| 8.06k| st_index_t bound = tab->entries_bound; 1171| | 1172| 8.06k| if (bound == get_allocated_entries(tab)) ------------------ | Branch (1172:9): [True: 0, False: 8.06k] ------------------ 1173| 0| rebuild_table(tab); 1174| 8.06k| st_assert(tab->entries_bound < get_allocated_entries(tab)); ------------------ | | 128| 8.06k|#define st_assert(cond) ((void)(0 && (cond))) | | ------------------ | | | Branch (128:33): [Folded - Ignored] | | | Branch (128:38): [True: 0, False: 0] | | ------------------ ------------------ 1175| 8.06k|} st.c:st_general_foreach: 1605| 2.01k|{ 1606| 2.01k| st_index_t bin; 1607| 2.01k| st_index_t bin_ind; 1608| 2.01k| st_table_entry *entries, *curr_entry_ptr; 1609| 2.01k| enum st_retval retval; 1610| 2.01k| st_index_t i, rebuilds_num; 1611| 2.01k| st_hash_t hash; 1612| 2.01k| st_data_t key; 1613| 2.01k| int error_p, packed_p = tab->bins == NULL; 1614| | 1615| 2.01k| st_assert(tab->entries_start <= tab->entries_bound); ------------------ | | 128| 2.01k|#define st_assert(cond) ((void)(0 && (cond))) | | ------------------ | | | Branch (128:33): [Folded - Ignored] | | | Branch (128:38): [True: 0, False: 0] | | ------------------ ------------------ 1616| 2.01k| entries = tab->entries; 1617| | /* The bound can change inside the loop even without rebuilding 1618| | the table, e.g. by an entry inesrtion. */ 1619| 10.0k| for (i = tab->entries_start; i < tab->entries_bound; i++) { ------------------ | Branch (1619:34): [True: 8.06k, False: 2.01k] ------------------ 1620| 8.06k| curr_entry_ptr = &entries[i]; 1621| 8.06k| if (EXPECT(DELETED_ENTRY_P(curr_entry_ptr), 0)) ------------------ | | 117| 8.06k|#define EXPECT(expr, val) __builtin_expect(expr, val) | | ------------------ | | | Branch (117:27): [True: 0, False: 8.06k] | | ------------------ ------------------ 1622| 0| continue; 1623| 8.06k| key = curr_entry_ptr->key; 1624| 8.06k| rebuilds_num = tab->rebuilds_num; 1625| 8.06k| hash = curr_entry_ptr->hash; 1626| 8.06k| retval = (*func)(key, curr_entry_ptr->record, arg, 0); 1627| | 1628| 8.06k| if (retval == ST_REPLACE && replace) { ------------------ | Branch (1628:13): [True: 0, False: 8.06k] | Branch (1628:37): [True: 0, False: 0] ------------------ 1629| 0| st_data_t value; 1630| 0| value = curr_entry_ptr->record; 1631| 0| retval = (*replace)(&key, &value, arg, TRUE); ------------------ | | 73| 0|# define TRUE 1 ------------------ 1632| 0| curr_entry_ptr->key = key; 1633| 0| curr_entry_ptr->record = value; 1634| 0| } 1635| | 1636| 8.06k| if (rebuilds_num != tab->rebuilds_num) { ------------------ | Branch (1636:6): [True: 0, False: 8.06k] ------------------ 1637| 0| retry: 1638| 0| entries = tab->entries; 1639| 0| packed_p = tab->bins == NULL; 1640| 0| if (packed_p) { ------------------ | Branch (1640:10): [True: 0, False: 0] ------------------ 1641| 0| i = find_entry(tab, hash, key); 1642| 0| if (EXPECT(i == REBUILT_TABLE_ENTRY_IND, 0)) ------------------ | | 117| 0|#define EXPECT(expr, val) __builtin_expect(expr, val) | | ------------------ | | | Branch (117:27): [True: 0, False: 0] | | ------------------ ------------------ 1643| 0| goto retry; 1644| 0| error_p = i == UNDEFINED_ENTRY_IND; ------------------ | | 399| 0|#define UNDEFINED_ENTRY_IND (~(st_index_t) 0) ------------------ 1645| 0| } 1646| 0| else { 1647| 0| i = find_table_entry_ind(tab, hash, key); 1648| 0| if (EXPECT(i == REBUILT_TABLE_ENTRY_IND, 0)) ------------------ | | 117| 0|#define EXPECT(expr, val) __builtin_expect(expr, val) | | ------------------ | | | Branch (117:27): [True: 0, False: 0] | | ------------------ ------------------ 1649| 0| goto retry; 1650| 0| error_p = i == UNDEFINED_ENTRY_IND; ------------------ | | 399| 0|#define UNDEFINED_ENTRY_IND (~(st_index_t) 0) ------------------ 1651| 0| i -= ENTRY_BASE; ------------------ | | 391| 0|#define ENTRY_BASE 2 ------------------ 1652| 0| } 1653| 0| if (error_p && check_p) { ------------------ | Branch (1653:10): [True: 0, False: 0] | Branch (1653:21): [True: 0, False: 0] ------------------ 1654| | /* call func with error notice */ 1655| 0| retval = (*func)(0, 0, arg, 1); 1656| |#ifdef ST_DEBUG 1657| | st_check(tab); 1658| |#endif 1659| 0| return 1; 1660| 0| } 1661| 0| curr_entry_ptr = &entries[i]; 1662| 0| } 1663| 8.06k| switch (retval) { ------------------ | Branch (1663:10): [True: 0, False: 8.06k] ------------------ 1664| 0| case ST_REPLACE: ------------------ | Branch (1664:11): [True: 0, False: 8.06k] ------------------ 1665| 0| break; 1666| 0| case ST_CONTINUE: ------------------ | Branch (1666:4): [True: 0, False: 8.06k] ------------------ 1667| 0| break; 1668| 0| case ST_CHECK: ------------------ | Branch (1668:4): [True: 0, False: 8.06k] ------------------ 1669| 0| if (check_p) ------------------ | Branch (1669:10): [True: 0, False: 0] ------------------ 1670| 0| break; 1671| 0| case ST_STOP: ------------------ | Branch (1671:4): [True: 0, False: 8.06k] ------------------ 1672| |#ifdef ST_DEBUG 1673| | st_check(tab); 1674| |#endif 1675| 0| return 0; 1676| 8.06k| case ST_DELETE: { ------------------ | Branch (1676:4): [True: 8.06k, False: 0] ------------------ 1677| 8.06k| st_data_t key = curr_entry_ptr->key; 1678| | 1679| 8.06k| again: 1680| 8.06k| if (packed_p) { ------------------ | Branch (1680:10): [True: 8.06k, False: 0] ------------------ 1681| 8.06k| bin = find_entry(tab, hash, key); 1682| 8.06k| if (EXPECT(bin == REBUILT_TABLE_ENTRY_IND, 0)) ------------------ | | 117| 8.06k|#define EXPECT(expr, val) __builtin_expect(expr, val) | | ------------------ | | | Branch (117:27): [True: 0, False: 8.06k] | | ------------------ ------------------ 1683| 0| goto again; 1684| 8.06k| if (bin == UNDEFINED_ENTRY_IND) ------------------ | | 399| 8.06k|#define UNDEFINED_ENTRY_IND (~(st_index_t) 0) ------------------ | Branch (1684:7): [True: 0, False: 8.06k] ------------------ 1685| 0| break; 1686| 8.06k| } 1687| 0| else { 1688| 0| bin_ind = find_table_bin_ind(tab, hash, key); 1689| 0| if (EXPECT(bin_ind == REBUILT_TABLE_BIN_IND, 0)) ------------------ | | 117| 0|#define EXPECT(expr, val) __builtin_expect(expr, val) | | ------------------ | | | Branch (117:27): [True: 0, False: 0] | | ------------------ ------------------ 1690| 0| goto again; 1691| 0| if (bin_ind == UNDEFINED_BIN_IND) ------------------ | | 400| 0|#define UNDEFINED_BIN_IND (~(st_index_t) 0) ------------------ | Branch (1691:7): [True: 0, False: 0] ------------------ 1692| 0| break; 1693| 0| bin = get_bin(tab->bins, get_size_ind(tab), bin_ind) - ENTRY_BASE; ------------------ | | 391| 0|#define ENTRY_BASE 2 ------------------ 1694| 0| MARK_BIN_DELETED(tab, bin_ind); ------------------ | | 411| 0| do { \ | | 412| 0| st_assert(i != UNDEFINED_BIN_IND); \ | | ------------------ | | | | 128| 0|#define st_assert(cond) ((void)(0 && (cond))) | | | | ------------------ | | | | | Branch (128:33): [Folded - Ignored] | | | | | Branch (128:38): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 413| 0| st_assert(! IND_EMPTY_OR_DELETED_BIN_P(tab, i)); \ | | ------------------ | | | | 128| 0|#define st_assert(cond) ((void)(0 && (cond))) | | | | ------------------ | | | | | Branch (128:33): [Folded - Ignored] | | | | | Branch (128:38): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 414| 0| set_bin((tab)->bins, get_size_ind(tab), i, DELETED_BIN); \ | | ------------------ | | | | 389| 0|#define DELETED_BIN 1 | | ------------------ | | 415| 0| } while (0) | | ------------------ | | | Branch (415:14): [Folded - Ignored] | | ------------------ ------------------ 1695| 0| } 1696| 8.06k| curr_entry_ptr = &entries[bin]; 1697| 8.06k| MARK_ENTRY_DELETED(curr_entry_ptr); ------------------ | | 431| 8.06k|#define MARK_ENTRY_DELETED(e_ptr) ((e_ptr)->hash = RESERVED_HASH_VAL) | | ------------------ | | | | 317| 8.06k|#define RESERVED_HASH_VAL (~(st_hash_t) 0) | | ------------------ ------------------ 1698| 8.06k| tab->num_entries--; 1699| 8.06k| update_range_for_deleted(tab, bin); 1700| |#ifdef ST_DEBUG 1701| | st_check(tab); 1702| |#endif 1703| 8.06k| break; 1704| 8.06k| } 1705| 8.06k| } 1706| 8.06k| } 1707| |#ifdef ST_DEBUG 1708| | st_check(tab); 1709| |#endif 1710| 2.01k| return 0; 1711| 2.01k|} st.c:update_range_for_deleted: 1375| 8.06k|{ 1376| | /* Do not update entries_bound here. Otherwise, we can fill all 1377| | bins by deleted entry value before rebuilding the table. */ 1378| 8.06k| if (tab->entries_start == n) ------------------ | Branch (1378:9): [True: 8.06k, False: 0] ------------------ 1379| 8.06k| tab->entries_start = n + 1; 1380| 8.06k|} flb_cf_create: 38| 2.05k|{ 39| 2.05k| struct flb_cf *ctx; 40| | 41| 2.05k| ctx = flb_calloc(1, sizeof(struct flb_cf)); 42| 2.05k| if (!ctx) { ------------------ | Branch (42:9): [True: 2, False: 2.04k] ------------------ 43| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 44| 2| return NULL; 45| 2| } 46| | 47| | /* env vars */ 48| 2.04k| mk_list_init(&ctx->env); 49| | 50| | /* meta commands */ 51| 2.04k| mk_list_init(&ctx->metas); 52| | 53| | /* parsers */ 54| 2.04k| mk_list_init(&ctx->parsers); 55| 2.04k| mk_list_init(&ctx->multiline_parsers); 56| | 57| | /* custom plugins */ 58| 2.04k| mk_list_init(&ctx->customs); 59| | 60| | /* pipeline */ 61| 2.04k| mk_list_init(&ctx->inputs); 62| 2.04k| mk_list_init(&ctx->filters); 63| 2.04k| mk_list_init(&ctx->outputs); 64| | 65| | /* other sections */ 66| 2.04k| mk_list_init(&ctx->others); 67| | 68| | /* general list for sections */ 69| 2.04k| mk_list_init(&ctx->sections); 70| | 71| 2.04k| return ctx; 72| 2.05k|} flb_cf_destroy: 75| 2.04k|{ 76| 2.04k| flb_kv_release(&cf->env); 77| 2.04k| flb_kv_release(&cf->metas); 78| 2.04k| flb_cf_section_destroy_all(cf); 79| 2.04k| flb_free(cf); 80| 2.04k|} flb_cf_section_create: 480| 2.04k|{ 481| 2.04k| int type; 482| 2.04k| struct flb_cf_section *s; 483| | 484| 2.04k| if (!name) { ------------------ | Branch (484:9): [True: 0, False: 2.04k] ------------------ 485| 0| return NULL; 486| 0| } 487| | 488| | /* determinate type by name */ 489| 2.04k| if (len <= 0) { ------------------ | Branch (489:9): [True: 2.04k, False: 0] ------------------ 490| 2.04k| len = strlen(name); 491| 2.04k| } 492| | 493| | /* get the section type */ 494| 2.04k| type = get_section_type(name, len); 495| | 496| | /* check if 'service' already exists */ 497| 2.04k| if (type == FLB_CF_SERVICE && cf->service) { ------------------ | Branch (497:9): [True: 2.04k, False: 0] | Branch (497:35): [True: 0, False: 2.04k] ------------------ 498| 0| return cf->service; 499| 0| } 500| | 501| | /* section context */ 502| 2.04k| s = flb_malloc(sizeof(struct flb_cf_section)); 503| 2.04k| if (!s) { ------------------ | Branch (503:9): [True: 3, False: 2.04k] ------------------ 504| 3| flb_errno(); ------------------ | | 201| 3|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 505| 3| return NULL; 506| 3| } 507| | 508| | /* initialize lists */ 509| 2.04k| s->properties = cfl_kvlist_create(); 510| 2.04k| mk_list_init(&s->groups); 511| | 512| | /* create a NULL terminated name */ 513| 2.04k| s->name = flb_sds_create_len(name, len); 514| 2.04k| if (!s->name) { ------------------ | Branch (514:9): [True: 1, False: 2.04k] ------------------ 515| 1| flb_free(s->properties); 516| 1| flb_free(s); 517| 1| return NULL; 518| 1| } 519| 2.04k| s->type = type; 520| | 521| 2.04k| if (type == FLB_CF_SERVICE && !cf->service) { ------------------ | Branch (521:9): [True: 2.04k, False: 0] | Branch (521:35): [True: 2.04k, False: 0] ------------------ 522| 2.04k| cf->service = s; 523| 2.04k| } 524| | 525| | /* link to global section */ 526| 2.04k| mk_list_add(&s->_head, &cf->sections); 527| | 528| | /* link to list per type */ 529| 2.04k| if (type == FLB_CF_PARSER) { ------------------ | Branch (529:9): [True: 0, False: 2.04k] ------------------ 530| 0| mk_list_add(&s->_head_section, &cf->parsers); 531| 0| } 532| 2.04k| else if (type == FLB_CF_MULTILINE_PARSER) { ------------------ | Branch (532:14): [True: 0, False: 2.04k] ------------------ 533| 0| mk_list_add(&s->_head_section, &cf->multiline_parsers); 534| 0| } 535| 2.04k| else if (type == FLB_CF_CUSTOM) { ------------------ | Branch (535:14): [True: 0, False: 2.04k] ------------------ 536| 0| mk_list_add(&s->_head_section, &cf->customs); 537| 0| } 538| 2.04k| else if (type == FLB_CF_INPUT) { ------------------ | Branch (538:14): [True: 0, False: 2.04k] ------------------ 539| 0| mk_list_add(&s->_head_section, &cf->inputs); 540| 0| } 541| 2.04k| else if (type == FLB_CF_FILTER) { ------------------ | Branch (541:14): [True: 0, False: 2.04k] ------------------ 542| 0| mk_list_add(&s->_head_section, &cf->filters); 543| 0| } 544| 2.04k| else if (type == FLB_CF_OUTPUT) { ------------------ | Branch (544:14): [True: 0, False: 2.04k] ------------------ 545| 0| mk_list_add(&s->_head_section, &cf->outputs); 546| 0| } 547| 2.04k| else if (type == FLB_CF_OTHER) { ------------------ | Branch (547:14): [True: 0, False: 2.04k] ------------------ 548| 0| mk_list_add(&s->_head_section, &cf->others); 549| 0| } 550| | 551| 2.04k| return s; 552| 2.04k|} flb_cf_section_destroy: 571| 2.04k|{ 572| 2.04k| struct mk_list *tmp; 573| 2.04k| struct mk_list *head; 574| 2.04k| struct flb_cf_group *g; 575| | 576| 2.04k| if (s->name) { ------------------ | Branch (576:9): [True: 2.04k, False: 0] ------------------ 577| 2.04k| flb_sds_destroy(s->name); 578| 2.04k| s->name = NULL; 579| 2.04k| } 580| 2.04k| cfl_kvlist_destroy(s->properties); 581| | 582| | /* groups */ 583| 2.04k| mk_list_foreach_safe(head, tmp, &s->groups) { ------------------ | | 207| 2.04k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 0, False: 2.04k] | | ------------------ ------------------ 584| 0| g = mk_list_entry(head, struct flb_cf_group, _head); ------------------ | | 214| 0|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 0|#define container_of(ptr, type, member) ({ \ | | | | 39| 0| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 0| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 585| 0| flb_cf_group_destroy(g); 586| 0| } 587| | 588| | /* unlink */ 589| 2.04k| mk_list_del(&s->_head); 590| | 591| 2.04k| if (s->type != FLB_CF_SERVICE) { ------------------ | Branch (591:9): [True: 0, False: 2.04k] ------------------ 592| 0| mk_list_del(&s->_head_section); 593| 0| } 594| | 595| 2.04k| flb_free(s); 596| 2.04k|} flb_cf_section_destroy_all: 611| 2.04k|{ 612| 2.04k| section_destroy_list(cf, &cf->sections); 613| 2.04k|} flb_config_format.c:get_section_type: 83| 2.04k|{ 84| 2.04k| if (strncasecmp(name, "SERVICE", len) == 0) { ------------------ | Branch (84:9): [True: 2.04k, False: 0] ------------------ 85| 2.04k| return FLB_CF_SERVICE; 86| 2.04k| } 87| 0| else if (strncasecmp(name, "PARSER", len) == 0) { ------------------ | Branch (87:14): [True: 0, False: 0] ------------------ 88| 0| return FLB_CF_PARSER; 89| 0| } 90| 0| else if (strncasecmp(name, "MULTILINE_PARSER", len) == 0) { ------------------ | Branch (90:14): [True: 0, False: 0] ------------------ 91| 0| return FLB_CF_MULTILINE_PARSER; 92| 0| } 93| 0| else if (strncasecmp(name, "CUSTOM", len) == 0 || ------------------ | Branch (93:14): [True: 0, False: 0] ------------------ 94| 0| strncasecmp(name, "CUSTOMS", len) == 0) { ------------------ | Branch (94:14): [True: 0, False: 0] ------------------ 95| 0| return FLB_CF_CUSTOM; 96| 0| } 97| 0| else if (strncasecmp(name, "INPUT", len) == 0 || ------------------ | Branch (97:14): [True: 0, False: 0] ------------------ 98| 0| strncasecmp(name, "INPUTS", len) == 0) { ------------------ | Branch (98:14): [True: 0, False: 0] ------------------ 99| 0| return FLB_CF_INPUT; 100| 0| } 101| 0| else if (strncasecmp(name, "FILTER", len) == 0 || ------------------ | Branch (101:14): [True: 0, False: 0] ------------------ 102| 0| strncasecmp(name, "FILTERS", len) == 0) { ------------------ | Branch (102:14): [True: 0, False: 0] ------------------ 103| 0| return FLB_CF_FILTER; 104| 0| } 105| 0| else if (strncasecmp(name, "OUTPUT", len) == 0 || ------------------ | Branch (105:14): [True: 0, False: 0] ------------------ 106| 0| strncasecmp(name, "OUTPUTS", len) == 0) { ------------------ | Branch (106:14): [True: 0, False: 0] ------------------ 107| 0| return FLB_CF_OUTPUT; 108| 0| } 109| | 110| 0| return FLB_CF_OTHER; 111| 2.04k|} flb_config_format.c:section_destroy_list: 599| 2.04k|{ 600| 2.04k| struct mk_list *tmp; 601| 2.04k| struct mk_list *head; 602| 2.04k| struct flb_cf_section *s; 603| | 604| 2.04k| mk_list_foreach_safe(head, tmp, list) { ------------------ | | 207| 4.09k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 2.04k, False: 2.04k] | | ------------------ ------------------ 605| 2.04k| s = mk_list_entry(head, struct flb_cf_section, _head); ------------------ | | 214| 2.04k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 2.04k|#define container_of(ptr, type, member) ({ \ | | | | 39| 2.04k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 2.04k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 606| 2.04k| flb_cf_section_destroy(cf, s); 607| 2.04k| } 608| 2.04k|} flb_config_init: 180| 2.06k|{ 181| 2.06k| int ret; 182| 2.06k| struct flb_config *config; 183| 2.06k| struct flb_cf *cf; 184| 2.06k| struct flb_cf_section *section; 185| | 186| 2.06k| config = flb_calloc(1, sizeof(struct flb_config)); 187| 2.06k| if (!config) { ------------------ | Branch (187:9): [True: 10, False: 2.05k] ------------------ 188| 10| flb_errno(); ------------------ | | 201| 10|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 189| 10| return NULL; 190| 10| } 191| | 192| 2.05k| MK_EVENT_ZERO(&config->ch_event); 193| 2.05k| MK_EVENT_ZERO(&config->event_flush); 194| 2.05k| MK_EVENT_ZERO(&config->event_shutdown); 195| | 196| | /* is data ingestion active ? */ 197| 2.05k| config->is_ingestion_active = FLB_TRUE; ------------------ | | 26| 2.05k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 2.05k|#define FLB_FALSE 0 | | ------------------ ------------------ 198| | 199| | /* Is the engine (event loop) actively running ? */ 200| 2.05k| config->is_running = FLB_TRUE; ------------------ | | 26| 2.05k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 2.05k|#define FLB_FALSE 0 | | ------------------ ------------------ 201| | 202| | /* Initialize config_format context */ 203| 2.05k| cf = flb_cf_create(); 204| 2.05k| if (!cf) { ------------------ | Branch (204:9): [True: 2, False: 2.04k] ------------------ 205| 2| flb_free(config); 206| 2| return NULL; 207| 2| } 208| 2.04k| config->cf_main = cf; 209| | 210| 2.04k| section = flb_cf_section_create(cf, "service", 0); 211| 2.04k| if (!section) { ------------------ | Branch (211:9): [True: 4, False: 2.04k] ------------------ 212| 4| flb_cf_destroy(cf); 213| 4| flb_free(config); 214| 4| return NULL; 215| 4| } 216| | 217| | /* Flush */ 218| 2.04k| config->flush = FLB_CONFIG_FLUSH_SECS; ------------------ | | 33| 2.04k|#define FLB_CONFIG_FLUSH_SECS 1 ------------------ 219| 2.04k| config->daemon = FLB_FALSE; ------------------ | | 25| 2.04k|#define FLB_FALSE 0 ------------------ 220| 2.04k| config->init_time = time(NULL); 221| 2.04k| config->kernel = flb_kernel_info(); 222| 2.04k| config->verbose = 3; 223| 2.04k| config->grace = 5; 224| 2.04k| config->grace_count = 0; 225| 2.04k| config->exit_status_code = 0; 226| | 227| | /* json */ 228| 2.04k| config->convert_nan_to_null = FLB_FALSE; ------------------ | | 25| 2.04k|#define FLB_FALSE 0 ------------------ 229| | 230| 2.04k|#ifdef FLB_HAVE_HTTP_SERVER 231| 2.04k| config->http_ctx = NULL; 232| 2.04k| config->http_server = FLB_FALSE; ------------------ | | 25| 2.04k|#define FLB_FALSE 0 ------------------ 233| 2.04k| config->http_listen = flb_strdup(FLB_CONFIG_HTTP_LISTEN); ------------------ | | 34| 2.04k|#define FLB_CONFIG_HTTP_LISTEN "0.0.0.0" ------------------ 234| 2.04k| config->http_port = flb_strdup(FLB_CONFIG_HTTP_PORT); ------------------ | | 35| 2.04k|#define FLB_CONFIG_HTTP_PORT "2020" ------------------ 235| 2.04k| config->health_check = FLB_FALSE; ------------------ | | 25| 2.04k|#define FLB_FALSE 0 ------------------ 236| 2.04k| config->hc_errors_count = HC_ERRORS_COUNT_DEFAULT; ------------------ | | 36| 2.04k|#define HC_ERRORS_COUNT_DEFAULT 5 ------------------ 237| 2.04k| config->hc_retry_failure_count = HC_RETRY_FAILURE_COUNTS_DEFAULT; ------------------ | | 37| 2.04k|#define HC_RETRY_FAILURE_COUNTS_DEFAULT 5 ------------------ 238| 2.04k| config->health_check_period = HEALTH_CHECK_PERIOD; ------------------ | | 38| 2.04k|#define HEALTH_CHECK_PERIOD 60 ------------------ 239| 2.04k|#endif 240| | 241| 2.04k| config->http_proxy = getenv("HTTP_PROXY"); 242| 2.04k| if (flb_str_emptyval(config->http_proxy) == FLB_TRUE) { ------------------ | | 26| 2.04k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 2.04k|#define FLB_FALSE 0 | | ------------------ ------------------ | Branch (242:9): [True: 0, False: 2.04k] ------------------ 243| 0| config->http_proxy = getenv("http_proxy"); 244| 0| if (flb_str_emptyval(config->http_proxy) == FLB_TRUE) { ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ | Branch (244:13): [True: 0, False: 0] ------------------ 245| | /* Proxy should not be set when `HTTP_PROXY` or `http_proxy` are set to "" */ 246| 0| config->http_proxy = NULL; 247| 0| } 248| 0| } 249| 2.04k| config->no_proxy = getenv("NO_PROXY"); 250| 2.04k| if (flb_str_emptyval(config->no_proxy) == FLB_TRUE || config->http_proxy == NULL) { ------------------ | | 26| 4.08k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 4.08k|#define FLB_FALSE 0 | | ------------------ ------------------ | Branch (250:9): [True: 0, False: 2.04k] | Branch (250:59): [True: 2.04k, False: 0] ------------------ 251| 2.04k| config->no_proxy = getenv("no_proxy"); 252| 2.04k| if (flb_str_emptyval(config->no_proxy) == FLB_TRUE || config->http_proxy == NULL) { ------------------ | | 26| 4.08k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 4.08k|#define FLB_FALSE 0 | | ------------------ ------------------ | Branch (252:13): [True: 0, False: 2.04k] | Branch (252:63): [True: 2.04k, False: 0] ------------------ 253| | /* NoProxy should not be set when `NO_PROXY` or `no_proxy` are set to "" or there is no Proxy. */ 254| 2.04k| config->no_proxy = NULL; 255| 2.04k| } 256| 2.04k| } 257| | 258| 2.04k| config->cio = NULL; 259| 2.04k| config->storage_path = NULL; 260| 2.04k| config->storage_input_plugin = NULL; 261| 2.04k| config->storage_metrics = FLB_TRUE; ------------------ | | 26| 2.04k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 2.04k|#define FLB_FALSE 0 | | ------------------ ------------------ 262| | 263| 2.04k| config->sched_cap = FLB_SCHED_CAP; ------------------ | | 29| 2.04k|#define FLB_SCHED_CAP 2000 ------------------ 264| 2.04k| config->sched_base = FLB_SCHED_BASE; ------------------ | | 30| 2.04k|#define FLB_SCHED_BASE 5 ------------------ 265| | 266| 2.04k|#ifdef FLB_HAVE_SQLDB 267| 2.04k| mk_list_init(&config->sqldb_list); 268| 2.04k|#endif 269| | 270| |#ifdef FLB_HAVE_LUAJIT 271| | mk_list_init(&config->luajit_list); 272| |#endif 273| | 274| |#ifdef FLB_HAVE_STREAM_PROCESSOR 275| | flb_slist_create(&config->stream_processor_tasks); 276| |#endif 277| | 278| | /* Set default coroutines stack size */ 279| 2.04k| config->coro_stack_size = FLB_CORO_STACK_SIZE_BYTE; ------------------ | | 67| 2.04k|#define FLB_CORO_STACK_SIZE_BYTE ((3 * PTHREAD_STACK_MIN) / 2) ------------------ 280| 2.04k| if (config->coro_stack_size < getpagesize()) { ------------------ | Branch (280:9): [True: 0, False: 2.04k] ------------------ 281| 0| flb_info("[config] changing coro_stack_size from %u to %u bytes", ------------------ | | 158| 0| if (flb_log_check(FLB_LOG_INFO)) \ | | ------------------ | | | | 41| 0|#define FLB_LOG_INFO 3 /* default */ | | ------------------ | | | Branch (158:9): [True: 0, False: 0] | | ------------------ | | 159| 0| flb_log_print(FLB_LOG_INFO, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 41| 0|#define FLB_LOG_INFO 3 /* default */ | | ------------------ ------------------ 282| 0| config->coro_stack_size, getpagesize()); 283| 0| config->coro_stack_size = (unsigned int)getpagesize(); 284| 0| } 285| | 286| | /* collectors */ 287| 2.04k| pthread_mutex_init(&config->collectors_mutex, NULL); 288| | 289| | /* Initialize linked lists */ 290| 2.04k| mk_list_init(&config->custom_plugins); 291| 2.04k| mk_list_init(&config->custom_plugins); 292| 2.04k| mk_list_init(&config->in_plugins); 293| 2.04k| mk_list_init(&config->parser_plugins); 294| 2.04k| mk_list_init(&config->filter_plugins); 295| 2.04k| mk_list_init(&config->out_plugins); 296| 2.04k| mk_list_init(&config->customs); 297| 2.04k| mk_list_init(&config->inputs); 298| 2.04k| mk_list_init(&config->parsers); 299| 2.04k| mk_list_init(&config->filters); 300| 2.04k| mk_list_init(&config->outputs); 301| 2.04k| mk_list_init(&config->proxies); 302| 2.04k| mk_list_init(&config->workers); 303| 2.04k| mk_list_init(&config->upstreams); 304| 2.04k| mk_list_init(&config->downstreams); 305| 2.04k| mk_list_init(&config->cmetrics); 306| 2.04k| mk_list_init(&config->cf_parsers_list); 307| | 308| 2.04k| memset(&config->tasks_map, '\0', sizeof(config->tasks_map)); 309| | 310| | /* Initialize multiline-parser list. We need this here, because from now 311| | * on we use flb_config_exit to cleanup the config, which requires 312| | * the config->multiline_parsers list to be initialized. */ 313| 2.04k| mk_list_init(&config->multiline_parsers); 314| | 315| | /* Environment */ 316| 2.04k| config->env = flb_env_create(); 317| 2.04k| if (config->env == NULL) { ------------------ | Branch (317:9): [True: 10, False: 2.03k] ------------------ 318| 10| flb_error("[config] environment creation failed"); ------------------ | | 140| 10| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 10|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 10, False: 0] | | ------------------ | | 141| 10| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 10|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 319| 10| flb_config_exit(config); 320| 10| return NULL; 321| 10| } 322| | 323| | /* Multiline core */ 324| 2.03k| ret = flb_ml_init(config); 325| 2.03k| if (ret == -1) { ------------------ | Branch (325:9): [True: 204, False: 1.83k] ------------------ 326| 204| flb_error("[config] multiline core initialization failed"); ------------------ | | 140| 204| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 204|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 204, False: 0] | | ------------------ | | 141| 204| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 204|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 327| 204| flb_config_exit(config); 328| 204| return NULL; 329| 204| } 330| | 331| | /* Register static plugins */ 332| 1.83k| ret = flb_plugins_register(config); 333| 1.83k| if (ret == -1) { ------------------ | Branch (333:9): [True: 96, False: 1.73k] ------------------ 334| 96| flb_error("[config] plugins registration failed"); ------------------ | | 140| 96| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 96|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 96, False: 0] | | ------------------ | | 141| 96| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 96|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 335| 96| flb_config_exit(config); 336| 96| return NULL; 337| 96| } 338| | 339| | /* Create environment for dynamic plugins */ 340| 1.73k| config->dso_plugins = flb_plugin_create(); 341| | 342| | /* Ignoring SIGPIPE on Windows (scary) */ 343| 1.73k|#ifndef _WIN32 344| | /* Ignore SIGPIPE */ 345| 1.73k| signal(SIGPIPE, SIG_IGN); 346| 1.73k|#endif 347| | 348| | /* Prepare worker interface */ 349| 1.73k| flb_worker_init(config); 350| | 351| 1.73k|#ifdef FLB_HAVE_REGEX 352| | /* Regex support */ 353| 1.73k| flb_regex_init(); 354| 1.73k|#endif 355| | 356| 1.73k| return config; 357| 1.83k|} flb_config_exit: 360| 2.04k|{ 361| 2.04k| struct mk_list *tmp; 362| 2.04k| struct mk_list *head; 363| 2.04k| struct flb_cf *cf; 364| | 365| 2.04k| if (config->log_file) { ------------------ | Branch (365:9): [True: 0, False: 2.04k] ------------------ 366| 0| flb_free(config->log_file); 367| 0| } 368| | 369| 2.04k| if (config->log) { ------------------ | Branch (369:9): [True: 0, False: 2.04k] ------------------ 370| 0| flb_log_destroy(config->log, config); 371| 0| } 372| | 373| 2.04k| if (config->parsers_file) { ------------------ | Branch (373:9): [True: 0, False: 2.04k] ------------------ 374| 0| flb_free(config->parsers_file); 375| 0| } 376| | 377| 2.04k| if (config->plugins_file) { ------------------ | Branch (377:9): [True: 0, False: 2.04k] ------------------ 378| 0| flb_free(config->plugins_file); 379| 0| } 380| | 381| 2.04k| if (config->kernel) { ------------------ | Branch (381:9): [True: 2.04k, False: 4] ------------------ 382| 2.04k| flb_free(config->kernel->s_version.data); 383| 2.04k| flb_free(config->kernel); 384| 2.04k| } 385| | 386| | /* release resources */ 387| 2.04k| if (config->ch_event.fd) { ------------------ | Branch (387:9): [True: 2.04k, False: 0] ------------------ 388| 2.04k| mk_event_closesocket(config->ch_event.fd); ------------------ | | 86| 2.04k| #define mk_event_closesocket(s) close(s) ------------------ 389| 2.04k| } 390| | 391| | /* Pipe */ 392| 2.04k| if (config->ch_data[0]) { ------------------ | Branch (392:9): [True: 0, False: 2.04k] ------------------ 393| 0| mk_event_closesocket(config->ch_data[0]); ------------------ | | 86| 0| #define mk_event_closesocket(s) close(s) ------------------ 394| 0| mk_event_closesocket(config->ch_data[1]); ------------------ | | 86| 0| #define mk_event_closesocket(s) close(s) ------------------ 395| 0| } 396| | 397| | /* Channel manager */ 398| 2.04k| if (config->ch_manager[0] > 0) { ------------------ | Branch (398:9): [True: 0, False: 2.04k] ------------------ 399| 0| mk_event_closesocket(config->ch_manager[0]); ------------------ | | 86| 0| #define mk_event_closesocket(s) close(s) ------------------ 400| 0| if (config->ch_manager[0] != config->ch_manager[1]) { ------------------ | Branch (400:13): [True: 0, False: 0] ------------------ 401| 0| mk_event_closesocket(config->ch_manager[1]); ------------------ | | 86| 0| #define mk_event_closesocket(s) close(s) ------------------ 402| 0| } 403| 0| } 404| | 405| | /* Channel notifications */ 406| 2.04k| if (config->ch_notif[0] > 0) { ------------------ | Branch (406:9): [True: 0, False: 2.04k] ------------------ 407| 0| mk_event_closesocket(config->ch_notif[0]); ------------------ | | 86| 0| #define mk_event_closesocket(s) close(s) ------------------ 408| 0| if (config->ch_notif[0] != config->ch_notif[1]) { ------------------ | Branch (408:13): [True: 0, False: 0] ------------------ 409| 0| mk_event_closesocket(config->ch_notif[1]); ------------------ | | 86| 0| #define mk_event_closesocket(s) close(s) ------------------ 410| 0| } 411| 0| } 412| | 413| 2.04k| if (config->env) { ------------------ | Branch (413:9): [True: 2.03k, False: 10] ------------------ 414| 2.03k| flb_env_destroy(config->env); 415| 2.03k| } 416| | 417| | /* Program name */ 418| 2.04k| if (config->program_name) { ------------------ | Branch (418:9): [True: 0, False: 2.04k] ------------------ 419| 0| flb_sds_destroy(config->program_name); 420| 0| } 421| | 422| | /* Conf path */ 423| 2.04k| if (config->conf_path) { ------------------ | Branch (423:9): [True: 0, False: 2.04k] ------------------ 424| 0| flb_free(config->conf_path); 425| 0| } 426| | 427| | /* Working directory */ 428| 2.04k| if (config->workdir) { ------------------ | Branch (428:9): [True: 0, False: 2.04k] ------------------ 429| 0| flb_free(config->workdir); 430| 0| } 431| | 432| | /* Destroy any DSO context */ 433| 2.04k| if (config->dso_plugins) { ------------------ | Branch (433:9): [True: 1.73k, False: 313] ------------------ 434| 1.73k| flb_plugin_destroy(config->dso_plugins); 435| 1.73k| } 436| | 437| | /* Workers */ 438| 2.04k| flb_worker_exit(config); 439| | 440| | /* Event flush */ 441| 2.04k| if (config->evl) { ------------------ | Branch (441:9): [True: 0, False: 2.04k] ------------------ 442| 0| if (config->event_flush.status != MK_EVENT_NONE) { ------------------ | | 52| 0|#define MK_EVENT_NONE 1 /* nothing */ ------------------ | Branch (442:13): [True: 0, False: 0] ------------------ 443| 0| mk_event_timeout_destroy(config->evl, &config->event_flush); 444| 0| } 445| 0| } 446| | 447| | /* Release scheduler */ 448| 2.04k| if (config->sched) { ------------------ | Branch (448:9): [True: 0, False: 2.04k] ------------------ 449| 0| flb_sched_destroy(config->sched); 450| 0| } 451| | 452| 2.04k|#ifdef FLB_HAVE_HTTP_SERVER 453| 2.04k| if (config->http_listen) { ------------------ | Branch (453:9): [True: 2.04k, False: 3] ------------------ 454| 2.04k| flb_free(config->http_listen); 455| 2.04k| } 456| | 457| 2.04k| if (config->http_port) { ------------------ | Branch (457:9): [True: 2.04k, False: 3] ------------------ 458| 2.04k| flb_free(config->http_port); 459| 2.04k| } 460| 2.04k|#endif 461| | 462| 2.04k|#ifdef FLB_HAVE_PARSER 463| | /* parsers */ 464| 2.04k| flb_parser_exit(config); 465| 2.04k|#endif 466| | 467| 2.04k| if (config->dns_mode) { ------------------ | Branch (467:9): [True: 0, False: 2.04k] ------------------ 468| 0| flb_free(config->dns_mode); 469| 0| } 470| 2.04k| if (config->dns_resolver) { ------------------ | Branch (470:9): [True: 0, False: 2.04k] ------------------ 471| 0| flb_free(config->dns_resolver); 472| 0| } 473| | 474| 2.04k| if (config->storage_path) { ------------------ | Branch (474:9): [True: 0, False: 2.04k] ------------------ 475| 0| flb_free(config->storage_path); 476| 0| } 477| 2.04k| if (config->storage_sync) { ------------------ | Branch (477:9): [True: 0, False: 2.04k] ------------------ 478| 0| flb_free(config->storage_sync); 479| 0| } 480| 2.04k| if (config->storage_bl_mem_limit) { ------------------ | Branch (480:9): [True: 0, False: 2.04k] ------------------ 481| 0| flb_free(config->storage_bl_mem_limit); 482| 0| } 483| | 484| |#ifdef FLB_HAVE_STREAM_PROCESSOR 485| | if (config->stream_processor_file) { 486| | flb_free(config->stream_processor_file); 487| | } 488| | 489| | flb_slist_destroy(&config->stream_processor_tasks); 490| |#endif 491| | 492| 2.04k| if (config->evl) { ------------------ | Branch (492:9): [True: 0, False: 2.04k] ------------------ 493| 0| mk_event_loop_destroy(config->evl); 494| 0| } 495| 2.04k| if (config->evl_bktq) { ------------------ | Branch (495:9): [True: 0, False: 2.04k] ------------------ 496| 0| flb_bucket_queue_destroy(config->evl_bktq); 497| 0| } 498| | 499| 2.04k| flb_plugins_unregister(config); 500| | 501| 2.04k| if (config->cf_main) { ------------------ | Branch (501:9): [True: 2.04k, False: 0] ------------------ 502| 2.04k| flb_cf_destroy(config->cf_main); 503| 2.04k| } 504| | 505| | /* remove parsers */ 506| 2.04k| mk_list_foreach_safe(head, tmp, &config->cf_parsers_list) { ------------------ | | 207| 2.04k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 0, False: 2.04k] | | ------------------ ------------------ 507| 0| cf = mk_list_entry(head, struct flb_cf, _head); ------------------ | | 214| 0|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 0|#define container_of(ptr, type, member) ({ \ | | | | 39| 0| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 0| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 508| 0| mk_list_del(&cf->_head); 509| 0| flb_cf_destroy(cf); 510| 0| } 511| | 512| 2.04k| flb_free(config); 513| 2.04k|} flb_config_map_create: 252| 1.73k|{ 253| 1.73k| int ret; 254| 1.73k| flb_sds_t env; 255| 1.73k| struct mk_list *tmp; 256| 1.73k| struct mk_list *list; 257| 1.73k| struct flb_config_map *new = NULL; 258| 1.73k| struct flb_config_map *m; 259| | 260| 1.73k| list = flb_malloc(sizeof(struct mk_list)); 261| 1.73k| if (!list) { ------------------ | Branch (261:9): [True: 1, False: 1.72k] ------------------ 262| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 263| 1| return NULL; 264| 1| } 265| 1.72k| mk_list_init(list); 266| | 267| | /* 268| | * Read every property defined in the config map and create a new dynamic list 269| | * with the same content. 270| | * 271| | * As an additional step, it populate the 'value' field using the given default 272| | * value if any. Note that default values are strings so they are processed 273| | * to fit into the proper data type of 'value'. 274| | */ 275| 1.72k| m = map; 276| 14.5k| while (m && m->name) { ------------------ | Branch (276:12): [True: 14.5k, False: 0] | Branch (276:17): [True: 12.8k, False: 1.67k] ------------------ 277| | /* Allocate map node */ 278| 12.8k| new = flb_calloc(1, sizeof(struct flb_config_map)); 279| 12.8k| if (!new) { ------------------ | Branch (279:13): [True: 9, False: 12.8k] ------------------ 280| 9| flb_errno(); ------------------ | | 201| 9|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 281| 9| flb_config_map_destroy(list); 282| 9| return NULL; 283| 9| } 284| | 285| 12.8k| new->type = m->type; 286| 12.8k| new->name = flb_sds_create(m->name); 287| 12.8k| if (new->name == NULL) { ------------------ | Branch (287:13): [True: 9, False: 12.8k] ------------------ 288| 9| flb_free(new); 289| 9| flb_config_map_destroy(list); 290| 9| return NULL; 291| 9| } 292| | 293| | /* Translate default value */ 294| 12.8k| if (m->def_value) { ------------------ | Branch (294:13): [True: 11.9k, False: 892] ------------------ 295| | /* 296| | * Before to translate any value, make sure to disable the warning 297| | * about unused variables. This might happen if a default value is an 298| | * environment variable and the user is not using it (which is ok for 299| | * that specific use case). 300| | */ 301| 11.9k| flb_env_warn_unused(config->env, FLB_FALSE); ------------------ | | 25| 11.9k|#define FLB_FALSE 0 ------------------ 302| | 303| | /* Translate the value */ 304| 11.9k| env = flb_env_var_translate(config->env, m->def_value); 305| 11.9k| if (env == NULL) { ------------------ | Branch (305:17): [True: 7, False: 11.9k] ------------------ 306| 7| flb_errno(); ------------------ | | 201| 7|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 307| 7| flb_sds_destroy(new->name); 308| 7| flb_free(new); 309| 7| flb_config_map_destroy(list); 310| 7| return NULL; 311| 7| } 312| 11.9k| new->def_value = env; 313| 11.9k| flb_env_warn_unused(config->env, FLB_TRUE); ------------------ | | 26| 11.9k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 11.9k|#define FLB_FALSE 0 | | ------------------ ------------------ 314| 11.9k| } 315| | 316| 12.8k| new->flags = m->flags; 317| 12.8k| new->set_property = m->set_property; 318| 12.8k| new->offset = m->offset; 319| 12.8k| new->value.mult = NULL; 320| 12.8k| new->desc = m->desc; 321| 12.8k| mk_list_add(&new->_head, list); 322| | 323| 12.8k| if (new->set_property == FLB_FALSE) { ------------------ | | 25| 12.8k|#define FLB_FALSE 0 ------------------ | Branch (323:13): [True: 0, False: 12.8k] ------------------ 324| 0| m++; 325| 0| continue; 326| 0| } 327| | 328| | /* If this is a multiple type of entries, initialize the main list */ 329| 12.8k| if (new->flags & FLB_CONFIG_MAP_MULT) { ------------------ | | 50| 12.8k|#define FLB_CONFIG_MAP_MULT 1 ------------------ | Branch (329:13): [True: 5.30k, False: 7.49k] ------------------ 330| 5.30k| tmp = flb_malloc(sizeof(struct mk_list)); 331| 5.30k| if (!tmp) { ------------------ | Branch (331:17): [True: 3, False: 5.30k] ------------------ 332| 3| flb_errno(); ------------------ | | 201| 3|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 333| 3| flb_config_map_destroy(list); 334| 3| return NULL; 335| 3| } 336| 5.30k| mk_list_init(tmp); 337| 5.30k| new->value.mult = tmp; 338| 5.30k| } 339| | 340| | /* 341| | * If there is no default value or the entry will not be set, just 342| | * continue with the next map entry 343| | */ 344| 12.7k| if (!m->def_value) { ------------------ | Branch (344:13): [True: 891, False: 11.9k] ------------------ 345| 891| m++; 346| 891| continue; 347| 891| } 348| | 349| | /* Assign value based on data type and multiple mode if set */ 350| 11.9k| ret = translate_default_value(new, new->def_value); 351| 11.9k| if (ret == -1) { ------------------ | Branch (351:13): [True: 26, False: 11.8k] ------------------ 352| 26| flb_config_map_destroy(list); 353| 26| return NULL; 354| 26| } 355| 11.8k| m++; 356| 11.8k| } 357| | 358| 1.67k| return list; 359| 1.72k|} flb_config_map_destroy: 376| 1.72k|{ 377| 1.72k| struct mk_list *tmp; 378| 1.72k| struct mk_list *head; 379| 1.72k| struct mk_list *v_head; 380| 1.72k| struct mk_list *v_tmp; 381| 1.72k| struct flb_config_map *map; 382| 1.72k| struct flb_config_map_val *entry; 383| | 384| 12.8k| mk_list_foreach_safe(head, tmp, list) { ------------------ | | 207| 14.5k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 12.8k, False: 1.72k] | | ------------------ ------------------ 385| 12.8k| map = mk_list_entry(head, struct flb_config_map, _head); ------------------ | | 214| 12.8k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 12.8k|#define container_of(ptr, type, member) ({ \ | | | | 39| 12.8k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 12.8k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 386| 12.8k| mk_list_del(&map->_head); 387| | 388| 12.8k| if (map->flags & FLB_CONFIG_MAP_MULT && map->value.mult) { ------------------ | | 50| 25.6k|#define FLB_CONFIG_MAP_MULT 1 ------------------ | Branch (388:13): [True: 5.30k, False: 7.49k] | Branch (388:49): [True: 5.30k, False: 3] ------------------ 389| 5.30k| mk_list_foreach_safe(v_head, v_tmp, map->value.mult) { ------------------ | | 207| 9.76k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 4.46k, False: 5.30k] | | ------------------ ------------------ 390| 4.46k| entry = mk_list_entry(v_head, struct flb_config_map_val, _head); ------------------ | | 214| 4.46k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 4.46k|#define container_of(ptr, type, member) ({ \ | | | | 39| 4.46k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 4.46k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 391| 4.46k| mk_list_del(&entry->_head); 392| 4.46k| destroy_map_val(map->type, entry); 393| 4.46k| flb_free(entry); 394| 4.46k| } 395| 5.30k| flb_free(map->value.mult); 396| 5.30k| } 397| 7.50k| else { 398| 7.50k| destroy_map_val(map->type, &map->value); 399| 7.50k| } 400| 12.8k| if (map->def_value) { ------------------ | Branch (400:13): [True: 11.9k, False: 892] ------------------ 401| 11.9k| flb_sds_destroy(map->def_value); 402| 11.9k| } 403| 12.8k| flb_sds_destroy(map->name); 404| 12.8k| flb_free(map); 405| 12.8k| } 406| 1.72k| flb_free(list); 407| 1.72k|} property_count: 411| 457|{ 412| 457| int count = 0; 413| 457| struct mk_list *head; 414| 457| struct flb_kv *kv; 415| | 416| 457| mk_list_foreach(head, properties) { ------------------ | | 205| 914|#define mk_list_foreach(curr, head) for( curr = (head)->next; curr != (head); curr = curr->next ) | | ------------------ | | | Branch (205:63): [True: 457, False: 457] | | ------------------ ------------------ 417| 457| kv = mk_list_entry(head, struct flb_kv, _head); ------------------ | | 214| 457|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 457|#define container_of(ptr, type, member) ({ \ | | | | 39| 457| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 457| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 418| 457| if (flb_sds_len(kv->key) != len) { ------------------ | Branch (418:13): [True: 0, False: 457] ------------------ 419| 0| continue; 420| 0| } 421| | 422| 457| if (strncmp(kv->key, key, len) == 0) { ------------------ | Branch (422:13): [True: 457, False: 0] ------------------ 423| 457| count++; 424| 457| } 425| 457| } 426| 457| return count; 427| 457|} flb_config_map_properties_check: 449| 1.50k|{ 450| 1.50k| int len; 451| 1.50k| int found; 452| 1.50k| int count = 0; 453| 1.50k| int ret; 454| 1.50k| flb_sds_t helper; 455| 1.50k| struct flb_kv *kv; 456| 1.50k| struct mk_list *head; 457| 1.50k| struct mk_list *m_head; 458| 1.50k| struct flb_config_map *m; 459| | 460| | /* Iterate all incoming property list */ 461| 1.50k| mk_list_foreach(head, in_properties) { ------------------ | | 205| 1.96k|#define mk_list_foreach(curr, head) for( curr = (head)->next; curr != (head); curr = curr->next ) | | ------------------ | | | Branch (205:63): [True: 1.50k, False: 457] | | ------------------ ------------------ 462| 1.50k| kv = mk_list_entry(head, struct flb_kv, _head); ------------------ | | 214| 1.50k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 1.50k|#define container_of(ptr, type, member) ({ \ | | | | 39| 1.50k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 1.50k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 463| 1.50k| found = FLB_FALSE; ------------------ | | 25| 1.50k|#define FLB_FALSE 0 ------------------ 464| | 465| | 466| 1.50k| ret = is_internal_debug_property(kv->key); 467| 1.50k| if (ret == FLB_TRUE) { ------------------ | | 26| 1.50k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 1.50k|#define FLB_FALSE 0 | | ------------------ ------------------ | Branch (467:13): [True: 0, False: 1.50k] ------------------ 468| | /* Skip the config map */ 469| 0| continue; 470| 0| } 471| | 472| | /* Lookup the key into the provided map */ 473| 10.0k| mk_list_foreach(m_head, map) { ------------------ | | 205| 11.0k|#define mk_list_foreach(curr, head) for( curr = (head)->next; curr != (head); curr = curr->next ) | | ------------------ | | | Branch (205:63): [True: 10.0k, False: 1.05k] | | ------------------ ------------------ 474| 10.0k| m = mk_list_entry(m_head, struct flb_config_map, _head); ------------------ | | 214| 10.0k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 10.0k|#define container_of(ptr, type, member) ({ \ | | | | 39| 10.0k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 10.0k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 475| | 476| 10.0k| len = flb_sds_len(m->name); 477| 10.0k| if (m->type != FLB_CONFIG_MAP_STR_PREFIX) { ------------------ | | 30| 10.0k|#define FLB_CONFIG_MAP_STR_PREFIX 1 /* string that starts with */ ------------------ | Branch (477:17): [True: 10.0k, False: 0] ------------------ 478| 10.0k| if (len != flb_sds_len(kv->key)) { ------------------ | Branch (478:21): [True: 8.76k, False: 1.24k] ------------------ 479| 8.76k| continue; 480| 8.76k| } 481| 10.0k| } 482| | 483| 1.24k| if (strncasecmp(kv->key, m->name, len) == 0) { ------------------ | Branch (483:17): [True: 457, False: 790] ------------------ 484| 457| if (m->type == FLB_CONFIG_MAP_STR_PREFIX) { ------------------ | | 30| 457|#define FLB_CONFIG_MAP_STR_PREFIX 1 /* string that starts with */ ------------------ | Branch (484:21): [True: 0, False: 457] ------------------ 485| 0| if (flb_sds_len(kv->key) <= len) { ------------------ | Branch (485:25): [True: 0, False: 0] ------------------ 486| 0| flb_error("[config] incomplete prefixed key '%s'", kv->key); ------------------ | | 140| 0| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 0|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 0, False: 0] | | ------------------ | | 141| 0| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 0|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 487| 0| found = FLB_FALSE; ------------------ | | 25| 0|#define FLB_FALSE 0 ------------------ 488| 0| break; 489| 0| } 490| 0| } 491| 457| else if(m->type == FLB_CONFIG_MAP_DEPRECATED) { ------------------ | | 36| 457|#define FLB_CONFIG_MAP_DEPRECATED 7 /* for deprecated parameter */ ------------------ | Branch (491:25): [True: 0, False: 457] ------------------ 492| 0| flb_warn("[config] %s: '%s' is deprecated", ------------------ | | 149| 0| if (flb_log_check(FLB_LOG_WARN)) \ | | ------------------ | | | | 40| 0|#define FLB_LOG_WARN 2 | | ------------------ | | | Branch (149:9): [True: 0, False: 0] | | ------------------ | | 150| 0| flb_log_print(FLB_LOG_WARN, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 40| 0|#define FLB_LOG_WARN 2 | | ------------------ ------------------ 493| 0| context_name, kv->key); 494| 0| } 495| 457| found = FLB_TRUE; ------------------ | | 26| 457|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 457|#define FLB_FALSE 0 | | ------------------ ------------------ 496| 457| break; 497| 457| } 498| 1.24k| } 499| | 500| 1.50k| if (found == FLB_FALSE) { ------------------ | | 25| 1.50k|#define FLB_FALSE 0 ------------------ | Branch (500:13): [True: 1.05k, False: 457] ------------------ 501| 1.05k| helper = helper_map_options(map); 502| 1.05k| if (!helper) { ------------------ | Branch (502:17): [True: 3, False: 1.04k] ------------------ 503| 3| flb_error("[config] %s: unknown configuration property '%s'", ------------------ | | 140| 3| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 3|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 3, False: 0] | | ------------------ | | 141| 3| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 3|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 504| 3| context_name, kv->key); 505| 3| } 506| 1.04k| else { 507| 1.04k| flb_error("[config] %s: unknown configuration property '%s'. %s", ------------------ | | 140| 1.04k| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 1.04k|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 1.04k, False: 0] | | ------------------ | | 141| 1.04k| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 1.04k|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 508| 1.04k| context_name, kv->key, helper); 509| 1.04k| flb_sds_destroy(helper); 510| 1.04k| } 511| | 512| 1.05k| return -1; 513| 1.05k| } 514| | 515| | /* Validate number of times the property is set */ 516| 457| count = property_count(kv->key, flb_sds_len(kv->key), in_properties); 517| 457| if ((m->flags & FLB_CONFIG_MAP_MULT) == 0) { ------------------ | | 50| 457|#define FLB_CONFIG_MAP_MULT 1 ------------------ | Branch (517:13): [True: 417, False: 40] ------------------ 518| 417| if (count > 1) { ------------------ | Branch (518:17): [True: 0, False: 417] ------------------ 519| 0| flb_error("[config] %s: configuration property '%s' is set %i times", ------------------ | | 140| 0| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 0|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 0, False: 0] | | ------------------ | | 141| 0| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 0|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 520| 0| context_name, kv->key, count); 521| 0| return -1; 522| 0| } 523| 417| } 524| 457| } 525| | 526| 457| return 0; 527| 1.50k|} flb_config_map_expected_values: 560| 29|{ 561| 29| if (type > FLB_CONFIG_MAP_CLIST && type < FLB_CONFIG_MAP_SLIST) { ------------------ | | 38| 58|#define FLB_CONFIG_MAP_CLIST 30 /* comma separated list of strings */ ------------------ if (type > FLB_CONFIG_MAP_CLIST && type < FLB_CONFIG_MAP_SLIST) { ------------------ | | 44| 29|#define FLB_CONFIG_MAP_SLIST 40 /* empty space separated list of strings */ ------------------ | Branch (561:9): [True: 29, False: 0] | Branch (561:40): [True: 0, False: 29] ------------------ 562| 0| return type - FLB_CONFIG_MAP_CLIST; ------------------ | | 38| 0|#define FLB_CONFIG_MAP_CLIST 30 /* comma separated list of strings */ ------------------ 563| 0| } 564| 29| if (type > FLB_CONFIG_MAP_SLIST && type <= FLB_CONFIG_MAP_SLIST_4) { ------------------ | | 44| 58|#define FLB_CONFIG_MAP_SLIST 40 /* empty space separated list of strings */ ------------------ if (type > FLB_CONFIG_MAP_SLIST && type <= FLB_CONFIG_MAP_SLIST_4) { ------------------ | | 48| 29|#define FLB_CONFIG_MAP_SLIST_4 44 /* split up to 4 nodes + remaining data */ ------------------ | Branch (564:9): [True: 29, False: 0] | Branch (564:40): [True: 29, False: 0] ------------------ 565| 29| return type - FLB_CONFIG_MAP_SLIST; ------------------ | | 44| 29|#define FLB_CONFIG_MAP_SLIST 40 /* empty space separated list of strings */ ------------------ 566| 29| } 567| 0| return -1; 568| 29|} flb_config_map_set: 576| 1.67k|{ 577| 1.67k| int ret; 578| 1.67k| int len; 579| 1.67k| char *base; 580| 1.67k| char *m_bool; 581| 1.67k| int *m_i_num; 582| 1.67k| double *m_d_num; 583| 1.67k| size_t *m_s_num; 584| 1.67k| flb_sds_t *m_str; 585| 1.67k| struct flb_kv *kv; 586| 1.67k| struct mk_list *head; 587| 1.67k| struct mk_list *m_head; 588| 1.67k| struct mk_list **m_list; 589| 1.67k| struct mk_list *list; 590| 1.67k| struct flb_config_map *m = NULL; 591| 1.67k| struct flb_config_map_val *entry = NULL; 592| | 593| 1.67k| base = context; 594| | 595| | /* Link 'already processed default values' into the caller context */ 596| 12.5k| mk_list_foreach(m_head, map) { ------------------ | | 205| 14.2k|#define mk_list_foreach(curr, head) for( curr = (head)->next; curr != (head); curr = curr->next ) | | ------------------ | | | Branch (205:63): [True: 12.5k, False: 1.67k] | | ------------------ ------------------ 597| 12.5k| m = mk_list_entry(m_head, struct flb_config_map, _head); ------------------ | | 214| 12.5k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 12.5k|#define container_of(ptr, type, member) ({ \ | | | | 39| 12.5k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 12.5k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 598| | 599| | /* 600| | * If the map type allows multiple entries, the user context is a pointer 601| | * for a linked list. We just point their structure to our pre-processed 602| | * list of entries. 603| | */ 604| 12.5k| if (m->flags & FLB_CONFIG_MAP_MULT && m->set_property == FLB_TRUE) { ------------------ | | 50| 25.0k|#define FLB_CONFIG_MAP_MULT 1 ------------------ if (m->flags & FLB_CONFIG_MAP_MULT && m->set_property == FLB_TRUE) { ------------------ | | 26| 5.18k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 5.18k|#define FLB_FALSE 0 | | ------------------ ------------------ | Branch (604:13): [True: 5.18k, False: 7.35k] | Branch (604:47): [True: 5.18k, False: 0] ------------------ 605| 5.18k| m_list = (struct mk_list **) (base + m->offset); 606| 5.18k| *m_list = m->value.mult; 607| 5.18k| continue; 608| 5.18k| } 609| | 610| | /* 611| | * If no default value exists or the map will not write to the user 612| | * context.. skip it. 613| | */ 614| 7.35k| if (!m->def_value || m->set_property == FLB_FALSE) { ------------------ | | 25| 7.35k|#define FLB_FALSE 0 ------------------ | Branch (614:13): [True: 0, False: 7.35k] | Branch (614:30): [True: 0, False: 7.35k] ------------------ 615| 0| continue; 616| 0| } 617| | 618| | /* 619| | * If a property set by the user will override the default value, just 620| | * do not put the default value into the context since it will be replaced 621| | * later. 622| | */ 623| 7.35k| ret = properties_override_default(properties, m->name); 624| 7.35k| if (ret == FLB_TRUE) { ------------------ | | 26| 7.35k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 7.35k|#define FLB_FALSE 0 | | ------------------ ------------------ | Branch (624:13): [True: 540, False: 6.81k] ------------------ 625| 540| continue; 626| 540| } 627| | 628| | /* All the following steps are direct writes to the user context */ 629| 6.81k| if (m->type == FLB_CONFIG_MAP_STR) { ------------------ | | 29| 6.81k|#define FLB_CONFIG_MAP_STR 0 /* string */ ------------------ | Branch (629:13): [True: 809, False: 6.00k] ------------------ 630| 809| m_str = (char **) (base + m->offset); 631| 809| *m_str = m->value.val.str; 632| 809| } 633| 6.00k| else if (m->type == FLB_CONFIG_MAP_INT) { ------------------ | | 31| 6.00k|#define FLB_CONFIG_MAP_INT 2 /* integer */ ------------------ | Branch (633:18): [True: 810, False: 5.19k] ------------------ 634| 810| m_i_num = (int *) (base + m->offset); 635| 810| *m_i_num = m->value.val.i_num; 636| 810| } 637| 5.19k| else if (m->type == FLB_CONFIG_MAP_DOUBLE) { ------------------ | | 33| 5.19k|#define FLB_CONFIG_MAP_DOUBLE 4 /* double */ ------------------ | Branch (637:18): [True: 810, False: 4.38k] ------------------ 638| 810| m_d_num = (double *) (base + m->offset); 639| 810| *m_d_num = m->value.val.d_num; 640| 810| } 641| 4.38k| else if (m->type == FLB_CONFIG_MAP_SIZE) { ------------------ | | 34| 4.38k|#define FLB_CONFIG_MAP_SIZE 5 /* string size to integer (e.g: 2M) */ ------------------ | Branch (641:18): [True: 451, False: 3.93k] ------------------ 642| 451| m_s_num = (size_t *) (base + m->offset); 643| 451| *m_s_num = m->value.val.s_num; 644| 451| } 645| 3.93k| else if (m->type == FLB_CONFIG_MAP_TIME) { ------------------ | | 35| 3.93k|#define FLB_CONFIG_MAP_TIME 6 /* string time to integer seconds (e.g: 2H) */ ------------------ | Branch (645:18): [True: 779, False: 3.15k] ------------------ 646| 779| m_i_num = (int *) (base + m->offset); 647| 779| *m_i_num = m->value.val.s_num; 648| 779| } 649| 3.15k| else if (m->type == FLB_CONFIG_MAP_BOOL) { ------------------ | | 32| 3.15k|#define FLB_CONFIG_MAP_BOOL 3 /* boolean */ ------------------ | Branch (649:18): [True: 1.54k, False: 1.60k] ------------------ 650| 1.54k| m_bool = (char *) (base + m->offset); 651| 1.54k| *m_bool = m->value.val.boolean; 652| 1.54k| } 653| 1.60k| else if (m->type >= FLB_CONFIG_MAP_CLIST || ------------------ | | 38| 3.20k|#define FLB_CONFIG_MAP_CLIST 30 /* comma separated list of strings */ ------------------ | Branch (653:18): [True: 1.60k, False: 0] ------------------ 654| 1.60k| m->type <= FLB_CONFIG_MAP_SLIST_4) { ------------------ | | 48| 0|#define FLB_CONFIG_MAP_SLIST_4 44 /* split up to 4 nodes + remaining data */ ------------------ | Branch (654:18): [True: 0, False: 0] ------------------ 655| 1.60k| m_list = (struct mk_list **) (base + m->offset); 656| 1.60k| *m_list = m->value.val.list; 657| 1.60k| } 658| 6.81k| } 659| | 660| | /* 661| | * Iterate all properties coming from the configuration reader. If a property overrides 662| | * a default value already set in the previous step, just link to the new value. 663| | */ 664| 1.67k| mk_list_foreach(head, properties) { ------------------ | | 205| 3.18k|#define mk_list_foreach(curr, head) for( curr = (head)->next; curr != (head); curr = curr->next ) | | ------------------ | | | Branch (205:63): [True: 1.67k, False: 1.50k] | | ------------------ ------------------ 665| 1.67k| kv = mk_list_entry(head, struct flb_kv, _head); ------------------ | | 214| 1.67k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 1.67k|#define container_of(ptr, type, member) ({ \ | | | | 39| 1.67k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 1.67k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 666| 1.67k| if (kv->val == NULL) { ------------------ | Branch (666:13): [True: 66, False: 1.60k] ------------------ 667| 66| continue; 668| 66| } 669| | 670| 9.91k| mk_list_foreach(m_head, map) { ------------------ | | 205| 10.8k|#define mk_list_foreach(curr, head) for( curr = (head)->next; curr != (head); curr = curr->next ) | | ------------------ | | | Branch (205:63): [True: 9.91k, False: 988] | | ------------------ ------------------ 671| 9.91k| m = mk_list_entry(m_head, struct flb_config_map, _head); ------------------ | | 214| 9.91k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 9.91k|#define container_of(ptr, type, member) ({ \ | | | | 39| 9.91k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 9.91k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 672| 9.91k| if (flb_sds_len(kv->key) != flb_sds_len(m->name)) { ------------------ | Branch (672:17): [True: 8.50k, False: 1.40k] ------------------ 673| 8.50k| m = NULL; 674| 8.50k| continue; 675| 8.50k| } 676| | 677| 1.40k| if (strncasecmp(kv->key, m->name, flb_sds_len(m->name)) == 0) { ------------------ | Branch (677:17): [True: 621, False: 787] ------------------ 678| 621| break; 679| 621| } 680| 787| m = NULL; 681| 787| continue; 682| | 683| 1.40k| } 684| | 685| 1.60k| if (!m || m->set_property == FLB_FALSE) { ------------------ | | 25| 621|#define FLB_FALSE 0 ------------------ | Branch (685:13): [True: 988, False: 621] | Branch (685:19): [True: 0, False: 621] ------------------ 686| 988| continue; 687| 988| } 688| | 689| | /* Check if the map allows multiple entries */ 690| 621| if (m->flags & FLB_CONFIG_MAP_MULT) { ------------------ | | 50| 621|#define FLB_CONFIG_MAP_MULT 1 ------------------ | Branch (690:13): [True: 82, False: 539] ------------------ 691| | /* Create node */ 692| 82| entry = flb_calloc(1, sizeof(struct flb_config_map_val)); 693| 82| if (!entry) { ------------------ | Branch (693:17): [True: 2, False: 80] ------------------ 694| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 695| 2| return -1; 696| 2| } 697| | 698| | /* Populate value */ 699| 80| if (m->type == FLB_CONFIG_MAP_STR) { ------------------ | | 29| 80|#define FLB_CONFIG_MAP_STR 0 /* string */ ------------------ | Branch (699:17): [True: 2, False: 78] ------------------ 700| 2| entry->val.str = flb_sds_create(kv->val); 701| 2| } 702| 78| else if (m->type == FLB_CONFIG_MAP_INT) { ------------------ | | 31| 78|#define FLB_CONFIG_MAP_INT 2 /* integer */ ------------------ | Branch (702:22): [True: 1, False: 77] ------------------ 703| 1| entry->val.i_num = atoi(kv->val); 704| 1| } 705| 77| else if (m->type == FLB_CONFIG_MAP_DOUBLE) { ------------------ | | 33| 77|#define FLB_CONFIG_MAP_DOUBLE 4 /* double */ ------------------ | Branch (705:22): [True: 4, False: 73] ------------------ 706| 4| entry->val.d_num = atof(kv->val); 707| 4| } 708| 73| else if (m->type == FLB_CONFIG_MAP_SIZE) { ------------------ | | 34| 73|#define FLB_CONFIG_MAP_SIZE 5 /* string size to integer (e.g: 2M) */ ------------------ | Branch (708:22): [True: 0, False: 73] ------------------ 709| 0| entry->val.s_num = flb_utils_size_to_bytes(kv->val); 710| 0| } 711| 73| else if (m->type == FLB_CONFIG_MAP_TIME) { ------------------ | | 35| 73|#define FLB_CONFIG_MAP_TIME 6 /* string time to integer seconds (e.g: 2H) */ ------------------ | Branch (711:22): [True: 0, False: 73] ------------------ 712| 0| entry->val.i_num = flb_utils_time_to_seconds(kv->val); 713| 0| } 714| 73| else if (m->type == FLB_CONFIG_MAP_BOOL) { ------------------ | | 32| 73|#define FLB_CONFIG_MAP_BOOL 3 /* boolean */ ------------------ | Branch (714:22): [True: 16, False: 57] ------------------ 715| 16| ret = flb_utils_bool(kv->val); 716| 16| if (ret == -1) { ------------------ | Branch (716:21): [True: 12, False: 4] ------------------ 717| 12| flb_free(entry); 718| 12| flb_error("[config map] invalid value for boolean property '%s=%s'", ------------------ | | 140| 12| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 12|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 12, False: 0] | | ------------------ | | 141| 12| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 12|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 719| 12| m->name, kv->val); 720| 12| return -1; 721| 12| } 722| 4| entry->val.boolean = ret; 723| 4| } 724| 57| else if (m->type >= FLB_CONFIG_MAP_CLIST || ------------------ | | 38| 114|#define FLB_CONFIG_MAP_CLIST 30 /* comma separated list of strings */ ------------------ | Branch (724:22): [True: 57, False: 0] ------------------ 725| 57| m->type <= FLB_CONFIG_MAP_SLIST_4) { ------------------ | | 48| 0|#define FLB_CONFIG_MAP_SLIST_4 44 /* split up to 4 nodes + remaining data */ ------------------ | Branch (725:22): [True: 0, False: 0] ------------------ 726| | 727| 57| list = parse_string_map_to_list(m, kv->val); 728| 57| if (!list) { ------------------ | Branch (728:21): [True: 1, False: 56] ------------------ 729| 1| flb_error("[config map] cannot parse list of values '%s'", kv->val); ------------------ | | 140| 1| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 1|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 1, False: 0] | | ------------------ | | 141| 1| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 1|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 730| 1| flb_free(entry); 731| 1| return -1; 732| 1| } 733| 56| entry->val.list = list; 734| | 735| | /* Validate the number of entries are the minimum expected */ 736| 56| len = mk_list_size(list); 737| 56| ret = check_list_size(list, m->type); 738| 56| if (ret == -1) { ------------------ | Branch (738:21): [True: 29, False: 27] ------------------ 739| 29| flb_error("[config map] property '%s' expects %i values " ------------------ | | 140| 29| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 29|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 29, False: 0] | | ------------------ | | 141| 29| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 29|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 740| 29| "(only %i were found)", 741| 29| kv->key, 742| 29| flb_config_map_expected_values(m->type), len); 743| | /* 744| | * Register the entry anyways, so on exit the resources will 745| | * be released 746| | */ 747| 29| mk_list_add(&entry->_head, m->value.mult); 748| 29| return -1; 749| 29| } 750| 56| } 751| | 752| | /* Add entry to the map 'mult' list tail */ 753| 38| mk_list_add(&entry->_head, m->value.mult); 754| | 755| | /* Override user context */ 756| 38| m_list = (struct mk_list **) (base + m->offset); 757| 38| *m_list = m->value.mult; 758| 38| } 759| 539| else if (map != NULL) { ------------------ | Branch (759:18): [True: 539, False: 0] ------------------ 760| | /* Direct write to user context */ 761| 539| if (m->type == FLB_CONFIG_MAP_STR) { ------------------ | | 29| 539|#define FLB_CONFIG_MAP_STR 0 /* string */ ------------------ | Branch (761:17): [True: 2, False: 537] ------------------ 762| 2| m_str = (char **) (base + m->offset); 763| 2| *m_str = kv->val; 764| 2| } 765| 537| else if (m->type == FLB_CONFIG_MAP_INT) { ------------------ | | 31| 537|#define FLB_CONFIG_MAP_INT 2 /* integer */ ------------------ | Branch (765:22): [True: 1, False: 536] ------------------ 766| 1| m_i_num = (int *) (base + m->offset); 767| 1| *m_i_num = atoi(kv->val); 768| 1| } 769| 536| else if (m->type == FLB_CONFIG_MAP_DOUBLE) { ------------------ | | 33| 536|#define FLB_CONFIG_MAP_DOUBLE 4 /* double */ ------------------ | Branch (769:22): [True: 1, False: 535] ------------------ 770| 1| m_d_num = (double *) (base + m->offset); 771| 1| *m_d_num = atof(kv->val); 772| 1| } 773| 535| else if (m->type == FLB_CONFIG_MAP_BOOL) { ------------------ | | 32| 535|#define FLB_CONFIG_MAP_BOOL 3 /* boolean */ ------------------ | Branch (773:22): [True: 126, False: 409] ------------------ 774| 126| m_bool = (char *) (base + m->offset); 775| 126| ret = flb_utils_bool(kv->val); 776| 126| if (ret == -1) { ------------------ | Branch (776:21): [True: 122, False: 4] ------------------ 777| 122| flb_error("[config map] invalid value for boolean property '%s=%s'", ------------------ | | 140| 122| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 122|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 122, False: 0] | | ------------------ | | 141| 122| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 122|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 778| 122| m->name, kv->val); 779| 122| return -1; 780| 122| } 781| 4| *m_bool = ret; 782| 4| } 783| 409| else if (m->type == FLB_CONFIG_MAP_SIZE) { ------------------ | | 34| 409|#define FLB_CONFIG_MAP_SIZE 5 /* string size to integer (e.g: 2M) */ ------------------ | Branch (783:22): [True: 360, False: 49] ------------------ 784| 360| m_s_num = (size_t *) (base + m->offset); 785| 360| *m_s_num = flb_utils_size_to_bytes(kv->val); 786| 360| } 787| 49| else if (m->type == FLB_CONFIG_MAP_TIME) { ------------------ | | 35| 49|#define FLB_CONFIG_MAP_TIME 6 /* string time to integer seconds (e.g: 2H) */ ------------------ | Branch (787:22): [True: 32, False: 17] ------------------ 788| 32| m_i_num = (int *) (base + m->offset); 789| 32| *m_i_num = flb_utils_time_to_seconds(kv->val); 790| 32| } 791| 17| else if (m->type >= FLB_CONFIG_MAP_CLIST || ------------------ | | 38| 34|#define FLB_CONFIG_MAP_CLIST 30 /* comma separated list of strings */ ------------------ | Branch (791:22): [True: 17, False: 0] ------------------ 792| 17| m->type <= FLB_CONFIG_MAP_SLIST_4) { ------------------ | | 48| 0|#define FLB_CONFIG_MAP_SLIST_4 44 /* split up to 4 nodes + remaining data */ ------------------ | Branch (792:22): [True: 0, False: 0] ------------------ 793| 17| list = parse_string_map_to_list(m, kv->val); 794| 17| if (!list) { ------------------ | Branch (794:21): [True: 1, False: 16] ------------------ 795| 1| flb_error("[config map] cannot parse list of values '%s'", kv->val); ------------------ | | 140| 1| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 1|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 1, False: 0] | | ------------------ | | 141| 1| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 1|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 796| 1| flb_free(entry); 797| 1| return -1; 798| 1| } 799| | 800| 16| if (m->value.val.list) { ------------------ | Branch (800:21): [True: 16, False: 0] ------------------ 801| 16| destroy_map_val(m->type, &m->value); 802| 16| } 803| | 804| 16| m->value.val.list = list; 805| 16| m_list = (struct mk_list **) (base + m->offset); 806| 16| *m_list = m->value.val.list; 807| 16| } 808| 539| } 809| 621| } 810| | 811| 1.50k| return 0; 812| 1.67k|} flb_config_map.c:translate_default_value: 107| 11.9k|{ 108| 11.9k| int ret; 109| 11.9k| struct flb_config_map_val *entry = NULL; 110| 11.9k| struct mk_list *list = NULL; 111| | 112| | /* Prepare contexts if the map allows multiple entries */ 113| 11.9k| if (map->flags & FLB_CONFIG_MAP_MULT) { ------------------ | | 50| 11.9k|#define FLB_CONFIG_MAP_MULT 1 ------------------ | Branch (113:9): [True: 4.40k, False: 7.49k] ------------------ 114| 4.40k| entry = flb_calloc(1, sizeof(struct flb_config_map_val)); 115| 4.40k| if (!entry) { ------------------ | Branch (115:13): [True: 2, False: 4.40k] ------------------ 116| 2| flb_errno(); ------------------ | | 201| 2|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 117| | /* 118| | * do not worry about 'list' allocation, it will be destroyed by the caller 119| | * when it catches this error 120| | */ 121| 2| return -1; 122| 2| } 123| 4.40k| } 124| 7.49k| else { 125| 7.49k| entry = &map->value; 126| 7.49k| } 127| | 128| | /* Based on specific data types, populate 'value' */ 129| 11.9k| if (map->type == FLB_CONFIG_MAP_STR) { ------------------ | | 29| 11.9k|#define FLB_CONFIG_MAP_STR 0 /* string */ ------------------ | Branch (129:9): [True: 1.71k, False: 10.1k] ------------------ 130| | /* Duplicate string as a flb_sds_t */ 131| 1.71k| entry->val.str = flb_sds_create(val); 132| | 133| | /* Validate new memory allocation */ 134| 1.71k| if (!entry->val.str) { ------------------ | Branch (134:13): [True: 1, False: 1.71k] ------------------ 135| 1| goto error; 136| 1| } 137| 1.71k| } 138| 10.1k| else if (map->type == FLB_CONFIG_MAP_STR_PREFIX) { ------------------ | | 30| 10.1k|#define FLB_CONFIG_MAP_STR_PREFIX 1 /* string that starts with */ ------------------ | Branch (138:14): [True: 0, False: 10.1k] ------------------ 139| | /* 140| | * For prefixed string types we don't process them, just validate 141| | * that no default value has been set. 142| | */ 143| 0| if (val) { ------------------ | Branch (143:13): [True: 0, False: 0] ------------------ 144| 0| flb_error("[config map] invalid default value for prefixed string '%s'", ------------------ | | 140| 0| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 0|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 0, False: 0] | | ------------------ | | 141| 0| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 0|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 145| 0| map->name); 146| 0| goto error; 147| 0| } 148| 0| } 149| 10.1k| else if (map->type == FLB_CONFIG_MAP_BOOL) { ------------------ | | 32| 10.1k|#define FLB_CONFIG_MAP_BOOL 3 /* boolean */ ------------------ | Branch (149:14): [True: 1.72k, False: 8.46k] ------------------ 150| 1.72k| ret = flb_utils_bool(val); 151| 1.72k| if (ret == -1) { ------------------ | Branch (151:13): [True: 0, False: 1.72k] ------------------ 152| 0| flb_error("[config map] invalid default value for boolean '%s=%s'", ------------------ | | 140| 0| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 0|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 0, False: 0] | | ------------------ | | 141| 0| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 0|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 153| 0| map->name, val); 154| 0| goto error; 155| 0| } 156| 1.72k| entry->val.boolean = flb_utils_bool(val); 157| 1.72k| } 158| 8.46k| else if (map->type == FLB_CONFIG_MAP_INT) { ------------------ | | 31| 8.46k|#define FLB_CONFIG_MAP_INT 2 /* integer */ ------------------ | Branch (158:14): [True: 1.71k, False: 6.74k] ------------------ 159| 1.71k| entry->val.i_num = atoi(val); 160| 1.71k| } 161| 6.74k| else if (map->type == FLB_CONFIG_MAP_DOUBLE) { ------------------ | | 33| 6.74k|#define FLB_CONFIG_MAP_DOUBLE 4 /* double */ ------------------ | Branch (161:14): [True: 1.71k, False: 5.03k] ------------------ 162| 1.71k| entry->val.d_num = atof(val); 163| 1.71k| } 164| 5.03k| else if (map->type == FLB_CONFIG_MAP_SIZE) { ------------------ | | 34| 5.03k|#define FLB_CONFIG_MAP_SIZE 5 /* string size to integer (e.g: 2M) */ ------------------ | Branch (164:14): [True: 825, False: 4.20k] ------------------ 165| 825| entry->val.s_num = flb_utils_size_to_bytes(val); 166| 825| } 167| 4.20k| else if (map->type == FLB_CONFIG_MAP_TIME) { ------------------ | | 35| 4.20k|#define FLB_CONFIG_MAP_TIME 6 /* string time to integer seconds (e.g: 2H) */ ------------------ | Branch (167:14): [True: 825, False: 3.38k] ------------------ 168| 825| entry->val.i_num = flb_utils_time_to_seconds(val); 169| 825| } 170| 3.38k| else if (map->type >= FLB_CONFIG_MAP_CLIST && ------------------ | | 38| 6.76k|#define FLB_CONFIG_MAP_CLIST 30 /* comma separated list of strings */ ------------------ | Branch (170:14): [True: 3.38k, False: 0] ------------------ 171| 3.38k| map->type <= FLB_CONFIG_MAP_SLIST_4) { ------------------ | | 48| 3.38k|#define FLB_CONFIG_MAP_SLIST_4 44 /* split up to 4 nodes + remaining data */ ------------------ | Branch (171:14): [True: 3.38k, False: 0] ------------------ 172| | 173| 3.38k| list = parse_string_map_to_list(map, val); 174| 3.38k| if (!list) { ------------------ | Branch (174:13): [True: 23, False: 3.36k] ------------------ 175| 23| flb_error("[config map] cannot parse list of values '%s'", val); ------------------ | | 140| 23| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 23|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 23, False: 0] | | ------------------ | | 141| 23| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 23|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 176| 23| goto error; 177| 23| } 178| | 179| 3.36k| entry->val.list = list; 180| 3.36k| list = NULL; 181| 3.36k| } 182| | 183| 11.8k| if (map->flags & FLB_CONFIG_MAP_MULT) { ------------------ | | 50| 11.8k|#define FLB_CONFIG_MAP_MULT 1 ------------------ | Branch (183:9): [True: 4.39k, False: 7.48k] ------------------ 184| 4.39k| mk_list_add(&entry->_head, map->value.mult); 185| 4.39k| } 186| | 187| 11.8k| return 0; 188| | 189| 24| error: 190| 24| if (map->flags & FLB_CONFIG_MAP_MULT) { ------------------ | | 50| 24|#define FLB_CONFIG_MAP_MULT 1 ------------------ | Branch (190:9): [True: 12, False: 12] ------------------ 191| 12| flb_free(entry); 192| 12| } 193| 24| return -1; 194| 11.9k|} flb_config_map.c:destroy_map_val: 362| 11.9k|{ 363| 11.9k| if (type == FLB_CONFIG_MAP_STR && value->val.str) { ------------------ | | 29| 23.9k|#define FLB_CONFIG_MAP_STR 0 /* string */ ------------------ | Branch (363:9): [True: 1.71k, False: 10.2k] | Branch (363:39): [True: 1.71k, False: 2] ------------------ 364| 1.71k| flb_sds_destroy(value->val.str); 365| 1.71k| } 366| 10.2k| else if ((type >= FLB_CONFIG_MAP_CLIST && ------------------ | | 38| 20.5k|#define FLB_CONFIG_MAP_CLIST 30 /* comma separated list of strings */ ------------------ | Branch (366:15): [True: 3.44k, False: 6.82k] ------------------ 367| 10.2k| type <= FLB_CONFIG_MAP_SLIST_4) && ------------------ | | 48| 3.44k|#define FLB_CONFIG_MAP_SLIST_4 44 /* split up to 4 nodes + remaining data */ ------------------ | Branch (367:15): [True: 3.44k, False: 0] ------------------ 368| 10.2k| value->val.list) { ------------------ | Branch (368:14): [True: 3.43k, False: 12] ------------------ 369| 3.43k| flb_slist_destroy(value->val.list); 370| 3.43k| flb_free(value->val.list); 371| 3.43k| } 372| 11.9k|} flb_config_map.c:is_internal_debug_property: 434| 1.50k|{ 435| |#ifdef FLB_HAVE_HTTP_CLIENT_DEBUG 436| | if (strncmp(prop_name, "_debug.http.", 12) == 0) { 437| | return FLB_TRUE; 438| | } 439| |#endif 440| | 441| 1.50k| return FLB_FALSE; ------------------ | | 25| 1.50k|#define FLB_FALSE 0 ------------------ 442| 1.50k|} flb_config_map.c:helper_map_options: 197| 1.05k|{ 198| 1.05k| flb_sds_t buf; 199| 1.05k| flb_sds_t tmp; 200| 1.05k| struct mk_list *head; 201| 1.05k| struct flb_config_map *m; 202| | 203| 1.05k| buf = flb_sds_create_size(256); 204| 1.05k| if (!buf) { ------------------ | Branch (204:9): [True: 3, False: 1.04k] ------------------ 205| 3| flb_errno(); ------------------ | | 201| 3|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 206| 3| return NULL; 207| 3| } 208| | 209| 1.04k| tmp = flb_sds_printf(&buf, "The following properties are allowed: "); 210| 1.04k| if (!tmp) { ------------------ | Branch (210:9): [True: 0, False: 1.04k] ------------------ 211| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 212| 0| flb_sds_destroy(buf); 213| 0| return NULL; 214| 0| } 215| 1.04k| buf = tmp; 216| | 217| 7.63k| mk_list_foreach(head, map) { ------------------ | | 205| 8.68k|#define mk_list_foreach(curr, head) for( curr = (head)->next; curr != (head); curr = curr->next ) | | ------------------ | | | Branch (205:63): [True: 7.63k, False: 1.04k] | | ------------------ ------------------ 218| 7.63k| m = mk_list_entry(head, struct flb_config_map, _head); ------------------ | | 214| 7.63k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 7.63k|#define container_of(ptr, type, member) ({ \ | | | | 39| 7.63k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 7.63k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 219| 7.63k| if (head->next != map) { ------------------ | Branch (219:13): [True: 6.58k, False: 1.04k] ------------------ 220| 6.58k| tmp = flb_sds_printf(&buf, "%s, ", m->name); 221| 6.58k| } 222| 1.04k| else { 223| 1.04k| if (mk_list_size(map) == 1) { ------------------ | Branch (223:17): [True: 0, False: 1.04k] ------------------ 224| 0| tmp = flb_sds_printf(&buf, "%s.", m->name); 225| 0| } 226| 1.04k| else { 227| 1.04k| tmp = flb_sds_printf(&buf, "and %s.", m->name); 228| 1.04k| } 229| 1.04k| } 230| | 231| 7.63k| if (!tmp) { ------------------ | Branch (231:13): [True: 0, False: 7.63k] ------------------ 232| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 233| 0| flb_sds_destroy(buf); 234| 0| return NULL; 235| 0| } 236| 7.63k| buf = tmp; 237| 7.63k| } 238| | 239| 1.04k| return buf; 240| 1.04k|} flb_config_map.c:properties_override_default: 534| 7.35k|{ 535| 7.35k| int len; 536| 7.35k| struct mk_list *head; 537| 7.35k| struct flb_kv *kv; 538| | 539| 7.35k| len = strlen(name); 540| | 541| 7.35k| mk_list_foreach(head, properties) { ------------------ | | 205| 14.1k|#define mk_list_foreach(curr, head) for( curr = (head)->next; curr != (head); curr = curr->next ) | | ------------------ | | | Branch (205:63): [True: 7.35k, False: 6.81k] | | ------------------ ------------------ 542| 7.35k| kv = mk_list_entry(head, struct flb_kv, _head); ------------------ | | 214| 7.35k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 7.35k|#define container_of(ptr, type, member) ({ \ | | | | 39| 7.35k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 7.35k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 543| 7.35k| if (flb_sds_len(kv->key) != len) { ------------------ | Branch (543:13): [True: 5.80k, False: 1.55k] ------------------ 544| 5.80k| continue; 545| 5.80k| } 546| | 547| 1.55k| if (strcasecmp(kv->key, name) == 0) { ------------------ | Branch (547:13): [True: 540, False: 1.01k] ------------------ 548| 540| return FLB_TRUE; ------------------ | | 26| 540|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 540|#define FLB_FALSE 0 | | ------------------ ------------------ 549| 540| } 550| 1.55k| } 551| | 552| 6.81k| return FLB_FALSE; ------------------ | | 25| 6.81k|#define FLB_FALSE 0 ------------------ 553| 7.35k|} flb_config_map.c:parse_string_map_to_list: 64| 3.45k|{ 65| 3.45k| int ret = -1; 66| 3.45k| int type; 67| 3.45k| int max_split = -1; 68| 3.45k| struct mk_list *list; 69| | 70| 3.45k| type = map->type; 71| | 72| | /* Allocate list head */ 73| 3.45k| list = flb_malloc(sizeof(struct mk_list)); 74| 3.45k| if (!list) { ------------------ | Branch (74:9): [True: 3, False: 3.45k] ------------------ 75| 3| flb_errno(); ------------------ | | 201| 3|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 76| 3| return NULL; 77| 3| } 78| 3.45k| mk_list_init(list); 79| | 80| | /* Determinate the max split value based on it type */ 81| 3.45k| if (map->type > FLB_CONFIG_MAP_CLIST && map->type < FLB_CONFIG_MAP_SLIST) { ------------------ | | 38| 6.90k|#define FLB_CONFIG_MAP_CLIST 30 /* comma separated list of strings */ ------------------ if (map->type > FLB_CONFIG_MAP_CLIST && map->type < FLB_CONFIG_MAP_SLIST) { ------------------ | | 44| 1.72k|#define FLB_CONFIG_MAP_SLIST 40 /* empty space separated list of strings */ ------------------ | Branch (81:9): [True: 1.72k, False: 1.72k] | Branch (81:45): [True: 0, False: 1.72k] ------------------ 82| 0| type = FLB_CONFIG_MAP_CLIST; ------------------ | | 38| 0|#define FLB_CONFIG_MAP_CLIST 30 /* comma separated list of strings */ ------------------ 83| 0| max_split = (map->type - FLB_CONFIG_MAP_CLIST); ------------------ | | 38| 0|#define FLB_CONFIG_MAP_CLIST 30 /* comma separated list of strings */ ------------------ 84| 0| } 85| 3.45k| else if (map->type > FLB_CONFIG_MAP_SLIST) { ------------------ | | 44| 3.45k|#define FLB_CONFIG_MAP_SLIST 40 /* empty space separated list of strings */ ------------------ | Branch (85:14): [True: 1.72k, False: 1.72k] ------------------ 86| 1.72k| type = FLB_CONFIG_MAP_SLIST; ------------------ | | 44| 1.72k|#define FLB_CONFIG_MAP_SLIST 40 /* empty space separated list of strings */ ------------------ 87| 1.72k| max_split = (map->type - FLB_CONFIG_MAP_SLIST); ------------------ | | 44| 1.72k|#define FLB_CONFIG_MAP_SLIST 40 /* empty space separated list of strings */ ------------------ 88| 1.72k| } 89| | 90| 3.45k| if (type == FLB_CONFIG_MAP_CLIST) { ------------------ | | 38| 3.45k|#define FLB_CONFIG_MAP_CLIST 30 /* comma separated list of strings */ ------------------ | Branch (90:9): [True: 1.72k, False: 1.72k] ------------------ 91| 1.72k| ret = flb_slist_split_string(list, str, ',', max_split); 92| 1.72k| } 93| 1.72k| else if (type == FLB_CONFIG_MAP_SLIST) { ------------------ | | 44| 1.72k|#define FLB_CONFIG_MAP_SLIST 40 /* empty space separated list of strings */ ------------------ | Branch (93:14): [True: 1.72k, False: 0] ------------------ 94| 1.72k| ret = flb_slist_split_tokens(list, str, max_split); 95| 1.72k| } 96| | 97| 3.45k| if (ret == -1) { ------------------ | Branch (97:9): [True: 22, False: 3.43k] ------------------ 98| 22| flb_error("[config map] error reading list of options"); ------------------ | | 140| 22| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 22|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 22, False: 0] | | ------------------ | | 141| 22| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 22|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 99| 22| flb_free(list); 100| 22| return NULL; 101| 22| } 102| | 103| 3.43k| return list; 104| 3.45k|} flb_config_map.c:check_list_size: 31| 56|{ 32| 56| int len; 33| | 34| 56| len = mk_list_size(list); 35| 56| if (type == FLB_CONFIG_MAP_SLIST_1 || type == FLB_CONFIG_MAP_CLIST_1) { ------------------ | | 45| 112|#define FLB_CONFIG_MAP_SLIST_1 41 /* split up to 1 node + remaining data */ ------------------ if (type == FLB_CONFIG_MAP_SLIST_1 || type == FLB_CONFIG_MAP_CLIST_1) { ------------------ | | 39| 56|#define FLB_CONFIG_MAP_CLIST_1 31 /* split up to 1 node + remaining data */ ------------------ | Branch (35:9): [True: 0, False: 56] | Branch (35:43): [True: 0, False: 56] ------------------ 36| 0| if (len < 1) { ------------------ | Branch (36:13): [True: 0, False: 0] ------------------ 37| 0| return -1; 38| 0| } 39| 0| } 40| 56| else if (type == FLB_CONFIG_MAP_SLIST_2 || type == FLB_CONFIG_MAP_CLIST_2) { ------------------ | | 46| 112|#define FLB_CONFIG_MAP_SLIST_2 42 /* split up to 2 nodes + remaining data */ ------------------ else if (type == FLB_CONFIG_MAP_SLIST_2 || type == FLB_CONFIG_MAP_CLIST_2) { ------------------ | | 40| 56|#define FLB_CONFIG_MAP_CLIST_2 32 /* split up to 2 nodes + remaining data */ ------------------ | Branch (40:14): [True: 0, False: 56] | Branch (40:48): [True: 0, False: 56] ------------------ 41| 0| if (len < 2) { ------------------ | Branch (41:13): [True: 0, False: 0] ------------------ 42| 0| return -1; 43| 0| } 44| 0| } 45| 56| else if (type == FLB_CONFIG_MAP_SLIST_3 || type == FLB_CONFIG_MAP_CLIST_3) { ------------------ | | 47| 112|#define FLB_CONFIG_MAP_SLIST_3 43 /* split up to 3 nodes + remaining data */ ------------------ else if (type == FLB_CONFIG_MAP_SLIST_3 || type == FLB_CONFIG_MAP_CLIST_3) { ------------------ | | 41| 56|#define FLB_CONFIG_MAP_CLIST_3 33 /* split up to 3 nodes + remaining data */ ------------------ | Branch (45:14): [True: 0, False: 56] | Branch (45:48): [True: 0, False: 56] ------------------ 46| 0| if (len < 3) { ------------------ | Branch (46:13): [True: 0, False: 0] ------------------ 47| 0| return -1; 48| 0| } 49| 0| } 50| 56| else if (type == FLB_CONFIG_MAP_SLIST_4 || type == FLB_CONFIG_MAP_CLIST_4) { ------------------ | | 48| 112|#define FLB_CONFIG_MAP_SLIST_4 44 /* split up to 4 nodes + remaining data */ ------------------ else if (type == FLB_CONFIG_MAP_SLIST_4 || type == FLB_CONFIG_MAP_CLIST_4) { ------------------ | | 42| 14|#define FLB_CONFIG_MAP_CLIST_4 34 /* split up to 4 nodes + remaining data */ ------------------ | Branch (50:14): [True: 42, False: 14] | Branch (50:48): [True: 0, False: 14] ------------------ 51| 42| if (len < 4) { ------------------ | Branch (51:13): [True: 29, False: 13] ------------------ 52| 29| return -1; 53| 29| } 54| 42| } 55| | 56| 27| return 0; 57| 56|} flb_env_create: 70| 2.04k|{ 71| 2.04k| struct flb_env *env; 72| 2.04k| struct flb_hash_table *ht; 73| | 74| 2.04k| env = flb_malloc(sizeof(struct flb_env)); 75| 2.04k| if (!env) { ------------------ | Branch (75:9): [True: 1, False: 2.04k] ------------------ 76| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 77| 1| return NULL; 78| 1| } 79| | 80| | /* Create the hash-table */ 81| 2.04k| ht = flb_hash_table_create(FLB_HASH_TABLE_EVICT_NONE, FLB_ENV_SIZE, -1); ------------------ | | 32| 2.04k|#define FLB_HASH_TABLE_EVICT_NONE 0 ------------------ ht = flb_hash_table_create(FLB_HASH_TABLE_EVICT_NONE, FLB_ENV_SIZE, -1); ------------------ | | 26| 2.04k|#define FLB_ENV_SIZE 64 ------------------ 82| 2.04k| if (!ht) { ------------------ | Branch (82:9): [True: 9, False: 2.03k] ------------------ 83| 9| flb_free(env); 84| 9| return NULL; 85| 9| } 86| | 87| 2.03k| env->warn_unused = FLB_TRUE; ------------------ | | 26| 2.03k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 2.03k|#define FLB_FALSE 0 | | ------------------ ------------------ 88| 2.03k| env->ht = ht; 89| 2.03k| env_preset(env); 90| | 91| 2.03k| return env; 92| 2.04k|} flb_env_destroy: 95| 2.03k|{ 96| 2.03k| flb_hash_table_destroy(env->ht); 97| 2.03k| flb_free(env); 98| 2.03k|} flb_env_var_translate: 161| 11.9k|{ 162| 11.9k| int i; 163| 11.9k| int len; 164| 11.9k| int v_len; 165| 11.9k| int e_len; 166| 11.9k| int pre_var; 167| 11.9k| int have_var = FLB_FALSE; ------------------ | | 25| 11.9k|#define FLB_FALSE 0 ------------------ 168| 11.9k| const char *env_var = NULL; 169| 11.9k| char *v_start = NULL; 170| 11.9k| char *v_end = NULL; 171| 11.9k| char tmp[4096]; 172| 11.9k| flb_sds_t buf; 173| 11.9k| flb_sds_t s; 174| | 175| 11.9k| if (!value) { ------------------ | Branch (175:9): [True: 0, False: 11.9k] ------------------ 176| 0| return NULL; 177| 0| } 178| | 179| 11.9k| len = strlen(value); 180| 11.9k| buf = flb_sds_create_size(len); 181| 11.9k| if (!buf) { ------------------ | Branch (181:9): [True: 7, False: 11.9k] ------------------ 182| 7| return NULL; 183| 7| } 184| | 185| 11.9k| for (i = 0; i < len; i++) { ------------------ | Branch (185:17): [True: 11.9k, False: 0] ------------------ 186| 11.9k| v_start = strstr(value + i, "${"); 187| 11.9k| if (!v_start) { ------------------ | Branch (187:13): [True: 11.9k, False: 0] ------------------ 188| 11.9k| break; 189| 11.9k| } 190| | 191| 0| v_end = strstr(value + i, "}"); 192| 0| if (!v_end) { ------------------ | Branch (192:13): [True: 0, False: 0] ------------------ 193| 0| break; 194| 0| } 195| | 196| 0| v_start += 2; 197| 0| v_len = v_end - v_start; 198| 0| if (v_len <= 0 || v_len >= sizeof(tmp)) { ------------------ | Branch (198:13): [True: 0, False: 0] | Branch (198:27): [True: 0, False: 0] ------------------ 199| 0| break; 200| 0| } 201| | 202| | /* variable */ 203| 0| strncpy(tmp, v_start, v_len); 204| 0| tmp[v_len] = '\0'; 205| 0| have_var = FLB_TRUE; ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ 206| | 207| | /* Append pre-variable content */ 208| 0| pre_var = (v_start - 2) - (value + i); 209| 0| if (pre_var > 0) { ------------------ | Branch (209:13): [True: 0, False: 0] ------------------ 210| 0| s = buf_append(buf, value + i, (v_start - 2) - (value + i)); 211| 0| if (!s) { ------------------ | Branch (211:17): [True: 0, False: 0] ------------------ 212| 0| flb_sds_destroy(buf); 213| 0| return NULL; 214| 0| } 215| 0| if (s != buf) { ------------------ | Branch (215:17): [True: 0, False: 0] ------------------ 216| 0| buf = s; 217| 0| } 218| 0| } 219| | 220| | /* Lookup the variable in our env-hash */ 221| 0| env_var = flb_env_get(env, tmp); 222| 0| if (env_var) { ------------------ | Branch (222:13): [True: 0, False: 0] ------------------ 223| 0| e_len = strlen(env_var); 224| 0| s = buf_append(buf, env_var, e_len); 225| 0| if (!s) { ------------------ | Branch (225:17): [True: 0, False: 0] ------------------ 226| 0| flb_sds_destroy(buf); 227| 0| return NULL; 228| 0| } 229| 0| if (s != buf) { ------------------ | Branch (229:17): [True: 0, False: 0] ------------------ 230| 0| buf = s; 231| 0| } 232| 0| } 233| 0| else if (env->warn_unused == FLB_TRUE) { ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ | Branch (233:18): [True: 0, False: 0] ------------------ 234| 0| flb_warn("[env] variable ${%s} is used but not set", tmp); ------------------ | | 149| 0| if (flb_log_check(FLB_LOG_WARN)) \ | | ------------------ | | | | 40| 0|#define FLB_LOG_WARN 2 | | ------------------ | | | Branch (149:9): [True: 0, False: 0] | | ------------------ | | 150| 0| flb_log_print(FLB_LOG_WARN, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 40| 0|#define FLB_LOG_WARN 2 | | ------------------ ------------------ 235| 0| } 236| 0| i += (v_start - (value + i)) + v_len; 237| 0| } 238| | 239| | /* Copy the remaining value into our buffer */ 240| 11.9k| if (v_end) { ------------------ | Branch (240:9): [True: 0, False: 11.9k] ------------------ 241| 0| if (have_var == FLB_TRUE && (value + len) - (v_end + 1) > 0) { ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ | Branch (241:13): [True: 0, False: 0] | Branch (241:37): [True: 0, False: 0] ------------------ 242| 0| s = buf_append(buf, v_end + 1, (value + len) - (v_end + 1)); 243| 0| if (!s) { ------------------ | Branch (243:17): [True: 0, False: 0] ------------------ 244| 0| flb_sds_destroy(buf); 245| 0| return NULL; 246| 0| } 247| 0| if (s != buf) { ------------------ | Branch (247:17): [True: 0, False: 0] ------------------ 248| 0| buf = s; 249| 0| } 250| 0| } 251| 0| } 252| | 253| 11.9k| if (flb_sds_len(buf) == 0) { ------------------ | Branch (253:9): [True: 11.9k, False: 0] ------------------ 254| | /* 255| | * If the output length buffer is zero, it could mean: 256| | * 257| | * - just one variable was given and it don't have any value 258| | * - no variables given (keep original value) 259| | * 260| | * In order to avoid problems in the caller, if a variable is null 261| | * and is the only one content available, return a new empty memory 262| | * string. 263| | */ 264| 11.9k| if (have_var == FLB_TRUE) { ------------------ | | 26| 11.9k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 11.9k|#define FLB_FALSE 0 | | ------------------ ------------------ | Branch (264:13): [True: 0, False: 11.9k] ------------------ 265| 0| return flb_sds_copy(buf, "", 0); 266| 0| } 267| 11.9k| else { 268| 11.9k| return flb_sds_copy(buf, value, len); 269| 11.9k| } 270| 11.9k| } 271| | 272| 0| return buf; 273| 11.9k|} flb_env.c:env_preset: 43| 2.03k|{ 44| 2.03k| int ret; 45| 2.03k| char *buf; 46| 2.03k| char tmp[512]; 47| | 48| | /* 49| | * ${HOSTNAME} this variable is very useful to identify records, 50| | * despite this variable is recognized by the Shell, that does not 51| | * means that is exposed as a real environment variable, e.g: 52| | * 53| | * 1. $ echo $HOSTNAME 54| | * monotop 55| | * 2. $ env | grep HOSTNAME 56| | * (nothing) 57| | */ 58| 2.03k| buf = getenv("HOSTNAME"); 59| 2.03k| if (!buf) { ------------------ | Branch (59:9): [True: 0, False: 2.03k] ------------------ 60| 0| ret = gethostname(tmp, sizeof(tmp) - 1); 61| 0| if (ret == 0) { ------------------ | Branch (61:13): [True: 0, False: 0] ------------------ 62| 0| flb_env_set(env, "HOSTNAME", tmp); 63| 0| } 64| 0| } 65| | 66| 2.03k| return 0; 67| 2.03k|} flb_hash_table_create: 43| 2.04k|{ 44| 2.04k| int i; 45| 2.04k| struct flb_hash_table_chain *tmp; 46| 2.04k| struct flb_hash_table *ht; 47| | 48| 2.04k| if (size <= 0) { ------------------ | Branch (48:9): [True: 0, False: 2.04k] ------------------ 49| 0| return NULL; 50| 0| } 51| | 52| 2.04k| ht = flb_malloc(sizeof(struct flb_hash_table)); 53| 2.04k| if (!ht) { ------------------ | Branch (53:9): [True: 6, False: 2.03k] ------------------ 54| 6| flb_errno(); ------------------ | | 201| 6|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 55| 6| return NULL; 56| 6| } 57| | 58| 2.03k| mk_list_init(&ht->entries); 59| 2.03k| ht->evict_mode = evict_mode; 60| 2.03k| ht->max_entries = max_entries; 61| 2.03k| ht->size = size; 62| 2.03k| ht->total_count = 0; 63| 2.03k| ht->cache_ttl = 0; 64| 2.03k| ht->table = flb_calloc(1, sizeof(struct flb_hash_table_chain) * size); 65| 2.03k| if (!ht->table) { ------------------ | Branch (65:9): [True: 3, False: 2.03k] ------------------ 66| 3| flb_errno(); ------------------ | | 201| 3|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 67| 3| flb_free(ht); 68| 3| return NULL; 69| 3| } 70| | 71| | /* Initialize chains list head */ 72| 132k| for (i = 0; i < size; i++) { ------------------ | Branch (72:17): [True: 130k, False: 2.03k] ------------------ 73| 130k| tmp = &ht->table[i]; 74| 130k| tmp->count = 0; 75| 130k| mk_list_init(&tmp->chains); 76| 130k| } 77| | 78| 2.03k| return ht; 79| 2.03k|} flb_hash_table_destroy: 131| 2.03k|{ 132| 2.03k| int i; 133| 2.03k| struct mk_list *tmp; 134| 2.03k| struct mk_list *head; 135| 2.03k| struct flb_hash_table_entry *entry; 136| 2.03k| struct flb_hash_table_chain *table; 137| | 138| 132k| for (i = 0; i < ht->size; i++) { ------------------ | Branch (138:17): [True: 130k, False: 2.03k] ------------------ 139| 130k| table = &ht->table[i]; 140| 130k| mk_list_foreach_safe(head, tmp, &table->chains) { ------------------ | | 207| 130k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 0, False: 130k] | | ------------------ ------------------ 141| 0| entry = mk_list_entry(head, struct flb_hash_table_entry, _head); ------------------ | | 214| 0|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 0|#define container_of(ptr, type, member) ({ \ | | | | 39| 0| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 0| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 142| 0| flb_hash_table_entry_free(ht, entry); 143| 0| } 144| 130k| } 145| | 146| 2.03k| flb_free(ht->table); 147| 2.03k| flb_free(ht); 148| 2.03k|} flb_kernel_info: 70| 2.04k|{ 71| | 72| 2.04k| int a, b, c; 73| 2.04k| int len; 74| 2.04k| int pos; 75| 2.04k| char *p, *t; 76| 2.04k| char *tmp; 77| 2.04k| struct utsname uts; 78| 2.04k| struct flb_kernel *kernel; 79| | 80| 2.04k| if (uname(&uts) == -1) { ------------------ | Branch (80:9): [True: 0, False: 2.04k] ------------------ 81| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 82| 0| return NULL; 83| 0| } 84| 2.04k| len = strlen(uts.release); 85| | 86| | /* Fixme: this don't support Linux Kernel 10.x.x :P */ 87| 2.04k| a = (*uts.release - '0'); 88| | 89| | /* Second number */ 90| 2.04k| p = (uts.release) + 2; 91| 2.04k| pos = mk_string_char_search(p, '.', len - 2); 92| 2.04k| if (pos <= 0) { ------------------ | Branch (92:9): [True: 0, False: 2.04k] ------------------ 93| | /* Some Debian systems uses a different notation, e.g: 3.14-2-amd64 */ 94| 0| pos = mk_string_char_search(p, '-', len - 2); 95| 0| if (pos <= 0) { ------------------ | Branch (95:13): [True: 0, False: 0] ------------------ 96| 0| return NULL; 97| 0| } 98| 0| } 99| | 100| 2.04k| tmp = mk_string_copy_substr(p, 0, pos); 101| 2.04k| if (!tmp) { ------------------ | Branch (101:9): [True: 0, False: 2.04k] ------------------ 102| 0| return NULL; 103| 0| } 104| 2.04k| b = atoi(tmp); 105| 2.04k| mk_mem_free(tmp); 106| | 107| | /* Last number (it needs filtering) */ 108| 2.04k| t = p = p + pos + 1; 109| 2.04k| do { 110| 2.04k| t++; 111| 2.04k| } while (isdigit(*t)); 112| | 113| 2.04k| tmp = mk_string_copy_substr(p, 0, t - p); 114| 2.04k| if (!tmp) { ------------------ | Branch (114:9): [True: 0, False: 2.04k] ------------------ 115| 0| return NULL; 116| 0| } 117| 2.04k| c = atoi(tmp); 118| 2.04k| mk_mem_free(tmp); 119| | 120| 2.04k| kernel = flb_malloc(sizeof(struct flb_kernel)); 121| 2.04k| if (!kernel) { ------------------ | Branch (121:9): [True: 3, False: 2.04k] ------------------ 122| 3| flb_errno(); ------------------ | | 201| 3|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 123| 3| return NULL; 124| 3| } 125| 2.04k| kernel->minor = a; 126| 2.04k| kernel->major = b; 127| 2.04k| kernel->patch = c; 128| 2.04k| kernel->s_version.data = flb_malloc(16); 129| | 130| 2.04k| if (!kernel->s_version.data) { ------------------ | Branch (130:9): [True: 1, False: 2.04k] ------------------ 131| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 132| 1| flb_free(kernel); 133| 1| return NULL; 134| 1| } 135| | 136| 2.04k| len = snprintf(kernel->s_version.data, 16, "%i.%i.%i", a, b, c); 137| 2.04k| if (len == -1) { ------------------ | Branch (137:9): [True: 0, False: 2.04k] ------------------ 138| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 139| 0| flb_free(kernel->s_version.data); 140| 0| flb_free(kernel); 141| 0| return NULL; 142| 0| } 143| 2.04k| kernel->s_version.len = len; 144| 2.04k| kernel->n_version = FLB_KERNEL_VERSION(a, b, c); ------------------ | | 27| 2.04k|#define FLB_KERNEL_VERSION(a, b, c) (((a) << 16) + ((b) << 8) + (c)) ------------------ 145| | 146| 2.04k| return kernel; 147| 2.04k|} flb_kv_init: 26| 1.73k|{ 27| 1.73k| mk_list_init(list); 28| 1.73k|} flb_kv_item_create_len: 33| 1.73k|{ 34| 1.73k| struct flb_kv *kv; 35| | 36| 1.73k| kv = flb_calloc(1, sizeof(struct flb_kv)); 37| 1.73k| if (!kv) { ------------------ | Branch (37:9): [True: 1, False: 1.73k] ------------------ 38| 1| flb_errno(); ------------------ | | 201| 1|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 39| 1| return NULL; 40| 1| } 41| | 42| 1.73k| kv->key = flb_sds_create_len(k_buf, k_len); 43| 1.73k| if (!kv->key) { ------------------ | Branch (43:9): [True: 2, False: 1.73k] ------------------ 44| 2| flb_free(kv); 45| 2| return NULL; 46| 2| } 47| | 48| 1.73k| if (v_len > 0) { ------------------ | Branch (48:9): [True: 1.64k, False: 82] ------------------ 49| 1.64k| kv->val = flb_sds_create_len(v_buf, v_len); 50| 1.64k| if (!kv->val) { ------------------ | Branch (50:13): [True: 1, False: 1.64k] ------------------ 51| 1| flb_sds_destroy(kv->key); 52| 1| flb_free(kv); 53| 1| return NULL; 54| 1| } 55| 1.64k| } 56| | 57| 1.73k| mk_list_add(&kv->_head, list); 58| 1.73k| return kv; 59| 1.73k|} flb_kv_item_create: 63| 1.73k|{ 64| 1.73k| int k_len; 65| 1.73k| int v_len = 0; 66| | 67| 1.73k| if (!k_buf) { ------------------ | Branch (67:9): [True: 0, False: 1.73k] ------------------ 68| 0| return NULL; 69| 0| } 70| 1.73k| k_len = strlen(k_buf); 71| | 72| 1.73k| if (v_buf) { ------------------ | Branch (72:9): [True: 1.73k, False: 0] ------------------ 73| 1.73k| v_len = strlen(v_buf); 74| 1.73k| } 75| | 76| 1.73k| return flb_kv_item_create_len(list, k_buf, k_len, v_buf, v_len); 77| 1.73k|} flb_kv_item_destroy: 80| 1.73k|{ 81| 1.73k| if (kv->key) { ------------------ | Branch (81:9): [True: 1.73k, False: 0] ------------------ 82| 1.73k| flb_sds_destroy(kv->key); 83| 1.73k| } 84| | 85| 1.73k| if (kv->val) { ------------------ | Branch (85:9): [True: 1.64k, False: 82] ------------------ 86| 1.64k| flb_sds_destroy(kv->val); 87| 1.64k| } 88| | 89| 1.73k| mk_list_del(&kv->_head); 90| 1.73k| flb_free(kv); 91| 1.73k|} flb_kv_release: 94| 5.83k|{ 95| 5.83k| struct mk_list *tmp; 96| 5.83k| struct mk_list *head; 97| 5.83k| struct flb_kv *kv; 98| | 99| 5.83k| mk_list_foreach_safe(head, tmp, list) { ------------------ | | 207| 7.56k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 1.73k, False: 5.83k] | | ------------------ ------------------ 100| 1.73k| kv = mk_list_entry(head, struct flb_kv, _head); ------------------ | | 214| 1.73k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 1.73k|#define container_of(ptr, type, member) ({ \ | | | | 39| 1.73k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 1.73k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 101| 1.73k| flb_kv_item_destroy(kv); 102| 1.73k| } 103| 5.83k|} flb_log_construct: 497| 2.51k|{ 498| 2.51k| int body_size; 499| 2.51k| int ret; 500| 2.51k| int len; 501| 2.51k| int total; 502| 2.51k| time_t now; 503| 2.51k| const char *header_color = NULL; 504| 2.51k| const char *header_title = NULL; 505| 2.51k| const char *bold_color = ANSI_BOLD; ------------------ | | 47| 2.51k|#define ANSI_BOLD "\033[1m" ------------------ 506| 2.51k| const char *reset_color = ANSI_RESET; ------------------ | | 46| 2.51k|#define ANSI_RESET "\033[0m" ------------------ 507| 2.51k| struct tm result; 508| 2.51k| struct tm *current; 509| | 510| 2.51k| switch (type) { ------------------ | Branch (510:13): [True: 0, False: 2.51k] ------------------ 511| 0| case FLB_LOG_HELP: ------------------ | | 44| 0|#define FLB_LOG_HELP 6 /* unused by log level */ ------------------ | Branch (511:5): [True: 0, False: 2.51k] ------------------ 512| 0| header_title = "help"; 513| 0| header_color = ANSI_CYAN; ------------------ | | 48| 0|#define ANSI_CYAN "\033[96m" ------------------ 514| 0| break; 515| 0| case FLB_LOG_INFO: ------------------ | | 41| 0|#define FLB_LOG_INFO 3 /* default */ ------------------ | Branch (515:5): [True: 0, False: 2.51k] ------------------ 516| 0| header_title = "info"; 517| 0| header_color = ANSI_GREEN; ------------------ | | 53| 0|#define ANSI_GREEN "\033[92m" ------------------ 518| 0| break; 519| 0| case FLB_LOG_WARN: ------------------ | | 40| 0|#define FLB_LOG_WARN 2 ------------------ | Branch (519:5): [True: 0, False: 2.51k] ------------------ 520| 0| header_title = "warn"; 521| 0| header_color = ANSI_YELLOW; ------------------ | | 51| 0|#define ANSI_YELLOW "\033[93m" ------------------ 522| 0| break; 523| 2.51k| case FLB_LOG_ERROR: ------------------ | | 39| 2.51k|#define FLB_LOG_ERROR 1 ------------------ | Branch (523:5): [True: 2.51k, False: 0] ------------------ 524| 2.51k| header_title = "error"; 525| 2.51k| header_color = ANSI_RED; ------------------ | | 50| 2.51k|#define ANSI_RED "\033[91m" ------------------ 526| 2.51k| break; 527| 0| case FLB_LOG_DEBUG: ------------------ | | 42| 0|#define FLB_LOG_DEBUG 4 ------------------ | Branch (527:5): [True: 0, False: 2.51k] ------------------ 528| 0| header_title = "debug"; 529| 0| header_color = ANSI_YELLOW; ------------------ | | 51| 0|#define ANSI_YELLOW "\033[93m" ------------------ 530| 0| break; 531| 0| case FLB_LOG_IDEBUG: ------------------ | | 46| 0|#define FLB_LOG_IDEBUG 10 ------------------ | Branch (531:5): [True: 0, False: 2.51k] ------------------ 532| 0| header_title = "debug"; 533| 0| header_color = ANSI_CYAN; ------------------ | | 48| 0|#define ANSI_CYAN "\033[96m" ------------------ 534| 0| break; 535| 0| case FLB_LOG_TRACE: ------------------ | | 43| 0|#define FLB_LOG_TRACE 5 ------------------ | Branch (535:5): [True: 0, False: 2.51k] ------------------ 536| 0| header_title = "trace"; 537| 0| header_color = ANSI_BLUE; ------------------ | | 52| 0|#define ANSI_BLUE "\033[94m" ------------------ 538| 0| break; 539| 2.51k| } 540| | 541| | #ifdef FLB_LOG_NO_CONTROL_CHARS 542| | header_color = ""; 543| | bold_color = ""; 544| | reset_color = ""; 545| | #else 546| | /* Only print colors to a terminal */ 547| 2.51k| if (!isatty(STDOUT_FILENO)) { ------------------ | Branch (547:9): [True: 2.51k, False: 0] ------------------ 548| 2.51k| header_color = ""; 549| 2.51k| bold_color = ""; 550| 2.51k| reset_color = ""; 551| 2.51k| } 552| 2.51k| #endif // FLB_LOG_NO_CONTROL_CHARS 553| | 554| 2.51k| now = time(NULL); 555| 2.51k| current = localtime_r(&now, &result); 556| | 557| 2.51k| if (current == NULL) { ------------------ | Branch (557:9): [True: 0, False: 2.51k] ------------------ 558| 0| return -1; 559| 0| } 560| | 561| 2.51k| len = snprintf(msg->msg, sizeof(msg->msg) - 1, 562| 2.51k| "%s[%s%i/%02i/%02i %02i:%02i:%02i%s]%s [%s%5s%s] ", 563| | /* time */ /* type */ 564| | 565| | /* time variables */ 566| 2.51k| bold_color, reset_color, 567| 2.51k| current->tm_year + 1900, 568| 2.51k| current->tm_mon + 1, 569| 2.51k| current->tm_mday, 570| 2.51k| current->tm_hour, 571| 2.51k| current->tm_min, 572| 2.51k| current->tm_sec, 573| 2.51k| bold_color, reset_color, 574| | 575| | /* type format */ 576| 2.51k| header_color, header_title, reset_color); 577| | 578| 2.51k| body_size = (sizeof(msg->msg) - 2) - len; 579| 2.51k| total = vsnprintf(msg->msg + len, 580| 2.51k| body_size, 581| 2.51k| fmt, *args); 582| 2.51k| if (total < 0) { ------------------ | Branch (582:9): [True: 0, False: 2.51k] ------------------ 583| 0| return -1; 584| 0| } 585| 2.51k| ret = total; /* ret means a buffer size need to save log body */ 586| | 587| 2.51k| total = strlen(msg->msg + len) + len; 588| 2.51k| msg->msg[total++] = '\n'; 589| 2.51k| msg->msg[total] = '\0'; 590| 2.51k| msg->size = total; 591| | 592| 2.51k| *ret_len = len; 593| | 594| 2.51k| if (ret >= body_size) { ------------------ | Branch (594:9): [True: 144, False: 2.37k] ------------------ 595| | /* log is truncated */ 596| 144| return ret - body_size; 597| 144| } 598| | 599| 2.37k| return 0; 600| 2.51k|} flb_log_print: 629| 2.51k|{ 630| 2.51k| int n; 631| 2.51k| int len; 632| 2.51k| int ret; 633| 2.51k| struct log_message msg = {0}; 634| 2.51k| va_list args; 635| | 636| 2.51k| struct flb_worker *w; 637| | 638| 2.51k| va_start(args, fmt); 639| 2.51k| ret = flb_log_construct(&msg, &len, type, file, line, fmt, &args); 640| 2.51k| va_end(args); 641| | 642| 2.51k| if (ret < 0) { ------------------ | Branch (642:9): [True: 0, False: 2.51k] ------------------ 643| 0| return; 644| 0| } 645| | 646| 2.51k| w = flb_worker_get(); 647| 2.51k| if (w) { ------------------ | Branch (647:9): [True: 0, False: 2.51k] ------------------ 648| 0| n = flb_pipe_write_all(w->log[1], &msg, sizeof(msg)); 649| 0| if (n == -1) { ------------------ | Branch (649:13): [True: 0, False: 0] ------------------ 650| 0| fprintf(stderr, "%s", (char *) msg.msg); 651| 0| perror("write"); 652| 0| } 653| 0| } 654| 2.51k| else { 655| 2.51k| fprintf(stderr, "%s", (char *) msg.msg); 656| 2.51k| } 657| | 658| | #ifdef FLB_HAVE_AWS_ERROR_REPORTER 659| | if (is_error_reporting_enabled()) { 660| | if (type == FLB_LOG_ERROR) { 661| | flb_aws_error_reporter_write(error_reporter, msg.msg + len); 662| | } 663| | 664| | flb_aws_error_reporter_clean(error_reporter); 665| | } 666| | #endif 667| 2.51k|} flb_errno_print: 670| 484|{ 671| 484| char buf[256]; 672| | 673| 484| strerror_r(errnum, buf, sizeof(buf) - 1); 674| 484| flb_error("[%s:%i errno=%i] %s", file, line, errnum, buf); ------------------ | | 140| 484| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 484|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 484, False: 0] | | ------------------ | | 141| 484| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 484|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 675| 484| return 0; 676| 484|} flb_parser_create: 160| 4.05k|{ 161| 4.05k| int ret; 162| 4.05k| int len; 163| 4.05k| int diff = 0; 164| 4.05k| int size; 165| 4.05k| int is_epoch = FLB_FALSE; ------------------ | | 25| 4.05k|#define FLB_FALSE 0 ------------------ 166| 4.05k| char *tmp; 167| 4.05k| char *timeptr; 168| 4.05k| struct mk_list *head; 169| 4.05k| struct flb_parser *p; 170| 4.05k| struct flb_regex *regex; 171| | 172| | /* Iterate current parsers and make sure the new one don't exists */ 173| 4.05k| mk_list_foreach(head, &config->parsers) { ------------------ | | 205| 6.07k|#define mk_list_foreach(curr, head) for( curr = (head)->next; curr != (head); curr = curr->next ) | | ------------------ | | | Branch (205:63): [True: 2.02k, False: 4.05k] | | ------------------ ------------------ 174| 2.02k| p = mk_list_entry(head, struct flb_parser, _head); ------------------ | | 214| 2.02k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 2.02k|#define container_of(ptr, type, member) ({ \ | | | | 39| 2.02k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 2.02k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 175| 2.02k| if (p->name && strcmp(p->name, name) == 0) { ------------------ | Branch (175:13): [True: 2.01k, False: 2] | Branch (175:24): [True: 0, False: 2.01k] ------------------ 176| 0| flb_error("[parser] parser named '%s' already exists, skip.", ------------------ | | 140| 0| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 0|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 0, False: 0] | | ------------------ | | 141| 0| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 0|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 177| 0| name); 178| 0| return NULL; 179| 0| } 180| 2.02k| } 181| | 182| | /* Allocate context */ 183| 4.05k| p = flb_calloc(1, sizeof(struct flb_parser)); 184| 4.05k| if (!p) { ------------------ | Branch (184:9): [True: 4, False: 4.05k] ------------------ 185| 4| flb_errno(); ------------------ | | 201| 4|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 186| 4| return NULL; 187| 4| } 188| 4.05k| p->decoders = decoders; 189| 4.05k| mk_list_add(&p->_head, &config->parsers); 190| | 191| | /* Format lookup */ 192| 4.05k| if (strcasecmp(format, "regex") == 0) { ------------------ | Branch (192:9): [True: 2.01k, False: 2.03k] ------------------ 193| 2.01k| p->type = FLB_PARSER_REGEX; ------------------ | | 30| 2.01k|#define FLB_PARSER_REGEX 1 ------------------ 194| 2.01k| } 195| 2.03k| else if (strcasecmp(format, "json") == 0) { ------------------ | Branch (195:14): [True: 2.03k, False: 0] ------------------ 196| 2.03k| p->type = FLB_PARSER_JSON; ------------------ | | 31| 2.03k|#define FLB_PARSER_JSON 2 ------------------ 197| 2.03k| } 198| 0| else if (strcasecmp(format, "ltsv") == 0) { ------------------ | Branch (198:14): [True: 0, False: 0] ------------------ 199| 0| p->type = FLB_PARSER_LTSV; ------------------ | | 32| 0|#define FLB_PARSER_LTSV 3 ------------------ 200| 0| } 201| 0| else if (strcasecmp(format, "logfmt") == 0) { ------------------ | Branch (201:14): [True: 0, False: 0] ------------------ 202| 0| p->type = FLB_PARSER_LOGFMT; ------------------ | | 33| 0|#define FLB_PARSER_LOGFMT 4 ------------------ 203| 0| } 204| 0| else { 205| 0| flb_error("[parser:%s] Invalid format %s", name, format); ------------------ | | 140| 0| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 0|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 0, False: 0] | | ------------------ | | 141| 0| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 0|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 206| 0| mk_list_del(&p->_head); 207| 0| flb_free(p); 208| 0| return NULL; 209| 0| } 210| | 211| 4.05k| if (p->type == FLB_PARSER_REGEX) { ------------------ | | 30| 4.05k|#define FLB_PARSER_REGEX 1 ------------------ | Branch (211:9): [True: 2.01k, False: 2.03k] ------------------ 212| 2.01k| if (!p_regex) { ------------------ | Branch (212:13): [True: 0, False: 2.01k] ------------------ 213| 0| flb_error("[parser:%s] Invalid regex pattern", name); ------------------ | | 140| 0| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 0|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 0, False: 0] | | ------------------ | | 141| 0| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 0|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 214| 0| mk_list_del(&p->_head); 215| 0| flb_free(p); 216| 0| return NULL; 217| 0| } 218| | 219| 2.01k| regex = flb_regex_create(p_regex); 220| 2.01k| if (!regex) { ------------------ | Branch (220:13): [True: 2, False: 2.01k] ------------------ 221| 2| flb_error("[parser:%s] Invalid regex pattern %s", name, p_regex); ------------------ | | 140| 2| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 2|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 2, False: 0] | | ------------------ | | 141| 2| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 2|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 222| 2| mk_list_del(&p->_head); 223| 2| flb_free(p); 224| 2| return NULL; 225| 2| } 226| 2.01k| p->regex = regex; 227| 2.01k| p->skip_empty = skip_empty; 228| 2.01k| p->p_regex = flb_strdup(p_regex); 229| 2.01k| } 230| | 231| 4.04k| p->name = flb_strdup(name); 232| | 233| 4.04k| if (time_fmt) { ------------------ | Branch (233:9): [True: 4.04k, False: 0] ------------------ 234| 4.04k| p->time_fmt_full = flb_strdup(time_fmt); 235| 4.04k| if (!p->time_fmt_full) { ------------------ | Branch (235:13): [True: 5, False: 4.04k] ------------------ 236| 5| flb_error("[parser:%s] could not duplicate time fmt full", name); ------------------ | | 140| 5| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 5|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 5, False: 0] | | ------------------ | | 141| 5| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 5|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 237| 5| flb_interim_parser_destroy(p); 238| 5| return NULL; 239| 5| } 240| 4.04k| p->time_fmt = flb_strdup(time_fmt); 241| 4.04k| if (!p->time_fmt) { ------------------ | Branch (241:13): [True: 4, False: 4.03k] ------------------ 242| 4| flb_error("[parser:%s] could not duplicate time fmt", name); ------------------ | | 140| 4| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 4|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 4, False: 0] | | ------------------ | | 141| 4| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 4|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 243| 4| flb_interim_parser_destroy(p); 244| 4| return NULL; 245| 4| } 246| | 247| | /* Check if the format is considering the year */ 248| 4.03k| if (strstr(p->time_fmt, "%Y") || strstr(p->time_fmt, "%y")) { ------------------ | Branch (248:13): [True: 4.03k, False: 0] | Branch (248:42): [True: 0, False: 0] ------------------ 249| 4.03k| p->time_with_year = FLB_TRUE; ------------------ | | 26| 4.03k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 4.03k|#define FLB_FALSE 0 | | ------------------ ------------------ 250| 4.03k| } 251| 0| else if (strstr(p->time_fmt, "%s")) { ------------------ | Branch (251:18): [True: 0, False: 0] ------------------ 252| 0| is_epoch = FLB_TRUE; ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ 253| 0| p->time_with_year = FLB_TRUE; ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ 254| 0| } 255| 0| else { 256| 0| size = strlen(p->time_fmt); 257| 0| p->time_with_year = FLB_FALSE; ------------------ | | 25| 0|#define FLB_FALSE 0 ------------------ 258| 0| p->time_fmt_year = flb_malloc(size + 4); 259| 0| if (!p->time_fmt_year) { ------------------ | Branch (259:17): [True: 0, False: 0] ------------------ 260| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 261| 0| flb_interim_parser_destroy(p); 262| 0| return NULL; 263| 0| } 264| | 265| | /* Append the year at the beginning */ 266| 0| tmp = p->time_fmt_year; 267| 0| *tmp++ = '%'; 268| 0| *tmp++ = 'Y'; 269| 0| *tmp++ = ' '; 270| | 271| 0| memcpy(tmp, p->time_fmt, size); 272| 0| tmp += size; 273| 0| *tmp++ = '\0'; 274| 0| } 275| | 276| | /* Check if the format contains a timezone (%z) */ 277| 4.03k| if (strstr(p->time_fmt, "%z") || strstr(p->time_fmt, "%Z") || ------------------ | Branch (277:13): [True: 2.01k, False: 2.02k] | Branch (277:42): [True: 0, False: 2.02k] ------------------ 278| 4.03k| strstr(p->time_fmt, "%SZ") || strstr(p->time_fmt, "%S.%LZ")) { ------------------ | Branch (278:13): [True: 0, False: 2.02k] | Branch (278:43): [True: 0, False: 2.02k] ------------------ 279| 2.01k|#if defined(FLB_HAVE_GMTOFF) || !defined(FLB_HAVE_SYSTEM_STRPTIME) 280| 2.01k| p->time_with_tz = FLB_TRUE; ------------------ | | 26| 2.01k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 2.01k|#define FLB_FALSE 0 | | ------------------ ------------------ 281| |#else 282| | flb_error("[parser] timezone offset not supported"); 283| | flb_error("[parser] you cannot use %%z/%%Z on this platform"); 284| | flb_interim_parser_destroy(p); 285| | return NULL; 286| |#endif 287| 2.01k| } 288| | 289| | /* 290| | * Check if the format expect fractional seconds 291| | * 292| | * Since strptime(3) does not support fractional seconds, this 293| | * requires a workaround/hack in our parser. This is a known 294| | * issue and addressed in different ways in other languages. 295| | * 296| | * The following links are a good reference: 297| | * 298| | * - http://stackoverflow.com/questions/7114690/how-to-parse-syslog-timestamp 299| | * - http://code.activestate.com/lists/python-list/521885 300| | */ 301| 4.03k| if (is_epoch == FLB_TRUE || p->time_with_year == FLB_TRUE) { ------------------ | | 26| 8.07k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 8.07k|#define FLB_FALSE 0 | | ------------------ ------------------ if (is_epoch == FLB_TRUE || p->time_with_year == FLB_TRUE) { ------------------ | | 26| 4.03k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 4.03k|#define FLB_FALSE 0 | | ------------------ ------------------ | Branch (301:13): [True: 0, False: 4.03k] | Branch (301:37): [True: 4.03k, False: 0] ------------------ 302| 4.03k| timeptr = p->time_fmt; 303| 4.03k| } 304| 0| else { 305| 0| timeptr = p->time_fmt_year; 306| 0| } 307| | 308| 4.03k| tmp = strstr(timeptr, "%L"); 309| 4.03k| if (tmp) { ------------------ | Branch (309:13): [True: 4.03k, False: 0] ------------------ 310| 4.03k| tmp[0] = '\0'; 311| 4.03k| tmp[1] = '\0'; 312| 4.03k| p->time_frac_secs = (tmp + 2); 313| 4.03k| } 314| | 315| | /* Optional fixed timezone offset */ 316| 4.03k| if (time_offset) { ------------------ | Branch (316:13): [True: 0, False: 4.03k] ------------------ 317| 0| diff = 0; 318| 0| len = strlen(time_offset); 319| 0| ret = flb_parser_tzone_offset(time_offset, len, &diff); 320| 0| if (ret == -1) { ------------------ | Branch (320:17): [True: 0, False: 0] ------------------ 321| 0| flb_interim_parser_destroy(p); 322| 0| return NULL; 323| 0| } 324| 0| p->time_offset = diff; 325| 0| } 326| 4.03k| } 327| | 328| 4.03k| if (time_key) { ------------------ | Branch (328:9): [True: 4.03k, False: 0] ------------------ 329| 4.03k| p->time_key = flb_strdup(time_key); 330| 4.03k| } 331| | 332| 4.03k| p->time_keep = time_keep; 333| 4.03k| p->time_strict = time_strict; 334| 4.03k| p->logfmt_no_bare_keys = logfmt_no_bare_keys; 335| 4.03k| p->types = types; 336| 4.03k| p->types_len = types_len; 337| 4.03k| return p; 338| 4.04k|} flb_parser_destroy: 341| 4.03k|{ 342| 4.03k| int i = 0; 343| | 344| 4.03k| if (parser->type == FLB_PARSER_REGEX) { ------------------ | | 30| 4.03k|#define FLB_PARSER_REGEX 1 ------------------ | Branch (344:9): [True: 2.01k, False: 2.02k] ------------------ 345| 2.01k| flb_regex_destroy(parser->regex); 346| 2.01k| flb_free(parser->p_regex); 347| 2.01k| } 348| | 349| 4.03k| flb_free(parser->name); 350| 4.03k| if (parser->time_fmt) { ------------------ | Branch (350:9): [True: 4.03k, False: 0] ------------------ 351| 4.03k| flb_free(parser->time_fmt); 352| 4.03k| flb_free(parser->time_fmt_full); 353| 4.03k| } 354| 4.03k| if (parser->time_fmt_year) { ------------------ | Branch (354:9): [True: 0, False: 4.03k] ------------------ 355| 0| flb_free(parser->time_fmt_year); 356| 0| } 357| 4.03k| if (parser->time_key) { ------------------ | Branch (357:9): [True: 4.03k, False: 4] ------------------ 358| 4.03k| flb_free(parser->time_key); 359| 4.03k| } 360| 4.03k| if (parser->types_len != 0) { ------------------ | Branch (360:9): [True: 0, False: 4.03k] ------------------ 361| 0| for (i=0; itypes_len; i++){ ------------------ | Branch (361:19): [True: 0, False: 0] ------------------ 362| 0| flb_free(parser->types[i].key); 363| 0| } 364| 0| flb_free(parser->types); 365| 0| } 366| | 367| 4.03k| if (parser->decoders) { ------------------ | Branch (367:9): [True: 0, False: 4.03k] ------------------ 368| 0| flb_parser_decoder_list_destroy(parser->decoders); 369| 0| } 370| | 371| 4.03k| mk_list_del(&parser->_head); 372| 4.03k| flb_free(parser); 373| 4.03k|} flb_parser_exit: 376| 2.04k|{ 377| 2.04k| struct mk_list *tmp; 378| 2.04k| struct mk_list *head; 379| 2.04k| struct flb_parser *parser; 380| | 381| | /* release 'parsers' */ 382| 4.03k| mk_list_foreach_safe(head, tmp, &config->parsers) { ------------------ | | 207| 6.08k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 4.03k, False: 2.04k] | | ------------------ ------------------ 383| 4.03k| parser = mk_list_entry(head, struct flb_parser, _head); ------------------ | | 214| 4.03k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 4.03k|#define container_of(ptr, type, member) ({ \ | | | | 39| 4.03k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 4.03k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 384| 4.03k| flb_parser_destroy(parser); 385| 4.03k| } 386| | 387| | /* release 'multiline parsers' */ 388| 2.04k| flb_ml_exit(config); 389| 2.04k|} flb_parser.c:flb_interim_parser_destroy: 124| 9|{ 125| 9| if (parser->type == FLB_PARSER_REGEX) { ------------------ | | 30| 9|#define FLB_PARSER_REGEX 1 ------------------ | Branch (125:9): [True: 3, False: 6] ------------------ 126| 3| flb_regex_destroy(parser->regex); 127| 3| flb_free(parser->p_regex); 128| 3| } 129| | 130| 9| flb_free(parser->name); 131| 9| if (parser->time_fmt) { ------------------ | Branch (131:9): [True: 0, False: 9] ------------------ 132| 0| flb_free(parser->time_fmt); 133| 0| } 134| 9| if (parser->time_fmt_year) { ------------------ | Branch (134:9): [True: 0, False: 9] ------------------ 135| 0| flb_free(parser->time_fmt_year); 136| 0| } 137| 9| if (parser->time_fmt_full) { ------------------ | Branch (137:9): [True: 4, False: 5] ------------------ 138| 4| flb_free(parser->time_fmt_full); 139| 4| } 140| 9| if (parser->time_key) { ------------------ | Branch (140:9): [True: 0, False: 9] ------------------ 141| 0| flb_free(parser->time_key); 142| 0| } 143| | 144| 9| mk_list_del(&parser->_head); 145| 9| flb_free(parser); 146| 9|} flb_plugin_create: 173| 1.73k|{ 174| 1.73k| struct flb_plugins *ctx; 175| | 176| 1.73k| ctx = flb_malloc(sizeof(struct flb_plugins)); 177| 1.73k| if (!ctx) { ------------------ | Branch (177:9): [True: 3, False: 1.73k] ------------------ 178| 3| flb_errno(); ------------------ | | 201| 3|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 179| 3| return NULL; 180| 3| } 181| | 182| 1.73k| mk_list_init(&ctx->input); 183| 1.73k| mk_list_init(&ctx->filter); 184| 1.73k| mk_list_init(&ctx->output); 185| | 186| 1.73k| return ctx; 187| 1.73k|} flb_plugin_destroy: 399| 1.73k|{ 400| 1.73k| struct mk_list *tmp; 401| 1.73k| struct mk_list *head; 402| 1.73k| struct flb_plugin *plugin; 403| | 404| 1.73k| mk_list_foreach_safe(head, tmp, &ctx->input) { ------------------ | | 207| 1.73k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 0, False: 1.73k] | | ------------------ ------------------ 405| 0| plugin = mk_list_entry(head, struct flb_plugin, _head); ------------------ | | 214| 0|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 0|#define container_of(ptr, type, member) ({ \ | | | | 39| 0| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 0| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 406| 0| destroy_plugin(plugin); 407| 0| } 408| | 409| 1.73k| mk_list_foreach_safe(head, tmp, &ctx->filter) { ------------------ | | 207| 1.73k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 0, False: 1.73k] | | ------------------ ------------------ 410| 0| plugin = mk_list_entry(head, struct flb_plugin, _head); ------------------ | | 214| 0|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 0|#define container_of(ptr, type, member) ({ \ | | | | 39| 0| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 0| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 411| 0| destroy_plugin(plugin); 412| 0| } 413| | 414| 1.73k| mk_list_foreach_safe(head, tmp, &ctx->output) { ------------------ | | 207| 1.73k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 0, False: 1.73k] | | ------------------ ------------------ 415| 0| plugin = mk_list_entry(head, struct flb_plugin, _head); ------------------ | | 214| 0|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 0|#define container_of(ptr, type, member) ({ \ | | | | 39| 0| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 0| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 416| 0| destroy_plugin(plugin); 417| 0| } 418| | 419| 1.73k| flb_free(ctx); 420| 1.73k|} flb_regex_init: 151| 1.73k|{ 152| 1.73k| return onig_init(); 153| 1.73k|} flb_regex_create: 156| 44.0k|{ 157| 44.0k| int ret; 158| 44.0k| struct flb_regex *r; 159| | 160| | /* Create context */ 161| 44.0k| r = flb_malloc(sizeof(struct flb_regex)); 162| 44.0k| if (!r) { ------------------ | Branch (162:9): [True: 25, False: 44.0k] ------------------ 163| 25| flb_errno(); ------------------ | | 201| 25|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 164| 25| return NULL; 165| 25| } 166| | 167| | /* Compile pattern */ 168| 44.0k| ret = str_to_regex(pattern, (OnigRegex*)&r->regex); 169| 44.0k| if (ret == -1) { ------------------ | Branch (169:9): [True: 0, False: 44.0k] ------------------ 170| 0| flb_free(r); 171| 0| return NULL; 172| 0| } 173| | 174| 44.0k| return r; 175| 44.0k|} flb_regex_destroy: 311| 44.0k|{ 312| 44.0k| onig_free(r->regex); 313| 44.0k| flb_free(r); 314| 44.0k| return 0; 315| 44.0k|} flb_regex.c:str_to_regex: 111| 44.0k|{ 112| 44.0k| int ret; 113| 44.0k| size_t len; 114| 44.0k| const char *start; 115| 44.0k| const char *end; 116| 44.0k| char *new_end = NULL; 117| 44.0k| OnigErrorInfo einfo; 118| 44.0k| OnigOptionType option; 119| | 120| 44.0k| len = strlen(pattern); 121| 44.0k| start = pattern; 122| 44.0k| end = pattern + len; 123| | 124| 44.0k| option = check_option(start, end, &new_end); 125| | 126| 44.0k| if (pattern[0] == '/' && pattern[len - 1] == '/') { ------------------ | Branch (126:9): [True: 42.0k, False: 2.01k] | Branch (126:30): [True: 42.0k, False: 0] ------------------ 127| 42.0k| start++; 128| 42.0k| end--; 129| 42.0k| } 130| | 131| 44.0k| if (new_end != NULL) { ------------------ | Branch (131:9): [True: 0, False: 44.0k] ------------------ 132| | /* pattern is /pat/option. new_end indicates a last '/'. */ 133| 0| start++; 134| 0| end = new_end; 135| 0| } 136| | 137| 44.0k| ret = onig_new(reg, 138| 44.0k| (const unsigned char *)start, (const unsigned char *)end, 139| 44.0k| option, 140| 44.0k| ONIG_ENCODING_UTF8, ONIG_SYNTAX_RUBY, &einfo); ------------------ | | 274| 44.0k|# define ONIG_ENCODING_UTF8 ONIG_ENCODING_UTF_8 | | ------------------ | | | | 242| 44.0k|# define ONIG_ENCODING_UTF_8 (&OnigEncodingUTF_8) | | ------------------ ------------------ ONIG_ENCODING_UTF8, ONIG_SYNTAX_RUBY, &einfo); ------------------ | | 514| 44.0k|#define ONIG_SYNTAX_RUBY (&OnigSyntaxRuby) ------------------ 141| | 142| 44.0k| if (ret != ONIG_NORMAL) { ------------------ | | 627| 44.0k|#define ONIG_NORMAL 0 ------------------ | Branch (142:9): [True: 0, False: 44.0k] ------------------ 143| 0| printf("ret=%d. start=%s end=%c\n", ret, start, *end); 144| 0| return -1; 145| 0| } 146| 44.0k| return 0; 147| 44.0k|} flb_regex.c:check_option: 61| 44.0k|{ 62| 44.0k| char *chr = NULL; 63| 44.0k| OnigOptionType option = ONIG_OPTION_NONE; ------------------ | | 453| 44.0k|#define ONIG_OPTION_NONE 0U ------------------ 64| | 65| 44.0k| if (start == NULL || end == NULL || new_end == NULL) { ------------------ | Branch (65:9): [True: 0, False: 44.0k] | Branch (65:26): [True: 0, False: 44.0k] | Branch (65:41): [True: 0, False: 44.0k] ------------------ 66| 0| return ONIG_OPTION_DEFAULT; ------------------ | | 450| 0|#define ONIG_OPTION_DEFAULT ONIG_OPTION_NONE | | ------------------ | | | | 453| 0|#define ONIG_OPTION_NONE 0U | | ------------------ ------------------ 67| 44.0k| } else if (start[0] != '/') { ------------------ | Branch (67:16): [True: 2.01k, False: 42.0k] ------------------ 68| 2.01k| *new_end = NULL; 69| 2.01k| return ONIG_OPTION_DEFAULT; ------------------ | | 450| 2.01k|#define ONIG_OPTION_DEFAULT ONIG_OPTION_NONE | | ------------------ | | | | 453| 2.01k|#define ONIG_OPTION_NONE 0U | | ------------------ ------------------ 70| 2.01k| } 71| | 72| 42.0k| chr = strrchr(start, '/'); 73| 42.0k| if (chr == start || chr == end) { ------------------ | Branch (73:9): [True: 0, False: 42.0k] | Branch (73:25): [True: 0, False: 42.0k] ------------------ 74| 0| *new_end = NULL; 75| 0| return ONIG_OPTION_DEFAULT; ------------------ | | 450| 0|#define ONIG_OPTION_DEFAULT ONIG_OPTION_NONE | | ------------------ | | | | 453| 0|#define ONIG_OPTION_NONE 0U | | ------------------ ------------------ 76| 0| } 77| 42.0k| *new_end = chr; 78| | 79| 42.0k| chr++; 80| 42.0k| while(chr != end && *chr != '\0') { ------------------ | Branch (80:11): [True: 0, False: 42.0k] | Branch (80:25): [True: 0, False: 0] ------------------ 81| 0| switch (*chr) { 82| 0| case 'm': ------------------ | Branch (82:9): [True: 0, False: 0] ------------------ 83| 0| option |= ONIG_OPTION_MULTILINE; ------------------ | | 456| 0|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | ------------------ | | | | 455| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | ------------------ | | | | | | 454| 0|#define ONIG_OPTION_IGNORECASE 1U | | | | ------------------ | | ------------------ ------------------ 84| 0| break; 85| 0| case 'i': ------------------ | Branch (85:9): [True: 0, False: 0] ------------------ 86| 0| option |= ONIG_OPTION_IGNORECASE; ------------------ | | 454| 0|#define ONIG_OPTION_IGNORECASE 1U ------------------ 87| 0| break; 88| 0| case 'o': ------------------ | Branch (88:9): [True: 0, False: 0] ------------------ 89| 0| flb_debug("[regex:%s]: 'o' option is not supported.", __FUNCTION__); ------------------ | | 167| 0| if (flb_log_check(FLB_LOG_DEBUG)) \ | | ------------------ | | | | 42| 0|#define FLB_LOG_DEBUG 4 | | ------------------ | | | Branch (167:9): [True: 0, False: 0] | | ------------------ | | 168| 0| flb_log_print(FLB_LOG_DEBUG, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 42| 0|#define FLB_LOG_DEBUG 4 | | ------------------ ------------------ 90| 0| break; 91| 0| case 'x': ------------------ | Branch (91:9): [True: 0, False: 0] ------------------ 92| 0| option |= ONIG_OPTION_EXTEND; ------------------ | | 455| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | ------------------ | | | | 454| 0|#define ONIG_OPTION_IGNORECASE 1U | | ------------------ ------------------ 93| 0| break; 94| 0| default: ------------------ | Branch (94:9): [True: 0, False: 0] ------------------ 95| 0| flb_debug("[regex:%s]: unknown option. use default.", __FUNCTION__); ------------------ | | 167| 0| if (flb_log_check(FLB_LOG_DEBUG)) \ | | ------------------ | | | | 42| 0|#define FLB_LOG_DEBUG 4 | | ------------------ | | | Branch (167:9): [True: 0, False: 0] | | ------------------ | | 168| 0| flb_log_print(FLB_LOG_DEBUG, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 42| 0|#define FLB_LOG_DEBUG 4 | | ------------------ ------------------ 96| 0| *new_end = NULL; 97| 0| return ONIG_OPTION_DEFAULT; ------------------ | | 450| 0|#define ONIG_OPTION_DEFAULT ONIG_OPTION_NONE | | ------------------ | | | | 453| 0|#define ONIG_OPTION_NONE 0U | | ------------------ ------------------ 98| 0| } 99| 0| chr++; 100| 0| } 101| | 102| 42.0k| if (option == ONIG_OPTION_NONE) { ------------------ | | 453| 42.0k|#define ONIG_OPTION_NONE 0U ------------------ | Branch (102:9): [True: 42.0k, False: 0] ------------------ 103| 42.0k| *new_end = NULL; 104| 42.0k| option = ONIG_OPTION_DEFAULT; ------------------ | | 450| 42.0k|#define ONIG_OPTION_DEFAULT ONIG_OPTION_NONE | | ------------------ | | | | 453| 42.0k|#define ONIG_OPTION_NONE 0U | | ------------------ ------------------ 105| 42.0k| } 106| | 107| 42.0k| return option; 108| 42.0k|} flb_sds_create_len: 58| 183k|{ 59| 183k| flb_sds_t s; 60| 183k| struct flb_sds *head; 61| | 62| 183k| s = sds_alloc(len); 63| 183k| if (!s) { ------------------ | Branch (63:9): [True: 157, False: 182k] ------------------ 64| 157| return NULL; 65| 157| } 66| | 67| 182k| if (str) { ------------------ | Branch (67:9): [True: 182k, False: 0] ------------------ 68| 182k| memcpy(s, str, len); 69| 182k| s[len] = '\0'; 70| | 71| 182k| head = FLB_SDS_HEADER(s); ------------------ | | 46| 182k|#define FLB_SDS_HEADER(s) ((struct flb_sds *) (s - FLB_SDS_HEADER_SIZE)) | | ------------------ | | | | 34| 182k|#define FLB_SDS_HEADER_SIZE (sizeof(uint64_t) + sizeof(uint64_t)) | | ------------------ ------------------ 72| 182k| head->len = len; 73| 182k| } 74| 182k| return s; 75| 183k|} flb_sds_create: 78| 82.4k|{ 79| 82.4k| size_t len; 80| | 81| 82.4k| if (!str) { ------------------ | Branch (81:9): [True: 0, False: 82.4k] ------------------ 82| 0| len = 0; 83| 0| } 84| 82.4k| else { 85| 82.4k| len = strlen(str); 86| 82.4k| } 87| | 88| 82.4k| return flb_sds_create_len(str, len); 89| 82.4k|} flb_sds_create_size: 92| 12.9k|{ 93| 12.9k| return sds_alloc(size); 94| 12.9k|} flb_sds_copy: 260| 11.9k|{ 261| 11.9k| size_t avail; 262| 11.9k| struct flb_sds *head; 263| 11.9k| flb_sds_t tmp = NULL; 264| | 265| 11.9k| avail = flb_sds_alloc(s); 266| 11.9k| if (avail < len) { ------------------ | Branch (266:9): [True: 0, False: 11.9k] ------------------ 267| 0| tmp = flb_sds_increase(s, len); 268| 0| if (!tmp) { ------------------ | Branch (268:13): [True: 0, False: 0] ------------------ 269| 0| return NULL; 270| 0| } 271| 0| s = tmp; 272| 0| } 273| 11.9k| memcpy((char *) s, str, len); 274| | 275| 11.9k| head = FLB_SDS_HEADER(s); ------------------ | | 46| 11.9k|#define FLB_SDS_HEADER(s) ((struct flb_sds *) (s - FLB_SDS_HEADER_SIZE)) | | ------------------ | | | | 34| 11.9k|#define FLB_SDS_HEADER_SIZE (sizeof(uint64_t) + sizeof(uint64_t)) | | ------------------ ------------------ 276| 11.9k| head->len = len; 277| 11.9k| s[head->len] = '\0'; 278| | 279| 11.9k| return s; 280| 11.9k|} flb_sds_printf: 409| 8.68k|{ 410| 8.68k| va_list ap; 411| 8.68k| int len = strlen(fmt)*2; 412| 8.68k| int size; 413| 8.68k| flb_sds_t tmp = NULL; 414| 8.68k| flb_sds_t s; 415| 8.68k| struct flb_sds *head; 416| | 417| 8.68k| if (len < 64) len = 64; ------------------ | Branch (417:9): [True: 7.63k, False: 1.04k] ------------------ 418| | 419| 8.68k| s = *sds; 420| 8.68k| if (flb_sds_avail(s)< len) { ------------------ | Branch (420:9): [True: 0, False: 8.68k] ------------------ 421| 0| tmp = flb_sds_increase(s, len); 422| 0| if (!tmp) { ------------------ | Branch (422:13): [True: 0, False: 0] ------------------ 423| 0| return NULL; 424| 0| } 425| 0| *sds = s = tmp; 426| 0| } 427| | 428| 8.68k| va_start(ap, fmt); 429| 8.68k| size = vsnprintf((char *) (s + flb_sds_len(s)), flb_sds_avail(s), fmt, ap); 430| 8.68k| if (size < 0) { ------------------ | Branch (430:9): [True: 0, False: 8.68k] ------------------ 431| 0| flb_warn("[%s] buggy vsnprintf return %d", __FUNCTION__, size); ------------------ | | 149| 0| if (flb_log_check(FLB_LOG_WARN)) \ | | ------------------ | | | | 40| 0|#define FLB_LOG_WARN 2 | | ------------------ | | | Branch (149:9): [True: 0, False: 0] | | ------------------ | | 150| 0| flb_log_print(FLB_LOG_WARN, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 40| 0|#define FLB_LOG_WARN 2 | | ------------------ ------------------ 432| 0| va_end(ap); 433| 0| return NULL; 434| 0| } 435| 8.68k| va_end(ap); 436| | 437| 8.68k| if (size > flb_sds_avail(s)) { ------------------ | Branch (437:9): [True: 0, False: 8.68k] ------------------ 438| 0| tmp = flb_sds_increase(s, size); 439| 0| if (!tmp) { ------------------ | Branch (439:13): [True: 0, False: 0] ------------------ 440| 0| return NULL; 441| 0| } 442| 0| *sds = s = tmp; 443| | 444| 0| va_start(ap, fmt); 445| 0| size = vsnprintf((char *) (s + flb_sds_len(s)), flb_sds_avail(s), fmt, ap); 446| 0| if (size > flb_sds_avail(s)) { ------------------ | Branch (446:13): [True: 0, False: 0] ------------------ 447| 0| flb_warn("[%s] vsnprintf is insatiable ", __FUNCTION__); ------------------ | | 149| 0| if (flb_log_check(FLB_LOG_WARN)) \ | | ------------------ | | | | 40| 0|#define FLB_LOG_WARN 2 | | ------------------ | | | Branch (149:9): [True: 0, False: 0] | | ------------------ | | 150| 0| flb_log_print(FLB_LOG_WARN, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 40| 0|#define FLB_LOG_WARN 2 | | ------------------ ------------------ 448| 0| va_end(ap); 449| 0| return NULL; 450| 0| } 451| 0| va_end(ap); 452| 0| } 453| | 454| 8.68k| head = FLB_SDS_HEADER(s); ------------------ | | 46| 8.68k|#define FLB_SDS_HEADER(s) ((struct flb_sds *) (s - FLB_SDS_HEADER_SIZE)) | | ------------------ | | | | 34| 8.68k|#define FLB_SDS_HEADER_SIZE (sizeof(uint64_t) + sizeof(uint64_t)) | | ------------------ ------------------ 455| 8.68k| head->len += size; 456| 8.68k| s[head->len] = '\0'; 457| | 458| 8.68k| return s; 459| 8.68k|} flb_sds_destroy: 462| 195k|{ 463| 195k| struct flb_sds *head; 464| | 465| 195k| if (!s) { ------------------ | Branch (465:9): [True: 0, False: 195k] ------------------ 466| 0| return; 467| 0| } 468| | 469| 195k| head = FLB_SDS_HEADER(s); ------------------ | | 46| 195k|#define FLB_SDS_HEADER(s) ((struct flb_sds *) (s - FLB_SDS_HEADER_SIZE)) | | ------------------ | | | | 34| 195k|#define FLB_SDS_HEADER_SIZE (sizeof(uint64_t) + sizeof(uint64_t)) | | ------------------ ------------------ 470| 195k| flb_free(head); 471| 195k|} flb_sds.c:sds_alloc: 36| 196k|{ 37| 196k| void *buf; 38| 196k| flb_sds_t s; 39| 196k| struct flb_sds *head; 40| | 41| 196k| buf = flb_malloc(FLB_SDS_HEADER_SIZE + size + 1); ------------------ | | 34| 196k|#define FLB_SDS_HEADER_SIZE (sizeof(uint64_t) + sizeof(uint64_t)) ------------------ 42| 196k| if (!buf) { ------------------ | Branch (42:9): [True: 167, False: 195k] ------------------ 43| 167| flb_errno(); ------------------ | | 201| 167|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 44| 167| return NULL; 45| 167| } 46| | 47| 195k| head = buf; 48| 195k| head->len = 0; 49| 195k| head->alloc = size; 50| | 51| 195k| s = head->buf; 52| 195k| *s = '\0'; 53| | 54| 195k| return s; 55| 196k|} flb_slist_create: 28| 42.1k|{ 29| 42.1k| mk_list_init(list); 30| 42.1k| return 0; 31| 42.1k|} flb_slist_add_n: 35| 88.6k|{ 36| 88.6k| struct flb_slist_entry *e; 37| | 38| 88.6k| e = flb_malloc(sizeof(struct flb_slist_entry)); 39| 88.6k| if (!e) { ------------------ | Branch (39:9): [True: 45, False: 88.6k] ------------------ 40| 45| flb_errno(); ------------------ | | 201| 45|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 41| 45| return -1; 42| 45| } 43| | 44| 88.6k| e->str = flb_sds_create_len(str, len); 45| 88.6k| if (!e->str) { ------------------ | Branch (45:9): [True: 40, False: 88.5k] ------------------ 46| 40| flb_free(e); 47| 40| return -1; 48| 40| } 49| | 50| 88.5k| mk_list_add(&e->_head, head); 51| 88.5k| return 0; 52| 88.6k|} flb_slist_add_sds: 55| 6.70k|{ 56| 6.70k| struct flb_slist_entry *e; 57| | 58| 6.70k| e = flb_malloc(sizeof(struct flb_slist_entry)); 59| 6.70k| if (!e) { ------------------ | Branch (59:9): [True: 13, False: 6.69k] ------------------ 60| 13| flb_errno(); ------------------ | | 201| 13|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 61| 13| return -1; 62| 13| } 63| | 64| 6.69k| e->str = str; 65| 6.69k| mk_list_add(&e->_head, head); 66| 6.69k| return 0; 67| 6.70k|} flb_slist_add: 71| 1.64k|{ 72| 1.64k| int len; 73| | 74| 1.64k| if (!str) { ------------------ | Branch (74:9): [True: 0, False: 1.64k] ------------------ 75| 0| return -1; 76| 0| } 77| | 78| 1.64k| len = strlen(str); 79| 1.64k| if (len <= 0) { ------------------ | Branch (79:9): [True: 0, False: 1.64k] ------------------ 80| 0| return -1; 81| 0| } 82| | 83| 1.64k| return flb_slist_add_n(head, str, len); 84| 1.64k|} flb_slist_split_tokens: 183| 1.72k|{ 184| 1.72k| int count = 0; 185| 1.72k| char *p; 186| 1.72k| char *buf; 187| 1.72k| flb_sds_t tmp = NULL; 188| | 189| 1.72k| buf = (char *) str; 190| 6.76k| while ((tmp = token_retrieve(&buf))) { ------------------ | Branch (190:12): [True: 6.70k, False: 53] ------------------ 191| 6.70k| flb_slist_add_sds(list, tmp); 192| 6.70k| if (!buf) { ------------------ | Branch (192:13): [True: 28, False: 6.68k] ------------------ 193| 28| break; 194| 28| } 195| 6.68k| count++; 196| | 197| | /* Append remaining string if we use a maximum number of tokens */ 198| 6.68k| if (count >= max_split && max_split > 0) { ------------------ | Branch (198:13): [True: 1.64k, False: 5.03k] | Branch (198:35): [True: 1.64k, False: 0] ------------------ 199| 1.64k| p = buf; 200| 1.64k| while (*p == ' ') { ------------------ | Branch (200:20): [True: 0, False: 1.64k] ------------------ 201| 0| p++; 202| 0| } 203| | 204| 1.64k| if (*p) { ------------------ | Branch (204:17): [True: 1.64k, False: 2] ------------------ 205| 1.64k| flb_slist_add(list, p); 206| 1.64k| } 207| 1.64k| break; 208| 1.64k| } 209| 6.68k| } 210| | 211| 1.72k| return 0; 212| 1.72k|} flb_slist_split_string: 220| 43.8k|{ 221| 43.8k| int i = 0; 222| 43.8k| int ret; 223| 43.8k| int count = 0; 224| 43.8k| int val_len; 225| 43.8k| int len; 226| 43.8k| int end; 227| 43.8k| char *p_init; 228| 43.8k| char *p_end; 229| | 230| 43.8k| if (!str) { ------------------ | Branch (230:9): [True: 0, False: 43.8k] ------------------ 231| 0| return -1; 232| 0| } 233| | 234| 43.8k| len = strlen(str); 235| 135k| while (i < len) { ------------------ | Branch (235:12): [True: 92.1k, False: 43.7k] ------------------ 236| 92.1k| end = mk_string_char_search(str + i, separator, len - i); 237| 92.1k| if (end < 0) { ------------------ | Branch (237:13): [True: 43.8k, False: 48.3k] ------------------ 238| 43.8k| end = len - i; 239| 43.8k| } 240| 48.3k| else if ((end + i) == i) { ------------------ | Branch (240:18): [True: 1.73k, False: 46.5k] ------------------ 241| 1.73k| i++; 242| 1.73k| continue; 243| 1.73k| } 244| | 245| 90.4k| p_init = (char *) str + i; 246| 90.4k| p_end = p_init + end - 1; 247| | 248| | /* Skip empty spaces */ 249| 136k| while (*p_init == ' ') { ------------------ | Branch (249:16): [True: 46.5k, False: 90.4k] ------------------ 250| 46.5k| p_init++; 251| 46.5k| } 252| | 253| 114k| while (*p_end == ' ' && p_end >= p_init) { ------------------ | Branch (253:16): [True: 27.2k, False: 87.0k] | Branch (253:33): [True: 23.8k, False: 3.39k] ------------------ 254| 23.8k| p_end--; 255| 23.8k| } 256| | 257| 90.4k| if (p_init > p_end) { ------------------ | Branch (257:13): [True: 3.39k, False: 87.0k] ------------------ 258| 3.39k| goto next; 259| 3.39k| } 260| | 261| 87.0k| if (p_init == p_end) { ------------------ | Branch (261:13): [True: 15.3k, False: 71.6k] ------------------ 262| 15.3k| if (*p_init == ' ') { ------------------ | Branch (262:17): [True: 0, False: 15.3k] ------------------ 263| 0| goto next; 264| 0| } 265| 15.3k| val_len = 1; 266| 15.3k| } 267| 71.6k| else { 268| 71.6k| val_len = (p_end - p_init) + 1; 269| 71.6k| } 270| | 271| 87.0k| if (val_len == 0) { ------------------ | Branch (271:13): [True: 0, False: 87.0k] ------------------ 272| 0| goto next; 273| 0| } 274| | 275| 87.0k| ret = flb_slist_add_n(list, p_init, val_len); 276| 87.0k| if (ret == -1) { ------------------ | Branch (276:13): [True: 77, False: 86.9k] ------------------ 277| 77| return -1; 278| 77| } 279| 86.9k| count++; 280| | 281| | /* Append remaining string as a new node ? */ 282| 86.9k| if (count >= max_split && max_split > 0) { ------------------ | Branch (282:13): [True: 86.9k, False: 0] | Branch (282:35): [True: 0, False: 86.9k] ------------------ 283| 0| p_end = p_init + end; 284| 0| if (*p_end == separator) { ------------------ | Branch (284:17): [True: 0, False: 0] ------------------ 285| 0| p_end++; 286| 0| } 287| 0| while (*p_end == ' ') { ------------------ | Branch (287:20): [True: 0, False: 0] ------------------ 288| 0| p_end++; 289| 0| } 290| | 291| 0| if ((p_end - str) >= len) { ------------------ | Branch (291:17): [True: 0, False: 0] ------------------ 292| 0| break; 293| 0| } 294| | 295| 0| ret = flb_slist_add(list, p_end); 296| 0| if (ret == -1) { ------------------ | Branch (296:17): [True: 0, False: 0] ------------------ 297| 0| return -1; 298| 0| } 299| 0| count++; 300| 0| break; 301| 0| } 302| | 303| 90.3k| next: 304| 90.3k| i += end + 1; 305| 90.3k| } 306| | 307| 43.7k| return count; 308| 43.8k|} flb_slist_destroy: 323| 45.5k|{ 324| 45.5k| struct mk_list *tmp; 325| 45.5k| struct mk_list *head; 326| 45.5k| struct flb_slist_entry *e; 327| | 328| 95.0k| mk_list_foreach_safe(head, tmp, list) { ------------------ | | 207| 140k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 95.0k, False: 45.5k] | | ------------------ ------------------ 329| 95.0k| e = mk_list_entry(head, struct flb_slist_entry, _head); ------------------ | | 214| 95.0k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 95.0k|#define container_of(ptr, type, member) ({ \ | | | | 39| 95.0k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 95.0k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 330| 95.0k| flb_sds_destroy(e->str); 331| 95.0k| mk_list_del(&e->_head); 332| 95.0k| flb_free(e); 333| 95.0k| } 334| 45.5k|} flb_slist.c:token_retrieve: 108| 6.76k|{ 109| 6.76k| int len; 110| 6.76k| int quoted = FLB_FALSE; ------------------ | | 25| 6.76k|#define FLB_FALSE 0 ------------------ 111| 6.76k| char *p; 112| 6.76k| char *start; 113| 6.76k| char *prev; 114| 6.76k| flb_sds_t out = NULL; 115| | 116| 6.76k| if (!*str) { ------------------ | Branch (116:9): [True: 0, False: 6.76k] ------------------ 117| 0| return NULL; 118| 0| } 119| | 120| 6.76k| p = *str; 121| | 122| | /* Skip empty spaces */ 123| 6.79k| while (*p == ' ') { ------------------ | Branch (123:12): [True: 29, False: 6.76k] ------------------ 124| 29| p++; 125| 29| } 126| 6.76k| start = p; 127| | 128| 6.76k| if (*p == '"') { ------------------ | Branch (128:9): [True: 85, False: 6.67k] ------------------ 129| 85| quoted = FLB_TRUE; ------------------ | | 26| 85|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 85|#define FLB_FALSE 0 | | ------------------ ------------------ 130| 85| p++; 131| 85| start = p; 132| 98| while (1) { ------------------ | Branch (132:16): [Folded - Ignored] ------------------ 133| 291| while (*p && *p != '"') { ------------------ | Branch (133:20): [True: 285, False: 6] | Branch (133:26): [True: 193, False: 92] ------------------ 134| 193| p++; 135| 193| } 136| | 137| 98| if (!*p) { ------------------ | Branch (137:17): [True: 6, False: 92] ------------------ 138| 6| goto exit; 139| 6| } 140| | 141| 92| prev = p - 1; 142| 92| if (*prev == '\\') { ------------------ | Branch (142:17): [True: 13, False: 79] ------------------ 143| 13| p++; 144| 13| continue; 145| 13| } 146| 79| goto exit; 147| 92| } 148| 85| } 149| | 150| 15.1k| while (*p && *p != ' ') { ------------------ | Branch (150:12): [True: 15.0k, False: 33] | Branch (150:18): [True: 8.44k, False: 6.64k] ------------------ 151| 8.44k| p++; 152| 8.44k| } 153| | 154| 6.76k| exit: 155| 6.76k| if (*p) { ------------------ | Branch (155:9): [True: 6.72k, False: 39] ------------------ 156| 6.72k| out = flb_sds_create_len(start, p - start); 157| 6.72k| if (!out) { ------------------ | Branch (157:13): [True: 42, False: 6.68k] ------------------ 158| 42| *str = NULL; 159| 42| return NULL; 160| 42| } 161| 6.68k| if (quoted == FLB_TRUE) { ------------------ | | 26| 6.68k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 6.68k|#define FLB_FALSE 0 | | ------------------ ------------------ | Branch (161:13): [True: 79, False: 6.60k] ------------------ 162| 79| len = token_unescape(out); 163| 79| flb_sds_len_set(out, len); 164| 79| } 165| 6.68k| p++; 166| | 167| 26.3k| while (*p && *p == ' ') { ------------------ | Branch (167:16): [True: 26.3k, False: 10] | Branch (167:22): [True: 19.6k, False: 6.67k] ------------------ 168| 19.6k| p++; 169| 19.6k| } 170| 6.68k| *str = p; 171| 6.68k| } 172| 39| else { 173| 39| if (p > start) { ------------------ | Branch (173:13): [True: 28, False: 11] ------------------ 174| 28| out = flb_sds_create(start); 175| 28| } 176| 39| *str = NULL; 177| 39| } 178| | 179| 6.71k| return out; 180| 6.76k|} flb_slist.c:token_unescape: 87| 79|{ 88| 79| char *in = token; 89| 79| char *out = token; 90| | 91| 264| while (*in) { ------------------ | Branch (91:12): [True: 185, False: 79] ------------------ 92| 185| if ((in[0] == '\\') && (in[1] == '"')) { ------------------ | Branch (92:13): [True: 53, False: 132] | Branch (92:32): [True: 13, False: 40] ------------------ 93| 13| *out = in[1]; 94| 13| out++; 95| 13| in += 2; 96| 13| } 97| 172| else { 98| 172| *out = *in; 99| 172| out++; 100| 172| in++; 101| 172| } 102| 185| } 103| 79| *out = 0; 104| 79| return out - token; 105| 79|} flb_utils_size_to_bytes: 397| 1.18k|{ 398| 1.18k| int i; 399| 1.18k| int len; 400| 1.18k| int plen = 0; 401| 1.18k| int64_t val; 402| 1.18k| char c; 403| 1.18k| char tmp[3] = {0}; 404| 1.18k| int64_t KB = 1000; 405| 1.18k| int64_t MB = 1000 * KB; 406| 1.18k| int64_t GB = 1000 * MB; 407| | 408| 1.18k| if (!size) { ------------------ | Branch (408:9): [True: 0, False: 1.18k] ------------------ 409| 0| return -1; 410| 0| } 411| | 412| 1.18k| if (strcasecmp(size, "false") == 0) { ------------------ | Branch (412:9): [True: 1, False: 1.18k] ------------------ 413| 1| return 0; 414| 1| } 415| | 416| 1.18k| len = strlen(size); 417| 1.18k| val = atoll(size); 418| | 419| 1.18k| if (len == 0) { ------------------ | Branch (419:9): [True: 0, False: 1.18k] ------------------ 420| 0| return -1; 421| 0| } 422| | 423| 2.53k| for (i = len - 1; i > 0; i--) { ------------------ | Branch (423:23): [True: 1.68k, False: 855] ------------------ 424| 1.68k| if (isdigit(size[i])) { 425| 329| break; 426| 329| } 427| 1.35k| else { 428| 1.35k| plen++; 429| 1.35k| } 430| 1.68k| } 431| | 432| 1.18k| if (plen == 0) { ------------------ | Branch (432:9): [True: 3, False: 1.18k] ------------------ 433| 3| return val; 434| 3| } 435| 1.18k| else if (plen > 2) { ------------------ | Branch (435:14): [True: 23, False: 1.15k] ------------------ 436| 23| return -1; 437| 23| } 438| | 439| 2.33k| for (i = 0; i < plen; i++) { ------------------ | Branch (439:17): [True: 1.17k, False: 1.15k] ------------------ 440| 1.17k| c = size[(len - plen) + i]; 441| 1.17k| tmp[i] = toupper(c); 442| 1.17k| } 443| | 444| 1.15k| if (plen == 2) { ------------------ | Branch (444:9): [True: 15, False: 1.14k] ------------------ 445| 15| if (tmp[1] != 'B') { ------------------ | Branch (445:13): [True: 13, False: 2] ------------------ 446| 13| return -1; 447| 13| } 448| 15| } 449| | 450| 1.14k| if (tmp[0] == 'K') { ------------------ | Branch (450:9): [True: 67, False: 1.07k] ------------------ 451| | /* set upper bound (2**64/KB)/2 to avoid overflows */ 452| 67| if (val >= 9223372036854775 || val <= -9223372036854774) ------------------ | Branch (452:13): [True: 0, False: 67] | Branch (452:40): [True: 0, False: 67] ------------------ 453| 0| { 454| 0| return -1; 455| 0| } 456| 67| return (val * KB); 457| 67| } 458| 1.07k| else if (tmp[0] == 'M') { ------------------ | Branch (458:14): [True: 948, False: 130] ------------------ 459| | /* set upper bound (2**64/MB)/2 to avoid overflows */ 460| 948| if (val >= 9223372036854 || val <= -9223372036853) { ------------------ | Branch (460:13): [True: 4, False: 944] | Branch (460:37): [True: 45, False: 899] ------------------ 461| 49| return -1; 462| 49| } 463| 899| return (val * MB); 464| 948| } 465| 130| else if (tmp[0] == 'G') { ------------------ | Branch (465:14): [True: 116, False: 14] ------------------ 466| | /* set upper bound (2**64/GB)/2 to avoid overflows */ 467| 116| if (val >= 9223372036 || val <= -9223372035) { ------------------ | Branch (467:13): [True: 2, False: 114] | Branch (467:34): [True: 57, False: 57] ------------------ 468| 59| return -1; 469| 59| } 470| 57| return (val * GB); 471| 116| } 472| 14| else { 473| 14| return -1; 474| 14| } 475| | 476| 0| return val; 477| 1.14k|} flb_utils_time_to_seconds: 516| 857|{ 517| 857| int len; 518| 857| size_t val; 519| | 520| 857| len = strlen(time); 521| 857| if (len == 0) { ------------------ | Branch (521:9): [True: 0, False: 857] ------------------ 522| 0| return 0; 523| 0| } 524| 857| val = atoi(time); 525| | 526| | /* String time to seconds */ 527| 857| if (time[len - 1] == 'D' || time[len - 1] == 'd') { ------------------ | Branch (527:9): [True: 1, False: 856] | Branch (527:33): [True: 1, False: 855] ------------------ 528| 2| val *= 86400; 529| 2| } 530| 857| if (time[len - 1] == 'H' || time[len - 1] == 'h') { ------------------ | Branch (530:9): [True: 826, False: 31] | Branch (530:33): [True: 1, False: 30] ------------------ 531| 827| val *= 3600; 532| 827| } 533| 30| else if (time[len - 1] == 'M' || time[len - 1] == 'm') { ------------------ | Branch (533:14): [True: 1, False: 29] | Branch (533:38): [True: 1, False: 28] ------------------ 534| 2| val *= 60; 535| 2| } 536| | 537| 857| return val; 538| 857|} flb_utils_bool: 541| 3.59k|{ 542| 3.59k| if (strcasecmp(val, "true") == 0 || ------------------ | Branch (542:9): [True: 3.45k, False: 140] ------------------ 543| 3.59k| strcasecmp(val, "on") == 0 || ------------------ | Branch (543:9): [True: 1, False: 139] ------------------ 544| 3.59k| strcasecmp(val, "yes") == 0) { ------------------ | Branch (544:9): [True: 1, False: 138] ------------------ 545| 3.45k| return FLB_TRUE; ------------------ | | 26| 3.45k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 3.45k|#define FLB_FALSE 0 | | ------------------ ------------------ 546| 3.45k| } 547| 138| else if (strcasecmp(val, "false") == 0 || ------------------ | Branch (547:14): [True: 1, False: 137] ------------------ 548| 138| strcasecmp(val, "off") == 0 || ------------------ | Branch (548:14): [True: 2, False: 135] ------------------ 549| 138| strcasecmp(val, "no") == 0) { ------------------ | Branch (549:14): [True: 1, False: 134] ------------------ 550| 4| return FLB_FALSE; ------------------ | | 25| 4|#define FLB_FALSE 0 ------------------ 551| 4| } 552| | 553| 134| return -1; 554| 3.59k|} flb_worker_init: 112| 1.73k|{ 113| 1.73k| FLB_TLS_INIT(flb_worker_ctx); ------------------ | | 35| 1.73k|#define FLB_TLS_INIT(key) do {} while (0) | | ------------------ | | | Branch (35:49): [Folded - Ignored] | | ------------------ ------------------ 114| | 115| 1.73k| return 0; 116| 1.73k|} flb_worker_get: 135| 2.51k|{ 136| 2.51k| return FLB_TLS_GET(flb_worker_ctx); ------------------ | | 34| 2.51k|#define FLB_TLS_GET(key) key ------------------ 137| 2.51k|} flb_worker_exit: 154| 2.04k|{ 155| 2.04k| int c = 0; 156| 2.04k| struct mk_list *tmp; 157| 2.04k| struct mk_list *head; 158| 2.04k| struct flb_worker *worker; 159| | 160| 2.04k| mk_list_foreach_safe(head, tmp, &config->workers) { ------------------ | | 207| 2.04k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 0, False: 2.04k] | | ------------------ ------------------ 161| 0| worker = mk_list_entry(head, struct flb_worker, _head); ------------------ | | 214| 0|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 0|#define container_of(ptr, type, member) ({ \ | | | | 39| 0| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 0| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 162| 0| flb_worker_destroy(worker); 163| 0| c++; 164| 0| } 165| | 166| 2.04k| return c; 167| 2.04k|} flb_ml_init: 1155| 2.03k|{ 1156| 2.03k| int ret; 1157| | 1158| 2.03k| ret = flb_ml_parser_builtin_create(config); 1159| 2.03k| if (ret == -1) { ------------------ | Branch (1159:9): [True: 204, False: 1.83k] ------------------ 1160| 204| return -1; 1161| 204| } 1162| | 1163| 1.83k| return 0; 1164| 2.03k|} flb_ml_exit: 1167| 2.04k|{ 1168| 2.04k| flb_ml_parser_destroy_all(&config->multiline_parsers); 1169| 2.04k| return 0; 1170| 2.04k|} flb_ml_parser_init: 28| 7.52k|{ 29| 7.52k| int ret; 30| | 31| 7.52k| ret = flb_ml_rule_init(ml_parser); 32| 7.52k| if (ret == -1) { ------------------ | Branch (32:9): [True: 36, False: 7.48k] ------------------ 33| 36| return -1; 34| 36| } 35| | 36| 7.48k| return 0; 37| 7.52k|} flb_ml_parser_builtin_create: 41| 2.03k|{ 42| 2.03k| struct flb_ml_parser *mlp; 43| | 44| | /* Docker */ 45| 2.03k| mlp = flb_ml_parser_docker(config); 46| 2.03k| if (!mlp) { ------------------ | Branch (46:9): [True: 14, False: 2.02k] ------------------ 47| 14| flb_error("[multiline] could not init 'docker' built-in parser"); ------------------ | | 140| 14| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 14|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 14, False: 0] | | ------------------ | | 141| 14| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 14|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 48| 14| return -1; 49| 14| } 50| | 51| | /* CRI */ 52| 2.02k| mlp = flb_ml_parser_cri(config); 53| 2.02k| if (!mlp) { ------------------ | Branch (53:9): [True: 12, False: 2.00k] ------------------ 54| 12| flb_error("[multiline] could not init 'cri' built-in parser"); ------------------ | | 140| 12| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 12|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 12, False: 0] | | ------------------ | | 141| 12| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 12|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 55| 12| return -1; 56| 12| } 57| | 58| | /* Java */ 59| 2.00k| mlp = flb_ml_parser_java(config, NULL); 60| 2.00k| if (!mlp) { ------------------ | Branch (60:9): [True: 86, False: 1.92k] ------------------ 61| 86| flb_error("[multiline] could not init 'java' built-in parser"); ------------------ | | 140| 86| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 86|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 86, False: 0] | | ------------------ | | 141| 86| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 86|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 62| 86| return -1; 63| 86| } 64| | 65| | /* Go */ 66| 1.92k| mlp = flb_ml_parser_go(config, NULL); 67| 1.92k| if (!mlp) { ------------------ | Branch (67:9): [True: 48, False: 1.87k] ------------------ 68| 48| flb_error("[multiline] could not init 'go' built-in parser"); ------------------ | | 140| 48| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 48|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 48, False: 0] | | ------------------ | | 141| 48| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 48|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 69| 48| return -1; 70| 48| } 71| | 72| | /* Ruby */ 73| 1.87k| mlp = flb_ml_parser_ruby(config, NULL); 74| 1.87k| if (!mlp) { ------------------ | Branch (74:9): [True: 15, False: 1.85k] ------------------ 75| 15| flb_error("[multiline] could not init 'ruby' built-in parser"); ------------------ | | 140| 15| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 15|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 15, False: 0] | | ------------------ | | 141| 15| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 15|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 76| 15| return -1; 77| 15| } 78| | 79| | /* Python */ 80| 1.85k| mlp = flb_ml_parser_python(config, NULL); 81| 1.85k| if (!mlp) { ------------------ | Branch (81:9): [True: 29, False: 1.83k] ------------------ 82| 29| flb_error("[multiline] could not init 'python' built-in parser"); ------------------ | | 140| 29| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 29|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 29, False: 0] | | ------------------ | | 141| 29| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 29|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 83| 29| return -1; 84| 29| } 85| | 86| 1.83k| return 0; 87| 1.85k|} flb_ml_parser_create: 98| 11.7k|{ 99| 11.7k| struct flb_ml_parser *ml_parser; 100| | 101| 11.7k| ml_parser = flb_calloc(1, sizeof(struct flb_ml_parser)); 102| 11.7k| if (!ml_parser) { ------------------ | Branch (102:9): [True: 9, False: 11.6k] ------------------ 103| 9| flb_errno(); ------------------ | | 201| 9|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 104| 9| return NULL; 105| 9| } 106| 11.6k| ml_parser->name = flb_sds_create(name); 107| 11.6k| ml_parser->type = type; 108| | 109| 11.6k| if (match_str) { ------------------ | Branch (109:9): [True: 4.03k, False: 7.65k] ------------------ 110| 4.03k| ml_parser->match_str = flb_sds_create(match_str); 111| 4.03k| if (!ml_parser->match_str) { ------------------ | Branch (111:13): [True: 3, False: 4.03k] ------------------ 112| 3| if (ml_parser->name) { ------------------ | Branch (112:17): [True: 3, False: 0] ------------------ 113| 3| flb_sds_destroy(ml_parser->name); 114| 3| } 115| 3| flb_free(ml_parser); 116| 3| return NULL; 117| 3| } 118| 4.03k| } 119| | 120| 11.6k| ml_parser->parser = parser_ctx; 121| | 122| 11.6k| if (parser_name) { ------------------ | Branch (122:9): [True: 0, False: 11.6k] ------------------ 123| 0| ml_parser->parser_name = flb_sds_create(parser_name); 124| 0| } 125| 11.6k| ml_parser->negate = negate; 126| 11.6k| ml_parser->flush_ms = flush_ms; 127| 11.6k| mk_list_init(&ml_parser->regex_rules); 128| 11.6k| mk_list_add(&ml_parser->_head, &ctx->multiline_parsers); 129| | 130| 11.6k| if (key_content) { ------------------ | Branch (130:9): [True: 4.03k, False: 7.65k] ------------------ 131| 4.03k| ml_parser->key_content = flb_sds_create(key_content); 132| 4.03k| if (!ml_parser->key_content) { ------------------ | Branch (132:13): [True: 4, False: 4.03k] ------------------ 133| 4| flb_ml_parser_destroy(ml_parser); 134| 4| return NULL; 135| 4| } 136| 4.03k| } 137| | 138| 11.6k| if (key_group) { ------------------ | Branch (138:9): [True: 4.03k, False: 7.65k] ------------------ 139| 4.03k| ml_parser->key_group = flb_sds_create(key_group); 140| 4.03k| if (!ml_parser->key_group) { ------------------ | Branch (140:13): [True: 1, False: 4.02k] ------------------ 141| 1| flb_ml_parser_destroy(ml_parser); 142| 1| return NULL; 143| 1| } 144| 4.03k| } 145| | 146| 11.6k| if (key_pattern) { ------------------ | Branch (146:9): [True: 2.00k, False: 9.67k] ------------------ 147| 2.00k| ml_parser->key_pattern = flb_sds_create(key_pattern); 148| 2.00k| if (!ml_parser->key_pattern) { ------------------ | Branch (148:13): [True: 1, False: 2.00k] ------------------ 149| 1| flb_ml_parser_destroy(ml_parser); 150| 1| return NULL; 151| 1| } 152| 2.00k| } 153| | 154| 11.6k| return ml_parser; 155| 11.6k|} flb_ml_parser_destroy: 274| 11.6k|{ 275| 11.6k| if (!ml_parser) { ------------------ | Branch (275:9): [True: 0, False: 11.6k] ------------------ 276| 0| return 0; 277| 0| } 278| | 279| 11.6k| if (ml_parser->name) { ------------------ | Branch (279:9): [True: 11.6k, False: 20] ------------------ 280| 11.6k| flb_sds_destroy(ml_parser->name); 281| 11.6k| } 282| | 283| 11.6k| if (ml_parser->parser_name) { ------------------ | Branch (283:9): [True: 0, False: 11.6k] ------------------ 284| 0| flb_sds_destroy(ml_parser->parser_name); 285| 0| } 286| | 287| 11.6k| if (ml_parser->match_str) { ------------------ | Branch (287:9): [True: 4.03k, False: 7.65k] ------------------ 288| 4.03k| flb_sds_destroy(ml_parser->match_str); 289| 4.03k| } 290| 11.6k| if (ml_parser->key_content) { ------------------ | Branch (290:9): [True: 4.03k, False: 7.66k] ------------------ 291| 4.03k| flb_sds_destroy(ml_parser->key_content); 292| 4.03k| } 293| 11.6k| if (ml_parser->key_group) { ------------------ | Branch (293:9): [True: 4.02k, False: 7.66k] ------------------ 294| 4.02k| flb_sds_destroy(ml_parser->key_group); 295| 4.02k| } 296| 11.6k| if (ml_parser->key_pattern) { ------------------ | Branch (296:9): [True: 2.00k, False: 9.68k] ------------------ 297| 2.00k| flb_sds_destroy(ml_parser->key_pattern); 298| 2.00k| } 299| | 300| | /* Regex rules */ 301| 11.6k| flb_ml_rule_destroy_all(ml_parser); 302| | 303| | /* Unlink from struct flb_config->multiline_parsers */ 304| 11.6k| mk_list_del(&ml_parser->_head); 305| | 306| 11.6k| flb_free(ml_parser); 307| 11.6k| return 0; 308| 11.6k|} flb_ml_parser_destroy_all: 338| 2.04k|{ 339| 2.04k| struct mk_list *tmp; 340| 2.04k| struct mk_list *head; 341| 2.04k| struct flb_ml_parser *parser; 342| | 343| 11.5k| mk_list_foreach_safe(head, tmp, list) { ------------------ | | 207| 13.5k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 11.5k, False: 2.04k] | | ------------------ ------------------ 344| 11.5k| parser = mk_list_entry(head, struct flb_ml_parser, _head); ------------------ | | 214| 11.5k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 11.5k|#define container_of(ptr, type, member) ({ \ | | | | 39| 11.5k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 11.5k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 345| 11.5k| flb_ml_parser_destroy(parser); 346| 11.5k| } 347| 2.04k|} flb_ml_parser_cri: 53| 2.02k|{ 54| 2.02k| struct flb_parser *parser; 55| 2.02k| struct flb_ml_parser *mlp; 56| | 57| | /* Create a Docker parser */ 58| 2.02k| parser = cri_parser_create(config); 59| 2.02k| if (!parser) { ------------------ | Branch (59:9): [True: 6, False: 2.01k] ------------------ 60| 6| return NULL; 61| 6| } 62| | 63| 2.01k| mlp = flb_ml_parser_create(config, 64| 2.01k| "cri", /* name */ 65| 2.01k| FLB_ML_EQ, /* type */ ------------------ | | 35| 2.01k|#define FLB_ML_EQ 3 /* record key/content equaks 'abc' */ ------------------ 66| 2.01k| "F", /* match_str */ 67| 2.01k| FLB_FALSE, /* negate */ ------------------ | | 25| 2.01k|#define FLB_FALSE 0 ------------------ 68| 2.01k| FLB_ML_FLUSH_TIMEOUT, /* flush_ms */ ------------------ | | 47| 2.01k|#define FLB_ML_FLUSH_TIMEOUT 4000 /* Flush timeout default (milliseconds) */ ------------------ 69| 2.01k| "log", /* key_content */ 70| 2.01k| "stream", /* key_group */ 71| 2.01k| "_p", /* key_pattern */ 72| 2.01k| parser, /* parser ctx */ 73| 2.01k| NULL); /* parser name */ 74| | 75| 2.01k| if (!mlp) { ------------------ | Branch (75:9): [True: 6, False: 2.00k] ------------------ 76| 6| flb_error("[multiline] could not create 'cri mode'"); ------------------ | | 140| 6| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 6|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 6, False: 0] | | ------------------ | | 141| 6| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 6|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 77| 6| return NULL; 78| 6| } 79| | 80| 2.00k| return mlp; 81| 2.01k|} flb_ml_parser_cri.c:cri_parser_create: 31| 2.02k|{ 32| 2.02k| struct flb_parser *p; 33| | 34| 2.02k| p = flb_parser_create("_ml_cri", /* parser name */ 35| 2.02k| "regex", /* backend type */ 36| 2.02k| FLB_ML_CRI_REGEX, /* regex */ ------------------ | | 25| 2.02k| "^(?