flb_log.c:flb_log_check: 102| 31|static inline int flb_log_check(int l) { 103| 31| struct flb_worker *w; 104| 31| w = (struct flb_worker *) FLB_TLS_GET(flb_worker_ctx); ------------------ | | 34| 31|#define FLB_TLS_GET(key) key ------------------ 105| 31| if (!w && l <= 3) { ------------------ | Branch (105:9): [True: 31, False: 0] | Branch (105:15): [True: 31, False: 0] ------------------ 106| 31| return FLB_TRUE; ------------------ | | 26| 31|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 31|#define FLB_FALSE 0 | | ------------------ ------------------ 107| 31| } 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_unescape.c:flb_log_check: 102| 378|static inline int flb_log_check(int l) { 103| 378| struct flb_worker *w; 104| 378| w = (struct flb_worker *) FLB_TLS_GET(flb_worker_ctx); ------------------ | | 34| 378|#define FLB_TLS_GET(key) key ------------------ 105| 378| if (!w && l <= 3) { ------------------ | Branch (105:9): [True: 378, False: 0] | Branch (105:15): [True: 378, False: 0] ------------------ 106| 378| return FLB_TRUE; ------------------ | | 26| 378|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 378|#define FLB_FALSE 0 | | ------------------ ------------------ 107| 378| } 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_malloc: 66| 78.1k|void *flb_malloc(const size_t size) { 67| | 68| 78.1k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 69| | // 1% chance of failure 70| 78.1k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (70:8): [True: 0, False: 78.1k] ------------------ 71| 0| return NULL; 72| 0| } 73| 78.1k|#endif 74| | 75| 78.1k| if (size == 0) { ------------------ | Branch (75:9): [True: 0, False: 78.1k] ------------------ 76| 0| return NULL; 77| 0| } 78| | 79| 78.1k| return malloc(size); 80| 78.1k|} flb_config.c:flb_fuzz_get_probability: 55| 78.1k|static inline int flb_fuzz_get_probability(int val) { 56| 78.1k| flb_malloc_p += 1; 57| 78.1k| flb_malloc_p = flb_malloc_p % 25000; 58| 78.1k| if (val > flb_malloc_p) { ------------------ | Branch (58:7): [True: 0, False: 78.1k] ------------------ 59| 0| return 1; 60| 0| } 61| 78.1k| return 0; 62| 78.1k|} flb_config.c:flb_free: 119| 82.2k|static inline void flb_free(void *ptr) { 120| 82.2k| free(ptr); 121| 82.2k|} flb_config.c:flb_calloc: 83| 1.34k|void *flb_calloc(size_t n, const size_t size) { 84| 1.34k| if (size == 0) { ------------------ | Branch (84:9): [True: 0, False: 1.34k] ------------------ 85| 0| return NULL; 86| 0| } 87| | 88| 1.34k| return calloc(n, size); 89| 1.34k|} flb_plugin.c:flb_malloc: 66| 1.34k|void *flb_malloc(const size_t size) { 67| | 68| 1.34k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 69| | // 1% chance of failure 70| 1.34k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (70:8): [True: 0, False: 1.34k] ------------------ 71| 0| return NULL; 72| 0| } 73| 1.34k|#endif 74| | 75| 1.34k| if (size == 0) { ------------------ | Branch (75:9): [True: 0, False: 1.34k] ------------------ 76| 0| return NULL; 77| 0| } 78| | 79| 1.34k| return malloc(size); 80| 1.34k|} flb_plugin.c:flb_fuzz_get_probability: 55| 1.34k|static inline int flb_fuzz_get_probability(int val) { 56| 1.34k| flb_malloc_p += 1; 57| 1.34k| flb_malloc_p = flb_malloc_p % 25000; 58| 1.34k| if (val > flb_malloc_p) { ------------------ | Branch (58:7): [True: 0, False: 1.34k] ------------------ 59| 0| return 1; 60| 0| } 61| 1.34k| return 0; 62| 1.34k|} flb_plugin.c:flb_free: 119| 1.34k|static inline void flb_free(void *ptr) { 120| 1.34k| free(ptr); 121| 1.34k|} flb_config_format.c:flb_calloc: 83| 1.34k|void *flb_calloc(size_t n, const size_t size) { 84| 1.34k| if (size == 0) { ------------------ | Branch (84:9): [True: 0, False: 1.34k] ------------------ 85| 0| return NULL; 86| 0| } 87| | 88| 1.34k| return calloc(n, size); 89| 1.34k|} flb_config_format.c:flb_free: 119| 2.69k|static inline void flb_free(void *ptr) { 120| 2.69k| free(ptr); 121| 2.69k|} flb_config_format.c:flb_malloc: 66| 1.34k|void *flb_malloc(const size_t size) { 67| | 68| 1.34k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 69| | // 1% chance of failure 70| 1.34k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (70:8): [True: 0, False: 1.34k] ------------------ 71| 0| return NULL; 72| 0| } 73| 1.34k|#endif 74| | 75| 1.34k| if (size == 0) { ------------------ | Branch (75:9): [True: 0, False: 1.34k] ------------------ 76| 0| return NULL; 77| 0| } 78| | 79| 1.34k| return malloc(size); 80| 1.34k|} flb_config_format.c:flb_fuzz_get_probability: 55| 1.34k|static inline int flb_fuzz_get_probability(int val) { 56| 1.34k| flb_malloc_p += 1; 57| 1.34k| flb_malloc_p = flb_malloc_p % 25000; 58| 1.34k| if (val > flb_malloc_p) { ------------------ | Branch (58:7): [True: 0, False: 1.34k] ------------------ 59| 0| return 1; 60| 0| } 61| 1.34k| return 0; 62| 1.34k|} flb_parser.c:flb_calloc: 83| 4.04k|void *flb_calloc(size_t n, const size_t size) { 84| 4.04k| if (size == 0) { ------------------ | Branch (84:9): [True: 0, False: 4.04k] ------------------ 85| 0| return NULL; 86| 0| } 87| | 88| 4.04k| return calloc(n, size); 89| 4.04k|} flb_parser.c:flb_free: 119| 17.5k|static inline void flb_free(void *ptr) { 120| 17.5k| free(ptr); 121| 17.5k|} flb_parser.c:flb_malloc: 66| 13.4k|void *flb_malloc(const size_t size) { 67| | 68| 13.4k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 69| | // 1% chance of failure 70| 13.4k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (70:8): [True: 0, False: 13.4k] ------------------ 71| 0| return NULL; 72| 0| } 73| 13.4k|#endif 74| | 75| 13.4k| if (size == 0) { ------------------ | Branch (75:9): [True: 0, False: 13.4k] ------------------ 76| 0| return NULL; 77| 0| } 78| | 79| 13.4k| return malloc(size); 80| 13.4k|} flb_parser.c:flb_fuzz_get_probability: 55| 13.4k|static inline int flb_fuzz_get_probability(int val) { 56| 13.4k| flb_malloc_p += 1; 57| 13.4k| flb_malloc_p = flb_malloc_p % 25000; 58| 13.4k| if (val > flb_malloc_p) { ------------------ | Branch (58:7): [True: 0, False: 13.4k] ------------------ 59| 0| return 1; 60| 0| } 61| 13.4k| return 0; 62| 13.4k|} flb_parser_logfmt.c:flb_malloc: 66| 801k|void *flb_malloc(const size_t size) { 67| | 68| 801k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 69| | // 1% chance of failure 70| 801k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (70:8): [True: 31, False: 801k] ------------------ 71| 31| return NULL; 72| 31| } 73| 801k|#endif 74| | 75| 801k| if (size == 0) { ------------------ | Branch (75:9): [True: 0, False: 801k] ------------------ 76| 0| return NULL; 77| 0| } 78| | 79| 801k| return malloc(size); 80| 801k|} flb_parser_logfmt.c:flb_fuzz_get_probability: 55| 801k|static inline int flb_fuzz_get_probability(int val) { 56| 801k| flb_malloc_p += 1; 57| 801k| flb_malloc_p = flb_malloc_p % 25000; 58| 801k| if (val > flb_malloc_p) { ------------------ | Branch (58:7): [True: 31, False: 801k] ------------------ 59| 31| return 1; 60| 31| } 61| 801k| return 0; 62| 801k|} flb_parser_logfmt.c:flb_free: 119| 801k|static inline void flb_free(void *ptr) { 120| 801k| free(ptr); 121| 801k|} flb_regex.c:flb_malloc: 66| 31.0k|void *flb_malloc(const size_t size) { 67| | 68| 31.0k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 69| | // 1% chance of failure 70| 31.0k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (70:8): [True: 0, False: 31.0k] ------------------ 71| 0| return NULL; 72| 0| } 73| 31.0k|#endif 74| | 75| 31.0k| if (size == 0) { ------------------ | Branch (75:9): [True: 0, False: 31.0k] ------------------ 76| 0| return NULL; 77| 0| } 78| | 79| 31.0k| return malloc(size); 80| 31.0k|} flb_regex.c:flb_fuzz_get_probability: 55| 31.0k|static inline int flb_fuzz_get_probability(int val) { 56| 31.0k| flb_malloc_p += 1; 57| 31.0k| flb_malloc_p = flb_malloc_p % 25000; 58| 31.0k| if (val > flb_malloc_p) { ------------------ | Branch (58:7): [True: 0, False: 31.0k] ------------------ 59| 0| return 1; 60| 0| } 61| 31.0k| return 0; 62| 31.0k|} flb_regex.c:flb_free: 119| 31.0k|static inline void flb_free(void *ptr) { 120| 31.0k| free(ptr); 121| 31.0k|} flb_env.c:flb_malloc: 66| 1.34k|void *flb_malloc(const size_t size) { 67| | 68| 1.34k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 69| | // 1% chance of failure 70| 1.34k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (70:8): [True: 0, False: 1.34k] ------------------ 71| 0| return NULL; 72| 0| } 73| 1.34k|#endif 74| | 75| 1.34k| if (size == 0) { ------------------ | Branch (75:9): [True: 0, False: 1.34k] ------------------ 76| 0| return NULL; 77| 0| } 78| | 79| 1.34k| return malloc(size); 80| 1.34k|} flb_env.c:flb_fuzz_get_probability: 55| 1.34k|static inline int flb_fuzz_get_probability(int val) { 56| 1.34k| flb_malloc_p += 1; 57| 1.34k| flb_malloc_p = flb_malloc_p % 25000; 58| 1.34k| if (val > flb_malloc_p) { ------------------ | Branch (58:7): [True: 0, False: 1.34k] ------------------ 59| 0| return 1; 60| 0| } 61| 1.34k| return 0; 62| 1.34k|} flb_env.c:flb_free: 119| 1.34k|static inline void flb_free(void *ptr) { 120| 1.34k| free(ptr); 121| 1.34k|} flb_hash_table.c:flb_malloc: 66| 1.34k|void *flb_malloc(const size_t size) { 67| | 68| 1.34k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 69| | // 1% chance of failure 70| 1.34k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (70:8): [True: 0, False: 1.34k] ------------------ 71| 0| return NULL; 72| 0| } 73| 1.34k|#endif 74| | 75| 1.34k| if (size == 0) { ------------------ | Branch (75:9): [True: 0, False: 1.34k] ------------------ 76| 0| return NULL; 77| 0| } 78| | 79| 1.34k| return malloc(size); 80| 1.34k|} flb_hash_table.c:flb_fuzz_get_probability: 55| 1.34k|static inline int flb_fuzz_get_probability(int val) { 56| 1.34k| flb_malloc_p += 1; 57| 1.34k| flb_malloc_p = flb_malloc_p % 25000; 58| 1.34k| if (val > flb_malloc_p) { ------------------ | Branch (58:7): [True: 0, False: 1.34k] ------------------ 59| 0| return 1; 60| 0| } 61| 1.34k| return 0; 62| 1.34k|} flb_hash_table.c:flb_calloc: 83| 1.34k|void *flb_calloc(size_t n, const size_t size) { 84| 1.34k| if (size == 0) { ------------------ | Branch (84:9): [True: 0, False: 1.34k] ------------------ 85| 0| return NULL; 86| 0| } 87| | 88| 1.34k| return calloc(n, size); 89| 1.34k|} flb_hash_table.c:flb_free: 119| 2.69k|static inline void flb_free(void *ptr) { 120| 2.69k| free(ptr); 121| 2.69k|} flb_sds.c:flb_malloc: 66| 91.6k|void *flb_malloc(const size_t size) { 67| | 68| 91.6k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 69| | // 1% chance of failure 70| 91.6k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (70:8): [True: 0, False: 91.6k] ------------------ 71| 0| return NULL; 72| 0| } 73| 91.6k|#endif 74| | 75| 91.6k| if (size == 0) { ------------------ | Branch (75:9): [True: 0, False: 91.6k] ------------------ 76| 0| return NULL; 77| 0| } 78| | 79| 91.6k| return malloc(size); 80| 91.6k|} flb_sds.c:flb_fuzz_get_probability: 55| 91.6k|static inline int flb_fuzz_get_probability(int val) { 56| 91.6k| flb_malloc_p += 1; 57| 91.6k| flb_malloc_p = flb_malloc_p % 25000; 58| 91.6k| if (val > flb_malloc_p) { ------------------ | Branch (58:7): [True: 0, False: 91.6k] ------------------ 59| 0| return 1; 60| 0| } 61| 91.6k| return 0; 62| 91.6k|} flb_sds.c:flb_free: 119| 91.6k|static inline void flb_free(void *ptr) { 120| 91.6k| free(ptr); 121| 91.6k|} flb_kernel.c:flb_malloc: 66| 2.69k|void *flb_malloc(const size_t size) { 67| | 68| 2.69k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 69| | // 1% chance of failure 70| 2.69k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (70:8): [True: 0, False: 2.69k] ------------------ 71| 0| return NULL; 72| 0| } 73| 2.69k|#endif 74| | 75| 2.69k| if (size == 0) { ------------------ | Branch (75:9): [True: 0, False: 2.69k] ------------------ 76| 0| return NULL; 77| 0| } 78| | 79| 2.69k| return malloc(size); 80| 2.69k|} flb_kernel.c:flb_fuzz_get_probability: 55| 2.69k|static inline int flb_fuzz_get_probability(int val) { 56| 2.69k| flb_malloc_p += 1; 57| 2.69k| flb_malloc_p = flb_malloc_p % 25000; 58| 2.69k| if (val > flb_malloc_p) { ------------------ | Branch (58:7): [True: 0, False: 2.69k] ------------------ 59| 0| return 1; 60| 0| } 61| 2.69k| return 0; 62| 2.69k|} flb_slist.c:flb_malloc: 66| 43.1k|void *flb_malloc(const size_t size) { 67| | 68| 43.1k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 69| | // 1% chance of failure 70| 43.1k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (70:8): [True: 0, False: 43.1k] ------------------ 71| 0| return NULL; 72| 0| } 73| 43.1k|#endif 74| | 75| 43.1k| if (size == 0) { ------------------ | Branch (75:9): [True: 0, False: 43.1k] ------------------ 76| 0| return NULL; 77| 0| } 78| | 79| 43.1k| return malloc(size); 80| 43.1k|} flb_slist.c:flb_fuzz_get_probability: 55| 43.1k|static inline int flb_fuzz_get_probability(int val) { 56| 43.1k| flb_malloc_p += 1; 57| 43.1k| flb_malloc_p = flb_malloc_p % 25000; 58| 43.1k| if (val > flb_malloc_p) { ------------------ | Branch (58:7): [True: 0, False: 43.1k] ------------------ 59| 0| return 1; 60| 0| } 61| 43.1k| return 0; 62| 43.1k|} flb_slist.c:flb_free: 119| 43.1k|static inline void flb_free(void *ptr) { 120| 43.1k| free(ptr); 121| 43.1k|} flb_ml_parser.c:flb_calloc: 83| 8.08k|void *flb_calloc(size_t n, const size_t size) { 84| 8.08k| if (size == 0) { ------------------ | Branch (84:9): [True: 0, False: 8.08k] ------------------ 85| 0| return NULL; 86| 0| } 87| | 88| 8.08k| return calloc(n, size); 89| 8.08k|} flb_ml_parser.c:flb_free: 119| 8.08k|static inline void flb_free(void *ptr) { 120| 8.08k| free(ptr); 121| 8.08k|} flb_ml_rule.c:flb_calloc: 83| 29.6k|void *flb_calloc(size_t n, const size_t size) { 84| 29.6k| if (size == 0) { ------------------ | Branch (84:9): [True: 0, False: 29.6k] ------------------ 85| 0| return NULL; 86| 0| } 87| | 88| 29.6k| return calloc(n, size); 89| 29.6k|} flb_ml_rule.c:flb_free: 119| 113k|static inline void flb_free(void *ptr) { 120| 113k| free(ptr); 121| 113k|} flb_ml_rule.c:flb_malloc: 66| 83.5k|void *flb_malloc(const size_t size) { 67| | 68| 83.5k|#ifdef FLB_HAVE_TESTS_OSSFUZZ 69| | // 1% chance of failure 70| 83.5k| if (flb_fuzz_get_probability(1)) { ------------------ | Branch (70:8): [True: 0, False: 83.5k] ------------------ 71| 0| return NULL; 72| 0| } 73| 83.5k|#endif 74| | 75| 83.5k| if (size == 0) { ------------------ | Branch (75:9): [True: 0, False: 83.5k] ------------------ 76| 0| return NULL; 77| 0| } 78| | 79| 83.5k| return malloc(size); 80| 83.5k|} flb_ml_rule.c:flb_fuzz_get_probability: 55| 83.5k|static inline int flb_fuzz_get_probability(int val) { 56| 83.5k| flb_malloc_p += 1; 57| 83.5k| flb_malloc_p = flb_malloc_p % 25000; 58| 83.5k| if (val > flb_malloc_p) { ------------------ | Branch (58:7): [True: 0, False: 83.5k] ------------------ 59| 0| return 1; 60| 0| } 61| 83.5k| return 0; 62| 83.5k|} flb_plugins_register: 92| 1.34k|{ 93| 1.34k| struct flb_custom_plugin *custom; 94| 1.34k| struct flb_input_plugin *in; 95| 1.34k| struct flb_output_plugin *out; 96| 1.34k| struct flb_filter_plugin *filter; 97| | 98| | 99| 1.34k| custom = flb_malloc(sizeof(struct flb_custom_plugin)); 100| 1.34k| if (!custom) { ------------------ | Branch (100:9): [True: 0, False: 1.34k] ------------------ 101| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 102| 0| return -1; 103| 0| } 104| 1.34k| memcpy(custom, &custom_calyptia_plugin, sizeof(struct flb_custom_plugin)); 105| 1.34k| mk_list_add(&custom->_head, &config->custom_plugins); 106| | 107| 1.34k| in = flb_malloc(sizeof(struct flb_input_plugin)); 108| 1.34k| if (!in) { ------------------ | Branch (108:9): [True: 0, False: 1.34k] ------------------ 109| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 110| 0| return -1; 111| 0| } 112| 1.34k| memcpy(in, &in_docker_events_plugin, sizeof(struct flb_input_plugin)); 113| 1.34k| mk_list_add(&in->_head, &config->in_plugins); 114| | 115| 1.34k| in = flb_malloc(sizeof(struct flb_input_plugin)); 116| 1.34k| if (!in) { ------------------ | Branch (116:9): [True: 0, False: 1.34k] ------------------ 117| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 118| 0| return -1; 119| 0| } 120| 1.34k| memcpy(in, &in_node_exporter_metrics_plugin, sizeof(struct flb_input_plugin)); 121| 1.34k| mk_list_add(&in->_head, &config->in_plugins); 122| | 123| 1.34k| in = flb_malloc(sizeof(struct flb_input_plugin)); 124| 1.34k| if (!in) { ------------------ | Branch (124:9): [True: 0, False: 1.34k] ------------------ 125| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 126| 0| return -1; 127| 0| } 128| 1.34k| memcpy(in, &in_fluentbit_metrics_plugin, sizeof(struct flb_input_plugin)); 129| 1.34k| mk_list_add(&in->_head, &config->in_plugins); 130| | 131| 1.34k| in = flb_malloc(sizeof(struct flb_input_plugin)); 132| 1.34k| if (!in) { ------------------ | Branch (132:9): [True: 0, False: 1.34k] ------------------ 133| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 134| 0| return -1; 135| 0| } 136| 1.34k| memcpy(in, &in_prometheus_scrape_plugin, sizeof(struct flb_input_plugin)); 137| 1.34k| mk_list_add(&in->_head, &config->in_plugins); 138| | 139| 1.34k| in = flb_malloc(sizeof(struct flb_input_plugin)); 140| 1.34k| if (!in) { ------------------ | Branch (140:9): [True: 0, False: 1.34k] ------------------ 141| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 142| 0| return -1; 143| 0| } 144| 1.34k| memcpy(in, &in_emitter_plugin, sizeof(struct flb_input_plugin)); 145| 1.34k| mk_list_add(&in->_head, &config->in_plugins); 146| | 147| 1.34k| in = flb_malloc(sizeof(struct flb_input_plugin)); 148| 1.34k| if (!in) { ------------------ | Branch (148:9): [True: 0, False: 1.34k] ------------------ 149| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 150| 0| return -1; 151| 0| } 152| 1.34k| memcpy(in, &in_dummy_plugin, sizeof(struct flb_input_plugin)); 153| 1.34k| mk_list_add(&in->_head, &config->in_plugins); 154| | 155| 1.34k| in = flb_malloc(sizeof(struct flb_input_plugin)); 156| 1.34k| if (!in) { ------------------ | Branch (156:9): [True: 0, False: 1.34k] ------------------ 157| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 158| 0| return -1; 159| 0| } 160| 1.34k| memcpy(in, &in_http_plugin, sizeof(struct flb_input_plugin)); 161| 1.34k| mk_list_add(&in->_head, &config->in_plugins); 162| | 163| 1.34k| in = flb_malloc(sizeof(struct flb_input_plugin)); 164| 1.34k| if (!in) { ------------------ | Branch (164:9): [True: 0, False: 1.34k] ------------------ 165| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 166| 0| return -1; 167| 0| } 168| 1.34k| memcpy(in, &in_statsd_plugin, sizeof(struct flb_input_plugin)); 169| 1.34k| mk_list_add(&in->_head, &config->in_plugins); 170| | 171| 1.34k| in = flb_malloc(sizeof(struct flb_input_plugin)); 172| 1.34k| if (!in) { ------------------ | Branch (172:9): [True: 0, False: 1.34k] ------------------ 173| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 174| 0| return -1; 175| 0| } 176| 1.34k| memcpy(in, &in_opentelemetry_plugin, sizeof(struct flb_input_plugin)); 177| 1.34k| mk_list_add(&in->_head, &config->in_plugins); 178| | 179| 1.34k| in = flb_malloc(sizeof(struct flb_input_plugin)); 180| 1.34k| if (!in) { ------------------ | Branch (180:9): [True: 0, False: 1.34k] ------------------ 181| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 182| 0| return -1; 183| 0| } 184| 1.34k| memcpy(in, &in_event_test_plugin, sizeof(struct flb_input_plugin)); 185| 1.34k| mk_list_add(&in->_head, &config->in_plugins); 186| | 187| 1.34k| in = flb_malloc(sizeof(struct flb_input_plugin)); 188| 1.34k| if (!in) { ------------------ | Branch (188:9): [True: 0, False: 1.34k] ------------------ 189| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 190| 0| return -1; 191| 0| } 192| 1.34k| memcpy(in, &in_event_type_plugin, sizeof(struct flb_input_plugin)); 193| 1.34k| mk_list_add(&in->_head, &config->in_plugins); 194| | 195| 1.34k| in = flb_malloc(sizeof(struct flb_input_plugin)); 196| 1.34k| if (!in) { ------------------ | Branch (196:9): [True: 0, False: 1.34k] ------------------ 197| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 198| 0| return -1; 199| 0| } 200| 1.34k| memcpy(in, &in_storage_backlog_plugin, sizeof(struct flb_input_plugin)); 201| 1.34k| mk_list_add(&in->_head, &config->in_plugins); 202| | 203| 1.34k| in = flb_malloc(sizeof(struct flb_input_plugin)); 204| 1.34k| if (!in) { ------------------ | Branch (204:9): [True: 0, False: 1.34k] ------------------ 205| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 206| 0| return -1; 207| 0| } 208| 1.34k| memcpy(in, &in_nginx_exporter_metrics_plugin, sizeof(struct flb_input_plugin)); 209| 1.34k| mk_list_add(&in->_head, &config->in_plugins); 210| | 211| 1.34k| in = flb_malloc(sizeof(struct flb_input_plugin)); 212| 1.34k| if (!in) { ------------------ | Branch (212:9): [True: 0, False: 1.34k] ------------------ 213| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 214| 0| return -1; 215| 0| } 216| 1.34k| memcpy(in, &in_udp_plugin, sizeof(struct flb_input_plugin)); 217| 1.34k| mk_list_add(&in->_head, &config->in_plugins); 218| | 219| 1.34k| in = flb_malloc(sizeof(struct flb_input_plugin)); 220| 1.34k| if (!in) { ------------------ | Branch (220:9): [True: 0, False: 1.34k] ------------------ 221| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 222| 0| return -1; 223| 0| } 224| 1.34k| memcpy(in, &in_exec_wasi_plugin, sizeof(struct flb_input_plugin)); 225| 1.34k| mk_list_add(&in->_head, &config->in_plugins); 226| | 227| 1.34k| in = flb_malloc(sizeof(struct flb_input_plugin)); 228| 1.34k| if (!in) { ------------------ | Branch (228:9): [True: 0, False: 1.34k] ------------------ 229| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 230| 0| return -1; 231| 0| } 232| 1.34k| memcpy(in, &in_lib_plugin, sizeof(struct flb_input_plugin)); 233| 1.34k| mk_list_add(&in->_head, &config->in_plugins); 234| | 235| | 236| 1.34k| out = flb_malloc(sizeof(struct flb_output_plugin)); 237| 1.34k| if (!out) { ------------------ | Branch (237:9): [True: 0, False: 1.34k] ------------------ 238| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 239| 0| return -1; 240| 0| } 241| 1.34k| memcpy(out, &out_azure_blob_plugin, sizeof(struct flb_output_plugin)); 242| 1.34k| mk_list_add(&out->_head, &config->out_plugins); 243| | 244| 1.34k| out = flb_malloc(sizeof(struct flb_output_plugin)); 245| 1.34k| if (!out) { ------------------ | Branch (245:9): [True: 0, False: 1.34k] ------------------ 246| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 247| 0| return -1; 248| 0| } 249| 1.34k| memcpy(out, &out_azure_kusto_plugin, sizeof(struct flb_output_plugin)); 250| 1.34k| mk_list_add(&out->_head, &config->out_plugins); 251| | 252| 1.34k| out = flb_malloc(sizeof(struct flb_output_plugin)); 253| 1.34k| if (!out) { ------------------ | Branch (253:9): [True: 0, False: 1.34k] ------------------ 254| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 255| 0| return -1; 256| 0| } 257| 1.34k| memcpy(out, &out_calyptia_plugin, sizeof(struct flb_output_plugin)); 258| 1.34k| mk_list_add(&out->_head, &config->out_plugins); 259| | 260| 1.34k| out = flb_malloc(sizeof(struct flb_output_plugin)); 261| 1.34k| if (!out) { ------------------ | Branch (261:9): [True: 0, False: 1.34k] ------------------ 262| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 263| 0| return -1; 264| 0| } 265| 1.34k| memcpy(out, &out_exit_plugin, sizeof(struct flb_output_plugin)); 266| 1.34k| mk_list_add(&out->_head, &config->out_plugins); 267| | 268| 1.34k| out = flb_malloc(sizeof(struct flb_output_plugin)); 269| 1.34k| if (!out) { ------------------ | Branch (269:9): [True: 0, False: 1.34k] ------------------ 270| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 271| 0| return -1; 272| 0| } 273| 1.34k| memcpy(out, &out_http_plugin, sizeof(struct flb_output_plugin)); 274| 1.34k| mk_list_add(&out->_head, &config->out_plugins); 275| | 276| 1.34k| out = flb_malloc(sizeof(struct flb_output_plugin)); 277| 1.34k| if (!out) { ------------------ | Branch (277:9): [True: 0, False: 1.34k] ------------------ 278| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 279| 0| return -1; 280| 0| } 281| 1.34k| memcpy(out, &out_logdna_plugin, sizeof(struct flb_output_plugin)); 282| 1.34k| mk_list_add(&out->_head, &config->out_plugins); 283| | 284| 1.34k| out = flb_malloc(sizeof(struct flb_output_plugin)); 285| 1.34k| if (!out) { ------------------ | Branch (285:9): [True: 0, False: 1.34k] ------------------ 286| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 287| 0| return -1; 288| 0| } 289| 1.34k| memcpy(out, &out_opensearch_plugin, sizeof(struct flb_output_plugin)); 290| 1.34k| mk_list_add(&out->_head, &config->out_plugins); 291| | 292| 1.34k| out = flb_malloc(sizeof(struct flb_output_plugin)); 293| 1.34k| if (!out) { ------------------ | Branch (293:9): [True: 0, False: 1.34k] ------------------ 294| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 295| 0| return -1; 296| 0| } 297| 1.34k| memcpy(out, &out_skywalking_plugin, sizeof(struct flb_output_plugin)); 298| 1.34k| mk_list_add(&out->_head, &config->out_plugins); 299| | 300| 1.34k| out = flb_malloc(sizeof(struct flb_output_plugin)); 301| 1.34k| if (!out) { ------------------ | Branch (301:9): [True: 0, False: 1.34k] ------------------ 302| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 303| 0| return -1; 304| 0| } 305| 1.34k| memcpy(out, &out_stdout_plugin, sizeof(struct flb_output_plugin)); 306| 1.34k| mk_list_add(&out->_head, &config->out_plugins); 307| | 308| 1.34k| out = flb_malloc(sizeof(struct flb_output_plugin)); 309| 1.34k| if (!out) { ------------------ | Branch (309:9): [True: 0, False: 1.34k] ------------------ 310| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 311| 0| return -1; 312| 0| } 313| 1.34k| memcpy(out, &out_udp_plugin, sizeof(struct flb_output_plugin)); 314| 1.34k| mk_list_add(&out->_head, &config->out_plugins); 315| | 316| 1.34k| out = flb_malloc(sizeof(struct flb_output_plugin)); 317| 1.34k| if (!out) { ------------------ | Branch (317:9): [True: 0, False: 1.34k] ------------------ 318| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 319| 0| return -1; 320| 0| } 321| 1.34k| memcpy(out, &out_td_plugin, sizeof(struct flb_output_plugin)); 322| 1.34k| mk_list_add(&out->_head, &config->out_plugins); 323| | 324| 1.34k| out = flb_malloc(sizeof(struct flb_output_plugin)); 325| 1.34k| if (!out) { ------------------ | Branch (325:9): [True: 0, False: 1.34k] ------------------ 326| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 327| 0| return -1; 328| 0| } 329| 1.34k| memcpy(out, &out_lib_plugin, sizeof(struct flb_output_plugin)); 330| 1.34k| mk_list_add(&out->_head, &config->out_plugins); 331| | 332| 1.34k| out = flb_malloc(sizeof(struct flb_output_plugin)); 333| 1.34k| if (!out) { ------------------ | Branch (333:9): [True: 0, False: 1.34k] ------------------ 334| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 335| 0| return -1; 336| 0| } 337| 1.34k| memcpy(out, &out_websocket_plugin, sizeof(struct flb_output_plugin)); 338| 1.34k| mk_list_add(&out->_head, &config->out_plugins); 339| | 340| 1.34k| out = flb_malloc(sizeof(struct flb_output_plugin)); 341| 1.34k| if (!out) { ------------------ | Branch (341:9): [True: 0, False: 1.34k] ------------------ 342| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 343| 0| return -1; 344| 0| } 345| 1.34k| memcpy(out, &out_cloudwatch_logs_plugin, sizeof(struct flb_output_plugin)); 346| 1.34k| mk_list_add(&out->_head, &config->out_plugins); 347| | 348| 1.34k| out = flb_malloc(sizeof(struct flb_output_plugin)); 349| 1.34k| if (!out) { ------------------ | Branch (349:9): [True: 0, False: 1.34k] ------------------ 350| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 351| 0| return -1; 352| 0| } 353| 1.34k| memcpy(out, &out_kinesis_firehose_plugin, sizeof(struct flb_output_plugin)); 354| 1.34k| mk_list_add(&out->_head, &config->out_plugins); 355| | 356| 1.34k| out = flb_malloc(sizeof(struct flb_output_plugin)); 357| 1.34k| if (!out) { ------------------ | Branch (357:9): [True: 0, False: 1.34k] ------------------ 358| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 359| 0| return -1; 360| 0| } 361| 1.34k| memcpy(out, &out_kinesis_streams_plugin, sizeof(struct flb_output_plugin)); 362| 1.34k| mk_list_add(&out->_head, &config->out_plugins); 363| | 364| 1.34k| out = flb_malloc(sizeof(struct flb_output_plugin)); 365| 1.34k| if (!out) { ------------------ | Branch (365:9): [True: 0, False: 1.34k] ------------------ 366| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 367| 0| return -1; 368| 0| } 369| 1.34k| memcpy(out, &out_opentelemetry_plugin, sizeof(struct flb_output_plugin)); 370| 1.34k| mk_list_add(&out->_head, &config->out_plugins); 371| | 372| 1.34k| out = flb_malloc(sizeof(struct flb_output_plugin)); 373| 1.34k| if (!out) { ------------------ | Branch (373:9): [True: 0, False: 1.34k] ------------------ 374| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 375| 0| return -1; 376| 0| } 377| 1.34k| memcpy(out, &out_prometheus_exporter_plugin, sizeof(struct flb_output_plugin)); 378| 1.34k| mk_list_add(&out->_head, &config->out_plugins); 379| | 380| 1.34k| out = flb_malloc(sizeof(struct flb_output_plugin)); 381| 1.34k| if (!out) { ------------------ | Branch (381:9): [True: 0, False: 1.34k] ------------------ 382| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 383| 0| return -1; 384| 0| } 385| 1.34k| memcpy(out, &out_prometheus_remote_write_plugin, sizeof(struct flb_output_plugin)); 386| 1.34k| mk_list_add(&out->_head, &config->out_plugins); 387| | 388| 1.34k| out = flb_malloc(sizeof(struct flb_output_plugin)); 389| 1.34k| if (!out) { ------------------ | Branch (389:9): [True: 0, False: 1.34k] ------------------ 390| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 391| 0| return -1; 392| 0| } 393| 1.34k| memcpy(out, &out_s3_plugin, sizeof(struct flb_output_plugin)); 394| 1.34k| mk_list_add(&out->_head, &config->out_plugins); 395| | 396| | 397| 1.34k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 398| 1.34k| if (!filter) { ------------------ | Branch (398:9): [True: 0, False: 1.34k] ------------------ 399| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 400| 0| return -1; 401| 0| } 402| 1.34k| memcpy(filter, &filter_alter_size_plugin, sizeof(struct flb_filter_plugin)); 403| 1.34k| mk_list_add(&filter->_head, &config->filter_plugins); 404| | 405| 1.34k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 406| 1.34k| if (!filter) { ------------------ | Branch (406:9): [True: 0, False: 1.34k] ------------------ 407| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 408| 0| return -1; 409| 0| } 410| 1.34k| memcpy(filter, &filter_aws_plugin, sizeof(struct flb_filter_plugin)); 411| 1.34k| mk_list_add(&filter->_head, &config->filter_plugins); 412| | 413| 1.34k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 414| 1.34k| if (!filter) { ------------------ | Branch (414:9): [True: 0, False: 1.34k] ------------------ 415| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 416| 0| return -1; 417| 0| } 418| 1.34k| memcpy(filter, &filter_checklist_plugin, sizeof(struct flb_filter_plugin)); 419| 1.34k| mk_list_add(&filter->_head, &config->filter_plugins); 420| | 421| 1.34k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 422| 1.34k| if (!filter) { ------------------ | Branch (422:9): [True: 0, False: 1.34k] ------------------ 423| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 424| 0| return -1; 425| 0| } 426| 1.34k| memcpy(filter, &filter_ecs_plugin, sizeof(struct flb_filter_plugin)); 427| 1.34k| mk_list_add(&filter->_head, &config->filter_plugins); 428| | 429| 1.34k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 430| 1.34k| if (!filter) { ------------------ | Branch (430:9): [True: 0, False: 1.34k] ------------------ 431| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 432| 0| return -1; 433| 0| } 434| 1.34k| memcpy(filter, &filter_record_modifier_plugin, sizeof(struct flb_filter_plugin)); 435| 1.34k| mk_list_add(&filter->_head, &config->filter_plugins); 436| | 437| 1.34k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 438| 1.34k| if (!filter) { ------------------ | Branch (438:9): [True: 0, False: 1.34k] ------------------ 439| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 440| 0| return -1; 441| 0| } 442| 1.34k| memcpy(filter, &filter_throttle_plugin, sizeof(struct flb_filter_plugin)); 443| 1.34k| mk_list_add(&filter->_head, &config->filter_plugins); 444| | 445| 1.34k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 446| 1.34k| if (!filter) { ------------------ | Branch (446:9): [True: 0, False: 1.34k] ------------------ 447| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 448| 0| return -1; 449| 0| } 450| 1.34k| memcpy(filter, &filter_type_converter_plugin, sizeof(struct flb_filter_plugin)); 451| 1.34k| mk_list_add(&filter->_head, &config->filter_plugins); 452| | 453| 1.34k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 454| 1.34k| if (!filter) { ------------------ | Branch (454:9): [True: 0, False: 1.34k] ------------------ 455| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 456| 0| return -1; 457| 0| } 458| 1.34k| memcpy(filter, &filter_kubernetes_plugin, sizeof(struct flb_filter_plugin)); 459| 1.34k| mk_list_add(&filter->_head, &config->filter_plugins); 460| | 461| 1.34k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 462| 1.34k| if (!filter) { ------------------ | Branch (462:9): [True: 0, False: 1.34k] ------------------ 463| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 464| 0| return -1; 465| 0| } 466| 1.34k| memcpy(filter, &filter_modify_plugin, sizeof(struct flb_filter_plugin)); 467| 1.34k| mk_list_add(&filter->_head, &config->filter_plugins); 468| | 469| 1.34k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 470| 1.34k| if (!filter) { ------------------ | Branch (470:9): [True: 0, False: 1.34k] ------------------ 471| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 472| 0| return -1; 473| 0| } 474| 1.34k| memcpy(filter, &filter_multiline_plugin, sizeof(struct flb_filter_plugin)); 475| 1.34k| mk_list_add(&filter->_head, &config->filter_plugins); 476| | 477| 1.34k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 478| 1.34k| if (!filter) { ------------------ | Branch (478:9): [True: 0, False: 1.34k] ------------------ 479| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 480| 0| return -1; 481| 0| } 482| 1.34k| memcpy(filter, &filter_nest_plugin, sizeof(struct flb_filter_plugin)); 483| 1.34k| mk_list_add(&filter->_head, &config->filter_plugins); 484| | 485| 1.34k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 486| 1.34k| if (!filter) { ------------------ | Branch (486:9): [True: 0, False: 1.34k] ------------------ 487| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 488| 0| return -1; 489| 0| } 490| 1.34k| memcpy(filter, &filter_parser_plugin, sizeof(struct flb_filter_plugin)); 491| 1.34k| mk_list_add(&filter->_head, &config->filter_plugins); 492| | 493| 1.34k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 494| 1.34k| if (!filter) { ------------------ | Branch (494:9): [True: 0, False: 1.34k] ------------------ 495| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 496| 0| return -1; 497| 0| } 498| 1.34k| memcpy(filter, &filter_expect_plugin, sizeof(struct flb_filter_plugin)); 499| 1.34k| mk_list_add(&filter->_head, &config->filter_plugins); 500| | 501| 1.34k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 502| 1.34k| if (!filter) { ------------------ | Branch (502:9): [True: 0, False: 1.34k] ------------------ 503| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 504| 0| return -1; 505| 0| } 506| 1.34k| memcpy(filter, &filter_grep_plugin, sizeof(struct flb_filter_plugin)); 507| 1.34k| mk_list_add(&filter->_head, &config->filter_plugins); 508| | 509| 1.34k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 510| 1.34k| if (!filter) { ------------------ | Branch (510:9): [True: 0, False: 1.34k] ------------------ 511| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 512| 0| return -1; 513| 0| } 514| 1.34k| memcpy(filter, &filter_rewrite_tag_plugin, sizeof(struct flb_filter_plugin)); 515| 1.34k| mk_list_add(&filter->_head, &config->filter_plugins); 516| | 517| 1.34k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 518| 1.34k| if (!filter) { ------------------ | Branch (518:9): [True: 0, False: 1.34k] ------------------ 519| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 520| 0| return -1; 521| 0| } 522| 1.34k| memcpy(filter, &filter_stdout_plugin, sizeof(struct flb_filter_plugin)); 523| 1.34k| mk_list_add(&filter->_head, &config->filter_plugins); 524| | 525| 1.34k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 526| 1.34k| if (!filter) { ------------------ | Branch (526:9): [True: 0, False: 1.34k] ------------------ 527| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 528| 0| return -1; 529| 0| } 530| 1.34k| memcpy(filter, &filter_geoip2_plugin, sizeof(struct flb_filter_plugin)); 531| 1.34k| mk_list_add(&filter->_head, &config->filter_plugins); 532| | 533| 1.34k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 534| 1.34k| if (!filter) { ------------------ | Branch (534:9): [True: 0, False: 1.34k] ------------------ 535| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 536| 0| return -1; 537| 0| } 538| 1.34k| memcpy(filter, &filter_nightfall_plugin, sizeof(struct flb_filter_plugin)); 539| 1.34k| mk_list_add(&filter->_head, &config->filter_plugins); 540| | 541| 1.34k| filter = flb_malloc(sizeof(struct flb_filter_plugin)); 542| 1.34k| if (!filter) { ------------------ | Branch (542:9): [True: 0, False: 1.34k] ------------------ 543| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 544| 0| return -1; 545| 0| } 546| 1.34k| memcpy(filter, &filter_wasm_plugin, sizeof(struct flb_filter_plugin)); 547| 1.34k| mk_list_add(&filter->_head, &config->filter_plugins); 548| | 549| | 550| | 551| 1.34k| return 0; 552| 1.34k|} flb_plugins_unregister: 555| 1.34k|{ 556| 1.34k| struct mk_list *tmp; 557| 1.34k| struct mk_list *head; 558| 1.34k| struct flb_custom_plugin *custom; 559| 1.34k| struct flb_input_plugin *in; 560| 1.34k| struct flb_output_plugin *out; 561| 1.34k| struct flb_filter_plugin *filter; 562| | 563| 1.34k| mk_list_foreach_safe(head, tmp, &config->custom_plugins) { ------------------ | | 207| 2.69k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 1.34k, False: 1.34k] | | ------------------ ------------------ 564| 1.34k| custom = mk_list_entry(head, struct flb_custom_plugin, _head); ------------------ | | 214| 1.34k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 1.34k|#define container_of(ptr, type, member) ({ \ | | | | 39| 1.34k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 1.34k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 565| 1.34k| mk_list_del(&custom->_head); 566| 1.34k| flb_free(custom); 567| 1.34k| } 568| | 569| 21.5k| mk_list_foreach_safe(head, tmp, &config->in_plugins) { ------------------ | | 207| 22.9k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 21.5k, False: 1.34k] | | ------------------ ------------------ 570| 21.5k| in = mk_list_entry(head, struct flb_input_plugin, _head); ------------------ | | 214| 21.5k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 21.5k|#define container_of(ptr, type, member) ({ \ | | | | 39| 21.5k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 21.5k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 571| 21.5k| if(in->cb_destroy) { ------------------ | Branch (571:12): [True: 0, False: 21.5k] ------------------ 572| 0| in->cb_destroy(in); 573| 0| } 574| 21.5k| mk_list_del(&in->_head); 575| 21.5k| flb_free(in); 576| 21.5k| } 577| | 578| 26.9k| mk_list_foreach_safe(head, tmp, &config->out_plugins) { ------------------ | | 207| 28.3k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 26.9k, False: 1.34k] | | ------------------ ------------------ 579| 26.9k| out = mk_list_entry(head, struct flb_output_plugin, _head); ------------------ | | 214| 26.9k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 26.9k|#define container_of(ptr, type, member) ({ \ | | | | 39| 26.9k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 26.9k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 580| 26.9k| if(out->cb_destroy) { ------------------ | Branch (580:12): [True: 0, False: 26.9k] ------------------ 581| 0| out->cb_destroy(out); 582| 0| } 583| 26.9k| mk_list_del(&out->_head); 584| 26.9k| flb_free(out); 585| 26.9k| } 586| | 587| 25.6k| mk_list_foreach_safe(head, tmp, &config->filter_plugins) { ------------------ | | 207| 26.9k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 25.6k, False: 1.34k] | | ------------------ ------------------ 588| 25.6k| filter = mk_list_entry(head, struct flb_filter_plugin, _head); ------------------ | | 214| 25.6k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 25.6k|#define container_of(ptr, type, member) ({ \ | | | | 39| 25.6k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 25.6k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 589| 25.6k| mk_list_del(&filter->_head); 590| 25.6k| flb_free(filter); 591| 25.6k| } 592| 1.34k|} flb_config.c:flb_strdup: 45| 2.69k|{ 46| 2.69k| return flb_strndup(s, strlen(s)); 47| 2.69k|} flb_config.c:flb_strndup: 31| 2.69k|{ 32| 2.69k| char *str; 33| | 34| 2.69k| str = (char *) flb_malloc(n + 1); 35| 2.69k| if (!str) { ------------------ | Branch (35:9): [True: 0, False: 2.69k] ------------------ 36| 0| return NULL; 37| 0| } 38| 2.69k| memcpy(str, s, n); 39| 2.69k| str[n] = '\0'; 40| | 41| 2.69k| return str; 42| 2.69k|} flb_config.c:flb_str_emptyval: 51| 4.04k|{ 52| 4.04k| if (s != NULL && strcmp(s, "") == 0) { ------------------ | Branch (52:9): [True: 0, False: 4.04k] | 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| 4.04k| return FLB_FALSE; ------------------ | | 25| 4.04k|#define FLB_FALSE 0 ------------------ 56| 4.04k|} flb_parser.c:flb_strdup: 45| 13.4k|{ 46| 13.4k| return flb_strndup(s, strlen(s)); 47| 13.4k|} flb_parser.c:flb_strndup: 31| 13.4k|{ 32| 13.4k| char *str; 33| | 34| 13.4k| str = (char *) flb_malloc(n + 1); 35| 13.4k| if (!str) { ------------------ | Branch (35:9): [True: 0, False: 13.4k] ------------------ 36| 0| return NULL; 37| 0| } 38| 13.4k| memcpy(str, s, n); 39| 13.4k| str[n] = '\0'; 40| | 41| 13.4k| return str; 42| 13.4k|} cfl_kvlist.c:cfl_list_init: 55| 1.34k|{ 56| 1.34k| list->next = list; 57| 1.34k| list->prev = list; 58| 1.34k|} cfl_kvlist_create: 26| 1.34k|{ 27| 1.34k| struct cfl_kvlist *list; 28| | 29| 1.34k| list = malloc(sizeof(struct cfl_kvlist)); 30| 1.34k| if (list == NULL) { ------------------ | Branch (30:9): [True: 0, False: 1.34k] ------------------ 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| 1.34k| cfl_list_init(&list->list); 36| 1.34k| return list; 37| 1.34k|} cfl_kvlist_destroy: 40| 1.34k|{ 41| 1.34k| struct cfl_list *tmp; 42| 1.34k| struct cfl_list *head; 43| 1.34k| struct cfl_kvpair *pair; 44| | 45| 1.34k| cfl_list_foreach_safe(head, tmp, &list->list) { ------------------ | | 158| 1.34k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (158:47): [True: 0, False: 1.34k] | | ------------------ ------------------ 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| 1.34k| free(list); 60| 1.34k|} flb_config.c:MK_EVENT_ZERO: 123| 4.04k|{ 124| 4.04k| MK_EVENT_INIT(e, -1, NULL, NULL); 125| 4.04k|} flb_config.c:MK_EVENT_INIT: 113| 4.04k|{ 114| 4.04k| ev->fd = fd; 115| 4.04k| ev->type = MK_EVENT_CUSTOM; ------------------ | | 33| 4.04k|#define MK_EVENT_CUSTOM 4 /* custom fd registered */ ------------------ 116| 4.04k| ev->mask = MK_EVENT_EMPTY; ------------------ | | 37| 4.04k|#define MK_EVENT_EMPTY 0 ------------------ 117| 4.04k| ev->status = MK_EVENT_NONE; ------------------ | | 52| 4.04k|#define MK_EVENT_NONE 1 /* nothing */ ------------------ 118| 4.04k| ev->data = data; 119| 4.04k| ev->handler = callback; 120| 4.04k|} flb_config.c:mk_list_add: 64| 75.4k|{ 65| 75.4k| __mk_list_add(_new, head->prev, head); 66| 75.4k|} flb_config.c:__mk_list_add: 56| 75.4k|{ 57| 75.4k| next->prev = _new; 58| 75.4k| _new->next = next; 59| 75.4k| _new->prev = prev; 60| 75.4k| prev->next = _new; 61| 75.4k|} flb_config.c:mk_list_del: 146| 75.4k|{ 147| 75.4k| __mk_list_del(entry->prev, entry->next); 148| 75.4k| entry->prev = NULL; 149| 75.4k| entry->next = NULL; 150| 75.4k|} flb_config.c:__mk_list_del: 140| 75.4k|{ 141| 75.4k| prev->next = next; 142| 75.4k| next->prev = prev; 143| 75.4k|} flb_config.c:mk_list_init: 49| 25.6k|{ 50| 25.6k| list->next = list; 51| 25.6k| list->prev = list; 52| 25.6k|} flb_plugin.c:mk_list_init: 49| 4.04k|{ 50| 4.04k| list->next = list; 51| 4.04k| list->prev = list; 52| 4.04k|} flb_config_format.c:mk_list_init: 49| 14.8k|{ 50| 14.8k| list->next = list; 51| 14.8k| list->prev = list; 52| 14.8k|} flb_config_format.c:mk_list_add: 64| 1.34k|{ 65| 1.34k| __mk_list_add(_new, head->prev, head); 66| 1.34k|} flb_config_format.c:__mk_list_add: 56| 1.34k|{ 57| 1.34k| next->prev = _new; 58| 1.34k| _new->next = next; 59| 1.34k| _new->prev = prev; 60| 1.34k| prev->next = _new; 61| 1.34k|} flb_config_format.c:mk_list_del: 146| 1.34k|{ 147| 1.34k| __mk_list_del(entry->prev, entry->next); 148| 1.34k| entry->prev = NULL; 149| 1.34k| entry->next = NULL; 150| 1.34k|} flb_config_format.c:__mk_list_del: 140| 1.34k|{ 141| 1.34k| prev->next = next; 142| 1.34k| next->prev = prev; 143| 1.34k|} flb_parser.c:mk_list_add: 64| 4.04k|{ 65| 4.04k| __mk_list_add(_new, head->prev, head); 66| 4.04k|} flb_parser.c:__mk_list_add: 56| 4.04k|{ 57| 4.04k| next->prev = _new; 58| 4.04k| _new->next = next; 59| 4.04k| _new->prev = prev; 60| 4.04k| prev->next = _new; 61| 4.04k|} flb_parser.c:mk_list_del: 146| 4.04k|{ 147| 4.04k| __mk_list_del(entry->prev, entry->next); 148| 4.04k| entry->prev = NULL; 149| 4.04k| entry->next = NULL; 150| 4.04k|} flb_parser.c:__mk_list_del: 140| 4.04k|{ 141| 4.04k| prev->next = next; 142| 4.04k| next->prev = prev; 143| 4.04k|} flb_hash_table.c:mk_list_init: 49| 87.6k|{ 50| 87.6k| list->next = list; 51| 87.6k| list->prev = list; 52| 87.6k|} flb_slist.c:mk_list_init: 49| 29.6k|{ 50| 29.6k| list->next = list; 51| 29.6k| list->prev = list; 52| 29.6k|} flb_slist.c:mk_list_add: 64| 43.1k|{ 65| 43.1k| __mk_list_add(_new, head->prev, head); 66| 43.1k|} flb_slist.c:__mk_list_add: 56| 43.1k|{ 57| 43.1k| next->prev = _new; 58| 43.1k| _new->next = next; 59| 43.1k| _new->prev = prev; 60| 43.1k| prev->next = _new; 61| 43.1k|} flb_slist.c:mk_list_del: 146| 43.1k|{ 147| 43.1k| __mk_list_del(entry->prev, entry->next); 148| 43.1k| entry->prev = NULL; 149| 43.1k| entry->next = NULL; 150| 43.1k|} flb_slist.c:__mk_list_del: 140| 43.1k|{ 141| 43.1k| prev->next = next; 142| 43.1k| next->prev = prev; 143| 43.1k|} flb_ml_parser.c:mk_list_init: 49| 8.08k|{ 50| 8.08k| list->next = list; 51| 8.08k| list->prev = list; 52| 8.08k|} flb_ml_parser.c:mk_list_add: 64| 8.08k|{ 65| 8.08k| __mk_list_add(_new, head->prev, head); 66| 8.08k|} flb_ml_parser.c:__mk_list_add: 56| 8.08k|{ 57| 8.08k| next->prev = _new; 58| 8.08k| _new->next = next; 59| 8.08k| _new->prev = prev; 60| 8.08k| prev->next = _new; 61| 8.08k|} flb_ml_parser.c:mk_list_del: 146| 8.08k|{ 147| 8.08k| __mk_list_del(entry->prev, entry->next); 148| 8.08k| entry->prev = NULL; 149| 8.08k| entry->next = NULL; 150| 8.08k|} flb_ml_parser.c:__mk_list_del: 140| 8.08k|{ 141| 8.08k| prev->next = next; 142| 8.08k| next->prev = prev; 143| 8.08k|} flb_ml_rule.c:mk_list_init: 49| 29.6k|{ 50| 29.6k| list->next = list; 51| 29.6k| list->prev = list; 52| 29.6k|} flb_ml_rule.c:mk_list_size: 162| 29.6k|{ 163| 29.6k| int ret = 0; 164| 29.6k| struct mk_list *it; 165| 114k| for (it = head->next; it != head; it = it->next, ret++); ------------------ | Branch (165:27): [True: 84.9k, False: 29.6k] ------------------ 166| 29.6k| return ret; 167| 29.6k|} flb_ml_rule.c:mk_list_add: 64| 113k|{ 65| 113k| __mk_list_add(_new, head->prev, head); 66| 113k|} flb_ml_rule.c:__mk_list_add: 56| 113k|{ 57| 113k| next->prev = _new; 58| 113k| _new->next = next; 59| 113k| _new->prev = prev; 60| 113k| prev->next = _new; 61| 113k|} flb_ml_rule.c:mk_list_del: 146| 113k|{ 147| 113k| __mk_list_del(entry->prev, entry->next); 148| 113k| entry->prev = NULL; 149| 113k| entry->next = NULL; 150| 113k|} flb_ml_rule.c:__mk_list_del: 140| 113k|{ 141| 113k| prev->next = next; 142| 113k| next->prev = prev; 143| 113k|} flb_kernel.c:mk_mem_free: 98| 2.69k|{ 99| |#ifdef MALLOC_JEMALLOC 100| | je_free(ptr); 101| |#else 102| 2.69k| free(ptr); 103| 2.69k|#endif 104| 2.69k|} mk_string.c:mk_mem_alloc: 49| 2.69k|{ 50| |#ifdef MALLOC_JEMALLOC 51| | void *aux = je_malloc(size); 52| |#else 53| 2.69k| void *aux = malloc(size); 54| 2.69k|#endif 55| | 56| 2.69k| if (mk_unlikely(!aux && size)) { ------------------ | | 116| 2.69k| #define mk_unlikely(x) __builtin_expect((x),0) | | ------------------ | | | Branch (116:26): [True: 0, False: 2.69k] | | | Branch (116:44): [True: 0, False: 2.69k] | | | Branch (116:44): [True: 0, False: 0] | | ------------------ ------------------ 57| 0| perror("malloc"); 58| 0| return NULL; 59| 0| } 60| | 61| 2.69k| return aux; 62| 2.69k|} mk_string_char_search: 287| 44.4k|{ 288| 44.4k| char *p; 289| | 290| 44.4k| if (len < 0) { ------------------ | Branch (290:9): [True: 0, False: 44.4k] ------------------ 291| 0| len = strlen(string); 292| 0| } 293| | 294| 44.4k| p = memchr(string, c, len); 295| 44.4k| if (p) { ------------------ | Branch (295:9): [True: 14.8k, False: 29.6k] ------------------ 296| 14.8k| return (p - string); 297| 14.8k| } 298| | 299| 29.6k| return -1; 300| 44.4k|} mk_string_copy_substr: 591| 2.69k|{ 592| 2.69k| unsigned int size, bytes; 593| 2.69k| char *buffer = 0; 594| | 595| 2.69k| if (pos_init > pos_end) { ------------------ | Branch (595:9): [True: 0, False: 2.69k] ------------------ 596| 0| return NULL; 597| 0| } 598| | 599| 2.69k| size = (unsigned int) (pos_end - pos_init) + 1; 600| 2.69k| if (size <= 2) { ------------------ | Branch (600:9): [True: 1.34k, False: 1.34k] ------------------ 601| 1.34k| size = 4; 602| 1.34k| } 603| | 604| 2.69k| buffer = mk_mem_alloc(size); 605| | 606| 2.69k| if (!buffer) { ------------------ | Branch (606:9): [True: 0, False: 2.69k] ------------------ 607| 0| return NULL; 608| 0| } 609| | 610| 2.69k| bytes = pos_end - pos_init; 611| 2.69k| memcpy(buffer, string + pos_init, bytes); 612| 2.69k| buffer[bytes] = '\0'; 613| | 614| 2.69k| return (char *) buffer; 615| 2.69k|} flb_parser_logfmt.c:msgpack_packer_init: 131| 1.34k|{ 132| 1.34k| pk->data = data; 133| 1.34k| pk->callback = callback; 134| 1.34k|} flb_parser_logfmt.c:msgpack_pack_str: 763| 7.58M|{ 764| 7.58M| if(l < 32) { ------------------ | Branch (764:8): [True: 7.57M, False: 1.85k] ------------------ 765| 7.57M| unsigned char d = 0xa0 | (uint8_t)l; 766| 7.57M| msgpack_pack_append_buffer(x, &TAKE8_8(d), 1); ------------------ | | 126| 7.57M| return (*(user)->callback)((user)->data, (const char*)buf, len) ------------------ 767| 7.57M| } else if(l < 256) { ------------------ | Branch (767:15): [True: 888, False: 970] ------------------ 768| 888| unsigned char buf[2]; 769| 888| buf[0] = 0xd9; buf[1] = (uint8_t)l; 770| 888| msgpack_pack_append_buffer(x, buf, 2); ------------------ | | 126| 888| return (*(user)->callback)((user)->data, (const char*)buf, len) ------------------ 771| 970| } else if(l < 65536) { ------------------ | Branch (771:15): [True: 850, False: 120] ------------------ 772| 850| unsigned char buf[3]; 773| 850| buf[0] = 0xda; _msgpack_store16(&buf[1], (uint16_t)l); ------------------ | | 182| 850| do { uint16_t val = _msgpack_be16(num); memcpy(to, &val, 2); } while(0) | | ------------------ | | | | 110| 850|# define _msgpack_be16(x) ntohs((uint16_t)x) | | ------------------ | | | Branch (182:74): [Folded - Ignored] | | ------------------ ------------------ 774| 850| msgpack_pack_append_buffer(x, buf, 3); ------------------ | | 126| 850| return (*(user)->callback)((user)->data, (const char*)buf, len) ------------------ 775| 850| } else { 776| 120| unsigned char buf[5]; 777| 120| buf[0] = 0xdb; _msgpack_store32(&buf[1], (uint32_t)l); ------------------ | | 184| 120| do { uint32_t val = _msgpack_be32(num); memcpy(to, &val, 4); } while(0) | | ------------------ | | | | 124| 120|# define _msgpack_be32(x) ntohl((uint32_t)x) | | ------------------ | | | Branch (184:74): [Folded - Ignored] | | ------------------ ------------------ 778| 120| msgpack_pack_append_buffer(x, buf, 5); ------------------ | | 126| 120| return (*(user)->callback)((user)->data, (const char*)buf, len) ------------------ 779| 120| } 780| 7.58M|} flb_parser_logfmt.c:msgpack_pack_str_body: 783| 7.58M|{ 784| 7.58M| msgpack_pack_append_buffer(x, (const unsigned char*)b, l); ------------------ | | 126| 7.58M| return (*(user)->callback)((user)->data, (const char*)buf, len) ------------------ 785| 7.58M|} flb_parser_logfmt.c:msgpack_pack_true: 704| 5.97M|{ 705| 5.97M| static const unsigned char d = 0xc3; 706| 5.97M| msgpack_pack_append_buffer(x, &d, 1); ------------------ | | 126| 5.97M| return (*(user)->callback)((user)->data, (const char*)buf, len) ------------------ 707| 5.97M|} flb_parser_logfmt.c:msgpack_pack_map: 742| 1.34k|{ 743| 1.34k| if(n < 16) { ------------------ | Branch (743:8): [True: 1.13k, False: 215] ------------------ 744| 1.13k| unsigned char d = 0x80 | (uint8_t)n; 745| 1.13k| msgpack_pack_append_buffer(x, &TAKE8_8(d), 1); ------------------ | | 126| 1.13k| return (*(user)->callback)((user)->data, (const char*)buf, len) ------------------ 746| 1.13k| } else if(n < 65536) { ------------------ | Branch (746:15): [True: 196, False: 19] ------------------ 747| 196| unsigned char buf[3]; 748| 196| buf[0] = 0xde; _msgpack_store16(&buf[1], (uint16_t)n); ------------------ | | 182| 196| do { uint16_t val = _msgpack_be16(num); memcpy(to, &val, 2); } while(0) | | ------------------ | | | | 110| 196|# define _msgpack_be16(x) ntohs((uint16_t)x) | | ------------------ | | | Branch (182:74): [Folded - Ignored] | | ------------------ ------------------ 749| 196| msgpack_pack_append_buffer(x, buf, 3); ------------------ | | 126| 196| return (*(user)->callback)((user)->data, (const char*)buf, len) ------------------ 750| 196| } else { 751| 19| unsigned char buf[5]; 752| 19| buf[0] = 0xdf; _msgpack_store32(&buf[1], (uint32_t)n); ------------------ | | 184| 19| do { uint32_t val = _msgpack_be32(num); memcpy(to, &val, 4); } while(0) | | ------------------ | | | | 124| 19|# define _msgpack_be32(x) ntohl((uint32_t)x) | | ------------------ | | | Branch (184:74): [Folded - Ignored] | | ------------------ ------------------ 753| 19| msgpack_pack_append_buffer(x, buf, 5); ------------------ | | 126| 19| return (*(user)->callback)((user)->data, (const char*)buf, len) ------------------ 754| 19| } 755| 1.34k|} flb_parser_logfmt.c:msgpack_sbuffer_init: 35| 1.34k|{ 36| 1.34k| memset(sbuf, 0, sizeof(msgpack_sbuffer)); 37| 1.34k|} flb_parser_logfmt.c:msgpack_sbuffer_write: 61| 21.1M|{ 62| 21.1M| msgpack_sbuffer* sbuf = (msgpack_sbuffer*)data; 63| | 64| 21.1M| assert(buf || len == 0); 65| 21.1M| if(!buf) return 0; ------------------ | Branch (65:8): [True: 0, False: 21.1M] ------------------ 66| | 67| 21.1M| if(sbuf->alloc - sbuf->size < len) { ------------------ | Branch (67:8): [True: 1.98k, False: 21.1M] ------------------ 68| 1.98k| void* tmp; 69| 1.98k| size_t nsize = (sbuf->alloc) ? ------------------ | Branch (69:24): [True: 634, False: 1.34k] ------------------ 70| 1.34k| sbuf->alloc * 2 : MSGPACK_SBUFFER_INIT_SIZE; ------------------ | | 57| 1.34k|#define MSGPACK_SBUFFER_INIT_SIZE 8192 ------------------ 71| | 72| 2.43k| while(nsize < sbuf->size + len) { ------------------ | Branch (72:15): [True: 456, False: 1.98k] ------------------ 73| 456| size_t tmp_nsize = nsize * 2; 74| 456| if (tmp_nsize <= nsize) { ------------------ | Branch (74:17): [True: 0, False: 456] ------------------ 75| 0| nsize = sbuf->size + len; 76| 0| break; 77| 0| } 78| 456| nsize = tmp_nsize; 79| 456| } 80| | 81| 1.98k| tmp = realloc(sbuf->data, nsize); 82| 1.98k| if(!tmp) { return -1; } ------------------ | Branch (82:12): [True: 0, False: 1.98k] ------------------ 83| | 84| 1.98k| sbuf->data = (char*)tmp; 85| 1.98k| sbuf->alloc = nsize; 86| 1.98k| } 87| | 88| 21.1M| memcpy(sbuf->data + sbuf->size, buf, len); 89| 21.1M| sbuf->size += len; 90| | 91| 21.1M| return 0; 92| 21.1M|} flb_parser_logfmt.c:msgpack_sbuffer_destroy: 40| 31|{ 41| 31| free(sbuf->data); 42| 31|} onigenc_unicode_is_code_ctype: 183| 40.4k|{ 184| 40.4k| if ( 185| 40.4k|#ifdef USE_UNICODE_PROPERTIES 186| 40.4k| ctype <= ONIGENC_MAX_STD_CTYPE && ------------------ | | 309| 40.4k|#define ONIGENC_MAX_STD_CTYPE ONIGENC_CTYPE_ASCII | | ------------------ | | | | 308| 80.8k|#define ONIGENC_CTYPE_ASCII 14 | | ------------------ ------------------ | Branch (186:7): [True: 40.4k, False: 0] ------------------ 187| 40.4k|#endif 188| 40.4k| code < 256) { ------------------ | Branch (188:7): [True: 40.4k, False: 0] ------------------ 189| 40.4k| return ONIGENC_IS_UNICODE_ISO_8859_1_CTYPE(code, ctype); ------------------ | | 33| 40.4k| ((EncUNICODE_ISO_8859_1_CtypeTable[code] & CTYPE_TO_BIT(ctype)) != 0) | | ------------------ | | | | 112| 40.4k|#define CTYPE_TO_BIT(ctype) (1<<(ctype)) | | ------------------ ------------------ 190| 40.4k| } 191| | 192| 0| if (ctype >= CODE_RANGES_NUM) { ------------------ | | 179| 0|#define CODE_RANGES_NUM numberof(CodeRanges) | | ------------------ | | | | 128| 0|# define numberof(array) (int )(sizeof(array) / sizeof((array)[0])) | | ------------------ ------------------ | Branch (192:7): [True: 0, False: 0] ------------------ 193| 0| return ONIGERR_TYPE_BUG; ------------------ | | 630| 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| 17.5k|{ 203| 17.5k| if (ctype >= CODE_RANGES_NUM) { ------------------ | | 179| 17.5k|#define CODE_RANGES_NUM numberof(CodeRanges) | | ------------------ | | | | 128| 17.5k|# define numberof(array) (int )(sizeof(array) / sizeof((array)[0])) | | ------------------ ------------------ | Branch (203:7): [True: 0, False: 17.5k] ------------------ 204| 0| return ONIGERR_TYPE_BUG; ------------------ | | 630| 0|#define ONIGERR_TYPE_BUG -6 ------------------ 205| 0| } 206| | 207| 17.5k| *ranges = CodeRanges[ctype]; 208| | 209| 17.5k| return 0; 210| 17.5k|} utf_8.c:mbc_enc_len: 317| 3.33M|{ 318| 3.33M| int firstbyte = *p++; 319| 3.33M| state_t s; 320| 3.33M| s = trans[0][firstbyte]; 321| 3.33M| if (s < 0) return s == ACCEPT ? ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(1) : ------------------ | | 345| 3.33M|#define ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(n) (n) ------------------ | Branch (321:7): [True: 3.33M, False: 0] | Branch (321:21): [True: 3.33M, False: 0] ------------------ 322| 3.33M| 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.03M|{ 382| 1.03M| int c, len; 383| 1.03M| OnigCodePoint n; 384| | 385| 1.03M| len = mbc_enc_len(p, end, enc); 386| 1.03M| c = *p++; 387| 1.03M| if (len > 1) { ------------------ | Branch (387:7): [True: 0, False: 1.03M] ------------------ 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.03M| else { 397| 1.03M|#ifdef USE_INVALID_CODE_SCHEME 398| 1.03M| if (c > 0xfd) { ------------------ | Branch (398:9): [True: 0, False: 1.03M] ------------------ 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.03M|#endif 402| 1.03M| return (OnigCodePoint )c; 403| 1.03M| } 404| 1.03M|} utf_8.c:code_to_mbclen: 408| 66.0k|{ 409| 66.0k| if ((code & 0xffffff80) == 0) return 1; ------------------ | Branch (409:12): [True: 66.0k, 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; ------------------ | | 691| 0|#define ONIGERR_TOO_BIG_WIDE_CHAR_VALUE -401 ------------------ 425| 66.0k|} utf_8.c:get_ctype_code_range: 524| 17.5k|{ 525| 17.5k| *sb_out = 0x80; 526| 17.5k| return onigenc_unicode_ctype_code_range(ctype, ranges); 527| 17.5k|} onig_bbuf_init: 143| 48.5k|{ 144| 48.5k| if (size <= 0) { ------------------ | Branch (144:7): [True: 0, False: 48.5k] ------------------ 145| 0| size = 0; 146| 0| buf->p = NULL; 147| 0| } 148| 48.5k| else { 149| 48.5k| buf->p = (UChar* )xmalloc(size); ------------------ | | 142| 48.5k|# define xmalloc malloc ------------------ 150| 48.5k| if (IS_NULL(buf->p)) return(ONIGERR_MEMORY); ------------------ | | 305| 48.5k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 48.5k] | | ------------------ ------------------ if (IS_NULL(buf->p)) return(ONIGERR_MEMORY); ------------------ | | 629| 0|#define ONIGERR_MEMORY -5 ------------------ 151| 48.5k| } 152| | 153| 48.5k| buf->alloc = (unsigned int )size; 154| 48.5k| buf->used = 0; 155| 48.5k| return 0; 156| 48.5k|} onig_free_body: 5537| 31.0k|{ 5538| 31.0k| if (IS_NOT_NULL(reg)) { ------------------ | | 306| 31.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 31.0k, False: 0] | | ------------------ ------------------ 5539| 31.0k| if (IS_NOT_NULL(reg->p)) xfree(reg->p); ------------------ | | 306| 31.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 31.0k, False: 0] | | ------------------ ------------------ if (IS_NOT_NULL(reg->p)) xfree(reg->p); ------------------ | | 145| 31.0k|# define xfree free ------------------ 5540| 31.0k| if (IS_NOT_NULL(reg->exact)) xfree(reg->exact); ------------------ | | 306| 31.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 14.8k, False: 16.1k] | | ------------------ ------------------ if (IS_NOT_NULL(reg->exact)) xfree(reg->exact); ------------------ | | 145| 14.8k|# define xfree free ------------------ 5541| 31.0k| if (IS_NOT_NULL(reg->repeat_range)) xfree(reg->repeat_range); ------------------ | | 306| 31.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 31.0k] | | ------------------ ------------------ if (IS_NOT_NULL(reg->repeat_range)) xfree(reg->repeat_range); ------------------ | | 145| 0|# define xfree free ------------------ 5542| 31.0k| if (IS_NOT_NULL(reg->chain)) onig_free(reg->chain); ------------------ | | 306| 31.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 31.0k] | | ------------------ ------------------ 5543| | 5544| 31.0k|#ifdef USE_NAMED_GROUP 5545| 31.0k| onig_names_free(reg); 5546| 31.0k|#endif 5547| 31.0k| } 5548| 31.0k|} onig_free: 5552| 31.0k|{ 5553| 31.0k| if (IS_NOT_NULL(reg)) { ------------------ | | 306| 31.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 31.0k, False: 0] | | ------------------ ------------------ 5554| 31.0k| onig_free_body(reg); 5555| 31.0k| xfree(reg); ------------------ | | 145| 31.0k|# define xfree free ------------------ 5556| 31.0k| } 5557| 31.0k|} onig_compile: 5622| 31.0k|{ 5623| 31.0k|#define COMPILE_INIT_SIZE 20 5624| | 5625| 31.0k| int r; 5626| 31.0k| OnigDistance init_size; 5627| 31.0k| Node* root; 5628| 31.0k| ScanEnv scan_env = {0}; 5629| 31.0k|#ifdef USE_SUBEXP_CALL 5630| 31.0k| UnsetAddrList uslist; 5631| 31.0k|#endif 5632| | 5633| 31.0k| if (IS_NOT_NULL(einfo)) einfo->par = (UChar* )NULL; ------------------ | | 306| 31.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 31.0k, False: 0] | | ------------------ ------------------ 5634| | 5635| |#ifdef RUBY 5636| | scan_env.sourcefile = sourcefile; 5637| | scan_env.sourceline = sourceline; 5638| |#endif 5639| | 5640| |#ifdef ONIG_DEBUG 5641| | print_enc_string(stderr, reg->enc, pattern, pattern_end); 5642| |#endif 5643| | 5644| 31.0k| if (reg->alloc == 0) { ------------------ | Branch (5644:7): [True: 31.0k, False: 0] ------------------ 5645| 31.0k| init_size = (pattern_end - pattern) * 2; 5646| 31.0k| if (init_size <= 0) init_size = COMPILE_INIT_SIZE; ------------------ | | 5623| 0|#define COMPILE_INIT_SIZE 20 ------------------ | Branch (5646:9): [True: 0, False: 31.0k] ------------------ 5647| 31.0k| r = BBUF_INIT(reg, init_size); ------------------ | | 454| 31.0k|#define BBUF_INIT(buf,size) onig_bbuf_init((BBuf* )(buf), (size)) ------------------ 5648| 31.0k| if (r != 0) goto end; ------------------ | Branch (5648:9): [True: 0, False: 31.0k] ------------------ 5649| 31.0k| } 5650| 0| else 5651| 0| reg->used = 0; 5652| | 5653| 31.0k| reg->num_mem = 0; 5654| 31.0k| reg->num_repeat = 0; 5655| 31.0k| reg->num_null_check = 0; 5656| 31.0k| reg->repeat_range_alloc = 0; 5657| 31.0k| reg->repeat_range = (OnigRepeatRange* )NULL; 5658| |#ifdef USE_COMBINATION_EXPLOSION_CHECK 5659| | reg->num_comb_exp_check = 0; 5660| |#endif 5661| | 5662| 31.0k| r = onig_parse_make_tree(&root, pattern, pattern_end, reg, &scan_env); 5663| 31.0k| if (r != 0) goto err; ------------------ | Branch (5663:7): [True: 0, False: 31.0k] ------------------ 5664| | 5665| |#ifdef ONIG_DEBUG_PARSE_TREE 5666| |# if 0 5667| | fprintf(stderr, "ORIGINAL PARSE TREE:\n"); 5668| | print_tree(stderr, root); 5669| |# endif 5670| |#endif 5671| | 5672| 31.0k|#ifdef USE_NAMED_GROUP 5673| | /* mixed use named group and no-named group */ 5674| 31.0k| if (scan_env.num_named > 0 && ------------------ | Branch (5674:7): [True: 1.34k, False: 29.6k] ------------------ 5675| 31.0k| IS_SYNTAX_BV(scan_env.syntax, ONIG_SYN_CAPTURE_ONLY_NAMED_GROUP) && ------------------ | | 332| 32.3k|#define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0) | | ------------------ | | | Branch (332:35): [True: 1.34k, False: 0] | | ------------------ ------------------ 5676| 31.0k| !ONIG_IS_OPTION_ON(reg->options, ONIG_OPTION_CAPTURE_GROUP)) { ------------------ | | 476| 1.34k|#define ONIG_IS_OPTION_ON(options,option) ((options) & (option)) ------------------ | Branch (5676:7): [True: 1.34k, False: 0] ------------------ 5677| 1.34k| if (scan_env.num_named != scan_env.num_mem) ------------------ | Branch (5677:9): [True: 0, False: 1.34k] ------------------ 5678| 0| r = disable_noname_group_capture(&root, reg, &scan_env); 5679| 1.34k| else 5680| 1.34k| r = numbered_ref_check(root); 5681| | 5682| 1.34k| if (r != 0) goto err; ------------------ | Branch (5682:9): [True: 0, False: 1.34k] ------------------ 5683| 1.34k| } 5684| 31.0k|#endif 5685| | 5686| 31.0k|#ifdef USE_SUBEXP_CALL 5687| 31.0k| if (scan_env.num_call > 0) { ------------------ | Branch (5687:7): [True: 0, False: 31.0k] ------------------ 5688| 0| r = unset_addr_list_init(&uslist, scan_env.num_call); 5689| 0| if (r != 0) goto err; ------------------ | Branch (5689:9): [True: 0, False: 0] ------------------ 5690| 0| scan_env.unset_addr_list = &uslist; 5691| 0| r = setup_subexp_call(root, &scan_env); 5692| 0| if (r != 0) goto err_unset; ------------------ | Branch (5692:9): [True: 0, False: 0] ------------------ 5693| 0| r = subexp_recursive_check_trav(root, &scan_env); 5694| 0| if (r < 0) goto err_unset; ------------------ | Branch (5694:9): [True: 0, False: 0] ------------------ 5695| 0| r = subexp_inf_recursive_check_trav(root, &scan_env); 5696| 0| if (r != 0) goto err_unset; ------------------ | Branch (5696:9): [True: 0, False: 0] ------------------ 5697| | 5698| 0| reg->num_call = scan_env.num_call; 5699| 0| } 5700| 31.0k| else 5701| 31.0k| reg->num_call = 0; 5702| 31.0k|#endif 5703| | 5704| 31.0k| r = setup_tree(root, reg, 0, &scan_env); 5705| 31.0k| if (r != 0) goto err_unset; ------------------ | Branch (5705:7): [True: 0, False: 31.0k] ------------------ 5706| | 5707| |#ifdef ONIG_DEBUG_PARSE_TREE 5708| | print_tree(stderr, root); 5709| |#endif 5710| | 5711| 31.0k| reg->capture_history = scan_env.capture_history; 5712| 31.0k| reg->bt_mem_start = scan_env.bt_mem_start; 5713| 31.0k| reg->bt_mem_start |= reg->capture_history; 5714| 31.0k| if (IS_FIND_CONDITION(reg->options)) ------------------ | | 394| 31.0k|#define IS_FIND_CONDITION(option) ((option) & \ | | ------------------ | | | Branch (394:35): [True: 0, False: 31.0k] | | ------------------ | | 395| 31.0k| (ONIG_OPTION_FIND_LONGEST | ONIG_OPTION_FIND_NOT_EMPTY)) | | ------------------ | | | | 456| 31.0k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | ------------------ | | | | | | 455| 31.0k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | ------------------ | | | | | | | | 453| 31.0k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | ------------------ | | | | | | | | | | 452| 31.0k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 451| 31.0k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ | | (ONIG_OPTION_FIND_LONGEST | ONIG_OPTION_FIND_NOT_EMPTY)) | | ------------------ | | | | 457| 31.0k|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | ------------------ | | | | | | 456| 31.0k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | ------------------ | | | | | | | | 455| 31.0k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | ------------------ | | | | | | | | | | 453| 31.0k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 452| 31.0k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 451| 31.0k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 5715| 0| BIT_STATUS_ON_ALL(reg->bt_mem_end); ------------------ | | 363| 0|#define BIT_STATUS_ON_ALL(stats) (stats) = ~((BitStatusType )0) ------------------ 5716| 31.0k| else { 5717| 31.0k| reg->bt_mem_end = scan_env.bt_mem_end; 5718| 31.0k| reg->bt_mem_end |= reg->capture_history; 5719| 31.0k| } 5720| | 5721| |#ifdef USE_COMBINATION_EXPLOSION_CHECK 5722| | if (scan_env.backrefed_mem == 0 5723| |# ifdef USE_SUBEXP_CALL 5724| | || scan_env.num_call == 0 5725| |# endif 5726| | ) { 5727| | setup_comb_exp_check(root, 0, &scan_env); 5728| |# ifdef USE_SUBEXP_CALL 5729| | if (scan_env.has_recursion != 0) { 5730| | scan_env.num_comb_exp_check = 0; 5731| | } 5732| | else 5733| |# endif 5734| | if (scan_env.comb_exp_max_regnum > 0) { 5735| | int i; 5736| | for (i = 1; i <= scan_env.comb_exp_max_regnum; i++) { 5737| | if (BIT_STATUS_AT(scan_env.backrefed_mem, i) != 0) { 5738| | scan_env.num_comb_exp_check = 0; 5739| | break; 5740| | } 5741| | } 5742| | } 5743| | } 5744| | 5745| | reg->num_comb_exp_check = scan_env.num_comb_exp_check; 5746| |#endif 5747| | 5748| 31.0k| clear_optimize_info(reg); 5749| 31.0k|#ifndef ONIG_DONT_OPTIMIZE 5750| 31.0k| r = set_optimize_info_from_tree(root, reg, &scan_env); 5751| 31.0k| if (r != 0) goto err_unset; ------------------ | Branch (5751:7): [True: 0, False: 31.0k] ------------------ 5752| 31.0k|#endif 5753| | 5754| 31.0k| if (IS_NOT_NULL(scan_env.mem_nodes_dynamic)) { ------------------ | | 306| 31.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 31.0k] | | ------------------ ------------------ 5755| 0| xfree(scan_env.mem_nodes_dynamic); ------------------ | | 145| 0|# define xfree free ------------------ 5756| 0| scan_env.mem_nodes_dynamic = (Node** )NULL; 5757| 0| } 5758| | 5759| 31.0k| r = compile_tree(root, reg); 5760| 31.0k| if (r == 0) { ------------------ | Branch (5760:7): [True: 31.0k, False: 0] ------------------ 5761| 31.0k| r = add_opcode(reg, OP_END); 5762| 31.0k|#ifdef USE_SUBEXP_CALL 5763| 31.0k| if (scan_env.num_call > 0) { ------------------ | Branch (5763:9): [True: 0, False: 31.0k] ------------------ 5764| 0| r = unset_addr_list_fix(&uslist, reg); 5765| 0| unset_addr_list_end(&uslist); 5766| 0| if (r) goto err; ------------------ | Branch (5766:11): [True: 0, False: 0] ------------------ 5767| 0| } 5768| 31.0k|#endif 5769| | 5770| 31.0k| if ((reg->num_repeat != 0) || (reg->bt_mem_end != 0)) ------------------ | Branch (5770:9): [True: 0, False: 31.0k] | Branch (5770:35): [True: 0, False: 31.0k] ------------------ 5771| 0| reg->stack_pop_level = STACK_POP_LEVEL_ALL; ------------------ | | 346| 0|#define STACK_POP_LEVEL_ALL 2 ------------------ 5772| 31.0k| else { 5773| 31.0k| if (reg->bt_mem_start != 0) ------------------ | Branch (5773:11): [True: 0, False: 31.0k] ------------------ 5774| 0| reg->stack_pop_level = STACK_POP_LEVEL_MEM_START; ------------------ | | 345| 0|#define STACK_POP_LEVEL_MEM_START 1 ------------------ 5775| 31.0k| else 5776| 31.0k| reg->stack_pop_level = STACK_POP_LEVEL_FREE; ------------------ | | 344| 31.0k|#define STACK_POP_LEVEL_FREE 0 ------------------ 5777| 31.0k| } 5778| 31.0k| } 5779| 0|#ifdef USE_SUBEXP_CALL 5780| 0| else if (scan_env.num_call > 0) { ------------------ | Branch (5780:12): [True: 0, False: 0] ------------------ 5781| 0| unset_addr_list_end(&uslist); 5782| 0| } 5783| 31.0k|#endif 5784| 31.0k| onig_node_free(root); 5785| | 5786| |#ifdef ONIG_DEBUG_COMPILE 5787| |# ifdef USE_NAMED_GROUP 5788| | onig_print_names(stderr, reg); 5789| |# endif 5790| | print_compiled_byte_code_list(stderr, reg); 5791| |#endif 5792| | 5793| 31.0k| end: 5794| 31.0k| return r; 5795| | 5796| 0| err_unset: 5797| 0|#ifdef USE_SUBEXP_CALL 5798| 0| if (scan_env.num_call > 0) { ------------------ | Branch (5798:7): [True: 0, False: 0] ------------------ 5799| 0| unset_addr_list_end(&uslist); 5800| 0| } 5801| 0|#endif 5802| 0| err: 5803| 0| if (IS_NOT_NULL(scan_env.error)) { ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 0] | | ------------------ ------------------ 5804| 0| if (IS_NOT_NULL(einfo)) { ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 0] | | ------------------ ------------------ 5805| 0| einfo->enc = scan_env.enc; 5806| 0| einfo->par = scan_env.error; 5807| 0| einfo->par_end = scan_env.error_end; 5808| 0| } 5809| 0| } 5810| | 5811| 0| onig_node_free(root); 5812| 0| if (IS_NOT_NULL(scan_env.mem_nodes_dynamic)) ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 0] | | ------------------ ------------------ 5813| 0| xfree(scan_env.mem_nodes_dynamic); ------------------ | | 145| 0|# define xfree free ------------------ 5814| 0| return r; 5815| 0|} onig_reg_init: 5823| 31.0k|{ 5824| 31.0k| if (! onig_inited) ------------------ | Branch (5824:7): [True: 1, False: 31.0k] ------------------ 5825| 1| onig_init(); 5826| | 5827| 31.0k| if (IS_NULL(reg)) ------------------ | | 305| 31.0k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 31.0k] | | ------------------ ------------------ 5828| 0| return ONIGERR_INVALID_ARGUMENT; ------------------ | | 640| 0|#define ONIGERR_INVALID_ARGUMENT -30 ------------------ 5829| | 5830| 31.0k| (reg)->exact = (UChar* )NULL; 5831| 31.0k| (reg)->chain = (regex_t* )NULL; 5832| 31.0k| (reg)->p = (UChar* )NULL; 5833| 31.0k| (reg)->name_table = (void* )NULL; 5834| 31.0k| (reg)->repeat_range = (OnigRepeatRange* )NULL; 5835| | 5836| 31.0k| if (ONIGENC_IS_UNDEF(enc)) ------------------ | | 317| 31.0k|#define ONIGENC_IS_UNDEF(enc) ((enc) == ONIG_ENCODING_UNDEF) | | ------------------ | | | | 281| 31.0k|#define ONIG_ENCODING_UNDEF ((OnigEncoding )0) | | ------------------ | | | Branch (317:40): [True: 0, False: 31.0k] | | ------------------ ------------------ 5837| 0| return ONIGERR_DEFAULT_ENCODING_IS_NOT_SET; ------------------ | | 637| 0|#define ONIGERR_DEFAULT_ENCODING_IS_NOT_SET -21 ------------------ 5838| | 5839| 31.0k| if ((option & (ONIG_OPTION_DONT_CAPTURE_GROUP|ONIG_OPTION_CAPTURE_GROUP)) ------------------ | | 459| 31.0k|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | ------------------ | | | | 458| 31.0k|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | ------------------ | | | | | | 457| 31.0k|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | ------------------ | | | | | | | | 456| 31.0k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | ------------------ | | | | | | | | | | 455| 31.0k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 453| 31.0k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 452| 31.0k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 451| 31.0k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ if ((option & (ONIG_OPTION_DONT_CAPTURE_GROUP|ONIG_OPTION_CAPTURE_GROUP)) ------------------ | | 460| 31.0k|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | ------------------ | | | | 459| 31.0k|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | ------------------ | | | | | | 458| 31.0k|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | ------------------ | | | | | | | | 457| 31.0k|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | ------------------ | | | | | | | | | | 456| 31.0k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 455| 31.0k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 453| 31.0k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 452| 31.0k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 451| 31.0k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ | Branch (5839:7): [True: 0, False: 31.0k] ------------------ 5840| 31.0k| == (ONIG_OPTION_DONT_CAPTURE_GROUP|ONIG_OPTION_CAPTURE_GROUP)) { ------------------ | | 459| 31.0k|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | ------------------ | | | | 458| 31.0k|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | ------------------ | | | | | | 457| 31.0k|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | ------------------ | | | | | | | | 456| 31.0k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | ------------------ | | | | | | | | | | 455| 31.0k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 453| 31.0k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 452| 31.0k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 451| 31.0k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ == (ONIG_OPTION_DONT_CAPTURE_GROUP|ONIG_OPTION_CAPTURE_GROUP)) { ------------------ | | 460| 31.0k|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | ------------------ | | | | 459| 31.0k|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | ------------------ | | | | | | 458| 31.0k|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | ------------------ | | | | | | | | 457| 31.0k|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | ------------------ | | | | | | | | | | 456| 31.0k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 455| 31.0k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 453| 31.0k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 452| 31.0k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 451| 31.0k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 5841| 0| return ONIGERR_INVALID_COMBINATION_OF_OPTIONS; ------------------ | | 693| 0|#define ONIGERR_INVALID_COMBINATION_OF_OPTIONS -403 ------------------ 5842| 0| } 5843| | 5844| 31.0k| if ((option & ONIG_OPTION_NEGATE_SINGLELINE) != 0) { ------------------ | | 458| 31.0k|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | ------------------ | | | | 457| 31.0k|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | ------------------ | | | | | | 456| 31.0k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | ------------------ | | | | | | | | 455| 31.0k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | ------------------ | | | | | | | | | | 453| 31.0k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 452| 31.0k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 451| 31.0k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ | Branch (5844:7): [True: 0, False: 31.0k] ------------------ 5845| 0| option |= syntax->options; 5846| 0| option &= ~ONIG_OPTION_SINGLELINE; ------------------ | | 455| 0|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | ------------------ | | | | 453| 0|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | ------------------ | | | | | | 452| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | ------------------ | | | | | | | | 451| 0|#define ONIG_OPTION_IGNORECASE 1U | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 5847| 0| } 5848| 31.0k| else 5849| 31.0k| option |= syntax->options; 5850| | 5851| 31.0k| (reg)->enc = enc; 5852| 31.0k| (reg)->options = option; 5853| 31.0k| (reg)->syntax = syntax; 5854| 31.0k| (reg)->optimize = 0; 5855| | 5856| 31.0k| (reg)->alloc = 0; 5857| 31.0k| (reg)->used = 0; 5858| | 5859| 31.0k| (reg)->case_fold_flag = case_fold_flag; 5860| 31.0k| return 0; 5861| 31.0k|} onig_new: 5881| 31.0k|{ 5882| 31.0k| int r; 5883| | 5884| 31.0k| *reg = (regex_t* )xmalloc(sizeof(regex_t)); ------------------ | | 142| 31.0k|# define xmalloc malloc ------------------ 5885| 31.0k| if (IS_NULL(*reg)) return ONIGERR_MEMORY; ------------------ | | 305| 31.0k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 31.0k] | | ------------------ ------------------ if (IS_NULL(*reg)) return ONIGERR_MEMORY; ------------------ | | 629| 0|#define ONIGERR_MEMORY -5 ------------------ 5886| | 5887| 31.0k| r = onig_reg_init(*reg, option, ONIGENC_CASE_FOLD_DEFAULT, enc, syntax); ------------------ | | 131| 31.0k|#define ONIGENC_CASE_FOLD_DEFAULT OnigDefaultCaseFoldFlag ------------------ 5888| 31.0k| if (r) goto err; ------------------ | Branch (5888:7): [True: 0, False: 31.0k] ------------------ 5889| | 5890| 31.0k| r = onig_compile(*reg, pattern, pattern_end, einfo); 5891| 31.0k| if (r) { ------------------ | Branch (5891:7): [True: 0, False: 31.0k] ------------------ 5892| 0| err: 5893| 0| onig_free(*reg); 5894| 0| *reg = NULL; 5895| 0| } 5896| 31.0k| return r; 5897| 31.0k|} onig_init: 5907| 1.34k|{ 5908| 1.34k| if (onig_inited != 0) ------------------ | Branch (5908:7): [True: 1.34k, False: 1] ------------------ 5909| 1.34k| return 0; 5910| | 5911| 1| onig_inited = 1; 5912| | 5913| |#if defined(ONIG_DEBUG_MEMLEAK) && defined(_MSC_VER) 5914| | _CrtSetDbgFlag(_CRTDBG_ALLOC_MEM_DF | _CRTDBG_LEAK_CHECK_DF); 5915| |#endif 5916| | 5917| 1| onigenc_init(); 5918| | /* onigenc_set_default_caseconv_table((UChar* )0); */ 5919| | 5920| |#ifdef ONIG_DEBUG_STATISTICS 5921| | onig_statistics_init(); 5922| |#endif 5923| | 5924| 1| return 0; 5925| 1.34k|} onig_is_code_in_cc_len: 6000| 17.5k|{ 6001| 17.5k| int found; 6002| | 6003| 17.5k| if (elen > 1 || (code >= SINGLE_BYTE_SIZE)) { ------------------ | | 420| 17.5k|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 419| 17.5k|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (6003:7): [True: 0, False: 17.5k] | Branch (6003:19): [True: 0, False: 17.5k] ------------------ 6004| 0| if (IS_NULL(cc->mbuf)) { ------------------ | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 0] | | ------------------ ------------------ 6005| 0| found = 0; 6006| 0| } 6007| 0| else { 6008| 0| found = (onig_is_in_code_range(cc->mbuf->p, code) != 0 ? 1 : 0); ------------------ | Branch (6008:16): [True: 0, False: 0] ------------------ 6009| 0| } 6010| 0| } 6011| 17.5k| else { 6012| 17.5k| found = (BITSET_AT(cc->bs, code) == 0 ? 0 : 1); ------------------ | | 442| 17.5k|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 439| 17.5k|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 17.5k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 17.5k|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 440| 17.5k|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 17.5k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 17.5k|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ | Branch (6012:14): [True: 10.7k, False: 6.74k] ------------------ 6013| 17.5k| } 6014| | 6015| 17.5k| if (IS_NCCLASS_NOT(cc)) ------------------ | | 803| 17.5k|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 796| 17.5k|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 793| 17.5k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | | | | Branch (796:37): [True: 6.74k, False: 10.7k] | | | | ------------------ | | ------------------ ------------------ 6016| 6.74k| return !found; 6017| 10.7k| else 6018| 10.7k| return found; 6019| 17.5k|} onig_is_code_in_cc: 6023| 17.5k|{ 6024| 17.5k| int len; 6025| | 6026| 17.5k| if (ONIGENC_MBC_MINLEN(enc) > 1) { ------------------ | | 364| 17.5k|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) ------------------ | Branch (6026:7): [True: 0, False: 17.5k] ------------------ 6027| 0| len = 2; 6028| 0| } 6029| 17.5k| else { 6030| 17.5k| len = ONIGENC_CODE_TO_MBCLEN(enc, code); ------------------ | | 367| 17.5k|#define ONIGENC_CODE_TO_MBCLEN(enc,code) (enc)->code_to_mbclen(code,enc) ------------------ 6031| 17.5k| } 6032| 17.5k| return onig_is_code_in_cc_len(len, code, cc); 6033| 17.5k|} regcomp.c:numbered_ref_check: 1989| 26.9k|{ 1990| 26.9k| int r = 0; 1991| | 1992| 26.9k| switch (NTYPE(node)) { ------------------ | | 69| 26.9k|#define NTYPE(node) ((node)->u.base.type) ------------------ 1993| 1.34k| case NT_LIST: ------------------ | | 46| 1.34k|#define NT_LIST 8 ------------------ | Branch (1993:3): [True: 1.34k, False: 25.6k] ------------------ 1994| 4.04k| case NT_ALT: ------------------ | | 47| 4.04k|#define NT_ALT 9 ------------------ | Branch (1994:3): [True: 2.69k, False: 24.2k] ------------------ 1995| 17.5k| do { 1996| 17.5k| r = numbered_ref_check(NCAR(node)); ------------------ | | 86| 17.5k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 17.5k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1997| 17.5k| } while (r == 0 && IS_NOT_NULL(node = NCDR(node))); ------------------ | | 306| 17.5k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 13.4k, False: 4.04k] | | ------------------ ------------------ | Branch (1997:14): [True: 17.5k, False: 0] ------------------ 1998| 4.04k| break; 1999| 2.69k| case NT_QTFR: ------------------ | | 43| 2.69k|#define NT_QTFR 5 ------------------ | Branch (1999:3): [True: 2.69k, False: 24.2k] ------------------ 2000| 2.69k| r = numbered_ref_check(NQTFR(node)->target); ------------------ | | 80| 2.69k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 2001| 2.69k| break; 2002| 5.39k| case NT_ENCLOSE: ------------------ | | 44| 5.39k|#define NT_ENCLOSE 6 ------------------ | Branch (2002:3): [True: 5.39k, False: 21.5k] ------------------ 2003| 5.39k| r = numbered_ref_check(NENCLOSE(node)->target); ------------------ | | 81| 5.39k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 2004| 5.39k| break; 2005| | 2006| 0| case NT_BREF: ------------------ | | 42| 0|#define NT_BREF 4 ------------------ | Branch (2006:3): [True: 0, False: 26.9k] ------------------ 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; ------------------ | | 675| 0|#define ONIGERR_NUMBERED_BACKREF_OR_CALL_NOT_ALLOWED -209 ------------------ 2009| 0| break; 2010| | 2011| 2.69k| case NT_ANCHOR: ------------------ | | 45| 2.69k|#define NT_ANCHOR 7 ------------------ | Branch (2011:3): [True: 2.69k, False: 24.2k] ------------------ 2012| 2.69k| if (NANCHOR(node)->target) ------------------ | | 82| 2.69k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ | Branch (2012:9): [True: 0, False: 2.69k] ------------------ 2013| 0| r = numbered_ref_check(NANCHOR(node)->target); ------------------ | | 82| 0|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 2014| 2.69k| break; 2015| | 2016| 12.1k| default: ------------------ | Branch (2016:3): [True: 12.1k, False: 14.8k] ------------------ 2017| 12.1k| break; 2018| 26.9k| } 2019| | 2020| 26.9k| return r; 2021| 26.9k|} regcomp.c:get_min_match_length: 2157| 48.5k|{ 2158| 48.5k| OnigDistance tmin; 2159| 48.5k| int r = 0; 2160| | 2161| 48.5k| *min = 0; 2162| 48.5k| switch (NTYPE(node)) { ------------------ | | 69| 48.5k|#define NTYPE(node) ((node)->u.base.type) ------------------ 2163| 0| case NT_BREF: ------------------ | | 42| 0|#define NT_BREF 4 ------------------ | Branch (2163:3): [True: 0, False: 48.5k] ------------------ 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) ? \ | | ------------------ | | | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | | | ------------------ | | | | | Branch (306: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); | | ------------------ | | | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | | | ------------------ | | | | | Branch (306:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 2172| 0| if (backs[0] > env->num_mem) return ONIGERR_INVALID_BACKREF; ------------------ | | 674| 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; ------------------ | | 674| 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: 48.5k] ------------------ 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| 2.69k| case NT_LIST: ------------------ | | 46| 2.69k|#define NT_LIST 8 ------------------ | Branch (2196:3): [True: 2.69k, False: 45.8k] ------------------ 2197| 5.39k| do { 2198| 5.39k| r = get_min_match_length(NCAR(node), &tmin, env); ------------------ | | 86| 5.39k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 5.39k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 2199| 5.39k| if (r == 0) *min += tmin; ------------------ | Branch (2199:11): [True: 5.39k, False: 0] ------------------ 2200| 5.39k| } while (r == 0 && IS_NOT_NULL(node = NCDR(node))); ------------------ | | 306| 5.39k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 2.69k, False: 2.69k] | | ------------------ ------------------ | Branch (2200:14): [True: 5.39k, False: 0] ------------------ 2201| 2.69k| break; 2202| | 2203| 0| case NT_ALT: ------------------ | | 47| 0|#define NT_ALT 9 ------------------ | Branch (2203:3): [True: 0, False: 48.5k] ------------------ 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))); ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 0] | | ------------------ ------------------ | Branch (2213:16): [True: 0, False: 0] ------------------ 2214| 0| } 2215| 0| break; 2216| | 2217| 4.04k| case NT_STR: ------------------ | | 38| 4.04k|#define NT_STR 0 ------------------ | Branch (2217:3): [True: 4.04k, False: 44.4k] ------------------ 2218| 4.04k| { 2219| 4.04k| StrNode* sn = NSTR(node); ------------------ | | 76| 4.04k|#define NSTR(node) (&((node)->u.str)) ------------------ 2220| 4.04k| *min = sn->end - sn->s; 2221| 4.04k| } 2222| 4.04k| break; 2223| | 2224| 0| case NT_CTYPE: ------------------ | | 40| 0|#define NT_CTYPE 2 ------------------ | Branch (2224:3): [True: 0, False: 48.5k] ------------------ 2225| 0| *min = 1; 2226| 0| break; 2227| | 2228| 31.0k| case NT_CCLASS: ------------------ | | 39| 31.0k|#define NT_CCLASS 1 ------------------ | Branch (2228:3): [True: 31.0k, False: 17.5k] ------------------ 2229| 39.0k| case NT_CANY: ------------------ | | 41| 39.0k|#define NT_CANY 3 ------------------ | Branch (2229:3): [True: 8.08k, False: 40.4k] ------------------ 2230| 39.0k| *min = 1; 2231| 39.0k| break; 2232| | 2233| 2.69k| case NT_QTFR: ------------------ | | 43| 2.69k|#define NT_QTFR 5 ------------------ | Branch (2233:3): [True: 2.69k, False: 45.8k] ------------------ 2234| 2.69k| { 2235| 2.69k| QtfrNode* qn = NQTFR(node); ------------------ | | 80| 2.69k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 2236| | 2237| 2.69k| if (qn->lower > 0) { ------------------ | Branch (2237:11): [True: 2.69k, False: 0] ------------------ 2238| 2.69k| r = get_min_match_length(qn->target, min, env); 2239| 2.69k| if (r == 0) ------------------ | Branch (2239:6): [True: 2.69k, False: 0] ------------------ 2240| 2.69k| *min = distance_multiply(*min, qn->lower); 2241| 2.69k| } 2242| 2.69k| } 2243| 2.69k| break; 2244| | 2245| 0| case NT_ENCLOSE: ------------------ | | 44| 0|#define NT_ENCLOSE 6 ------------------ | Branch (2245:3): [True: 0, False: 48.5k] ------------------ 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: 48.5k] ------------------ 2280| 0| default: ------------------ | Branch (2280:3): [True: 0, False: 48.5k] ------------------ 2281| 0| break; 2282| 48.5k| } 2283| | 2284| 48.5k| return r; 2285| 48.5k|} regcomp.c:distance_multiply: 108| 44.4k|{ 109| 44.4k| if (m == 0) return 0; ------------------ | Branch (109:7): [True: 16.1k, False: 28.3k] ------------------ 110| | 111| 28.3k| if (d < ONIG_INFINITE_DISTANCE / m) ------------------ | | 85| 28.3k|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ | Branch (111:7): [True: 28.3k, False: 0] ------------------ 112| 28.3k| return d * m; 113| 0| else 114| 0| return ONIG_INFINITE_DISTANCE; ------------------ | | 85| 0|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ 115| 28.3k|} regcomp.c:setup_tree: 3881| 231k|{ 3882| 231k| int type; 3883| 231k| int r = 0; 3884| | 3885| 231k|restart: 3886| 231k| type = NTYPE(node); ------------------ | | 69| 231k|#define NTYPE(node) ((node)->u.base.type) ------------------ 3887| 231k| switch (type) { 3888| 32.3k| case NT_LIST: ------------------ | | 46| 32.3k|#define NT_LIST 8 ------------------ | Branch (3888:3): [True: 32.3k, False: 199k] ------------------ 3889| 32.3k| { 3890| 32.3k| Node* prev = NULL_NODE; ------------------ | | 283| 32.3k|#define NULL_NODE ((Node* )0) ------------------ 3891| 133k| do { 3892| 133k| r = setup_tree(NCAR(node), reg, state, env); ------------------ | | 86| 133k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 133k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 3893| 133k| if (IS_NOT_NULL(prev) && r == 0) { ------------------ | | 306| 266k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 101k, False: 32.3k] | | ------------------ ------------------ | Branch (3893:27): [True: 101k, False: 0] ------------------ 3894| 101k| r = next_setup(prev, NCAR(node), reg); ------------------ | | 86| 101k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 101k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 3895| 101k| } 3896| 133k| prev = NCAR(node); ------------------ | | 86| 133k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 133k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 3897| 133k| } while (r == 0 && IS_NOT_NULL(node = NCDR(node))); ------------------ | | 306| 133k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 101k, False: 32.3k] | | ------------------ ------------------ | Branch (3897:16): [True: 133k, False: 0] ------------------ 3898| 32.3k| } 3899| 32.3k| break; 3900| | 3901| 8.08k| case NT_ALT: ------------------ | | 47| 8.08k|#define NT_ALT 9 ------------------ | Branch (3901:3): [True: 8.08k, False: 223k] ------------------ 3902| 18.8k| do { 3903| 18.8k| r = setup_tree(NCAR(node), reg, (state | IN_ALT), env); ------------------ | | 86| 18.8k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 18.8k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ r = setup_tree(NCAR(node), reg, (state | IN_ALT), env); ------------------ | | 3268| 18.8k|#define IN_ALT (1<<0) ------------------ 3904| 18.8k| } while (r == 0 && IS_NOT_NULL(node = NCDR(node))); ------------------ | | 306| 18.8k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 10.7k, False: 8.08k] | | ------------------ ------------------ | Branch (3904:14): [True: 18.8k, False: 0] ------------------ 3905| 8.08k| break; 3906| | 3907| 32.3k| case NT_CCLASS: ------------------ | | 39| 32.3k|#define NT_CCLASS 1 ------------------ | Branch (3907:3): [True: 32.3k, False: 199k] ------------------ 3908| 32.3k| break; 3909| | 3910| 57.9k| case NT_STR: ------------------ | | 38| 57.9k|#define NT_STR 0 ------------------ | Branch (3910:3): [True: 57.9k, False: 173k] ------------------ 3911| 57.9k| if (IS_IGNORECASE(reg->options) && !NSTRING_IS_RAW(node)) { ------------------ | | 390| 115k|#define IS_IGNORECASE(option) ((option) & ONIG_OPTION_IGNORECASE) | | ------------------ | | | | 451| 57.9k|#define ONIG_OPTION_IGNORECASE 1U | | ------------------ | | | Branch (390:35): [True: 0, False: 57.9k] | | ------------------ ------------------ 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 (3911:40): [True: 0, False: 0] ------------------ 3912| 0| r = expand_case_fold_string(node, reg, state); 3913| 0| } 3914| 57.9k| break; 3915| | 3916| 0| case NT_CTYPE: ------------------ | | 40| 0|#define NT_CTYPE 2 ------------------ | Branch (3916:3): [True: 0, False: 231k] ------------------ 3917| 13.4k| case NT_CANY: ------------------ | | 41| 13.4k|#define NT_CANY 3 ------------------ | Branch (3917:3): [True: 13.4k, False: 218k] ------------------ 3918| 13.4k| break; 3919| | 3920| 0|#ifdef USE_SUBEXP_CALL 3921| 0| case NT_CALL: ------------------ | | 48| 0|#define NT_CALL 10 ------------------ | Branch (3921:3): [True: 0, False: 231k] ------------------ 3922| 0| break; 3923| 0|#endif 3924| | 3925| 0| case NT_BREF: ------------------ | | 42| 0|#define NT_BREF 4 ------------------ | Branch (3925:3): [True: 0, False: 231k] ------------------ 3926| 0| { 3927| 0| int i; 3928| 0| int* p; 3929| 0| Node** nodes = SCANENV_MEM_NODES(env); ------------------ | | 287| 0| (IS_NOT_NULL((senv)->mem_nodes_dynamic) ? \ | | ------------------ | | | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | | | ------------------ | | | | | Branch (306:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 288| 0| (senv)->mem_nodes_dynamic : (senv)->mem_nodes_static) ------------------ 3930| 0| BRefNode* br = NBREF(node); ------------------ | | 79| 0|#define NBREF(node) (&((node)->u.bref)) ------------------ 3931| 0| p = BACKREFS_P(br); ------------------ | | 120| 0| (IS_NOT_NULL((br)->back_dynamic) ? (br)->back_dynamic : (br)->back_static); | | ------------------ | | | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | | | ------------------ | | | | | Branch (306:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 3932| 0| for (i = 0; i < br->back_num; i++) { ------------------ | Branch (3932:19): [True: 0, False: 0] ------------------ 3933| 0| if (p[i] > env->num_mem) return ONIGERR_INVALID_BACKREF; ------------------ | | 674| 0|#define ONIGERR_INVALID_BACKREF -208 ------------------ | Branch (3933:6): [True: 0, False: 0] ------------------ 3934| 0| BIT_STATUS_ON_AT(env->backrefed_mem, p[i]); ------------------ | | 367| 0|#define BIT_STATUS_ON_AT(stats,n) do {\ | | 368| 0| if ((n) < (int )BIT_STATUS_BITS_NUM)\ | | ------------------ | | | | 361| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (368:7): [True: 0, False: 0] | | ------------------ | | 369| 0| (stats) |= (1 << (n));\ | | 370| 0| else\ | | 371| 0| (stats) |= 1;\ | | 372| 0|} while (0) | | ------------------ | | | Branch (372:10): [Folded - Ignored] | | ------------------ ------------------ 3935| 0| BIT_STATUS_ON_AT(env->bt_mem_start, p[i]); ------------------ | | 367| 0|#define BIT_STATUS_ON_AT(stats,n) do {\ | | 368| 0| if ((n) < (int )BIT_STATUS_BITS_NUM)\ | | ------------------ | | | | 361| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (368:7): [True: 0, False: 0] | | ------------------ | | 369| 0| (stats) |= (1 << (n));\ | | 370| 0| else\ | | 371| 0| (stats) |= 1;\ | | 372| 0|} while (0) | | ------------------ | | | Branch (372:10): [Folded - Ignored] | | ------------------ ------------------ 3936| 0|#ifdef USE_BACKREF_WITH_LEVEL 3937| 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] | | ------------------ ------------------ 3938| 0| BIT_STATUS_ON_AT(env->bt_mem_end, p[i]); ------------------ | | 367| 0|#define BIT_STATUS_ON_AT(stats,n) do {\ | | 368| 0| if ((n) < (int )BIT_STATUS_BITS_NUM)\ | | ------------------ | | | | 361| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (368:7): [True: 0, False: 0] | | ------------------ | | 369| 0| (stats) |= (1 << (n));\ | | 370| 0| else\ | | 371| 0| (stats) |= 1;\ | | 372| 0|} while (0) | | ------------------ | | | Branch (372:10): [Folded - Ignored] | | ------------------ ------------------ 3939| 0| } 3940| 0|#endif 3941| 0| SET_ENCLOSE_STATUS(nodes[p[i]], NST_MEM_BACKREFED); ------------------ | | 144| 0|#define SET_ENCLOSE_STATUS(node,f) (node)->u.enclose.state |= (f) ------------------ 3942| 0| } 3943| 0| } 3944| 0| break; 3945| | 3946| 40.4k| case NT_QTFR: ------------------ | | 43| 40.4k|#define NT_QTFR 5 ------------------ | Branch (3946:3): [True: 40.4k, False: 191k] ------------------ 3947| 40.4k| { 3948| 40.4k| OnigDistance d; 3949| 40.4k| QtfrNode* qn = NQTFR(node); ------------------ | | 80| 40.4k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 3950| 40.4k| Node* target = qn->target; 3951| | 3952| 40.4k| if ((state & IN_REPEAT) != 0) { ------------------ | | 3270| 40.4k|#define IN_REPEAT (1<<2) ------------------ | Branch (3952:11): [True: 2.69k, False: 37.7k] ------------------ 3953| 2.69k| qn->state |= NST_IN_REPEAT; ------------------ | | 140| 2.69k|#define NST_IN_REPEAT (1<<12) /* STK_REPEAT is nested in stack. */ ------------------ 3954| 2.69k| } 3955| | 3956| 40.4k| if (IS_REPEAT_INFINITE(qn->upper) || qn->upper >= 1) { ------------------ | | 416| 80.8k|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 415| 40.4k|#define REPEAT_INFINITE -1 | | ------------------ | | | Branch (416:33): [True: 39.0k, False: 1.34k] | | ------------------ ------------------ | Branch (3956:44): [True: 1.34k, False: 0] ------------------ 3957| 40.4k| r = get_min_match_length(target, &d, env); 3958| 40.4k| if (r) break; ------------------ | Branch (3958:6): [True: 0, False: 40.4k] ------------------ 3959| 40.4k| if (d == 0) { ------------------ | Branch (3959:6): [True: 0, False: 40.4k] ------------------ 3960| 0| qn->target_empty_info = NQ_TARGET_IS_EMPTY; ------------------ | | 123| 0|#define NQ_TARGET_IS_EMPTY 1 ------------------ 3961| 0|#ifdef USE_MONOMANIAC_CHECK_CAPTURES_IN_ENDLESS_REPEAT 3962| 0| r = quantifiers_memory_node_info(target); 3963| 0| if (r < 0) break; ------------------ | Branch (3963:8): [True: 0, False: 0] ------------------ 3964| 0| if (r > 0) { ------------------ | Branch (3964:8): [True: 0, False: 0] ------------------ 3965| 0| qn->target_empty_info = r; 3966| 0| } 3967| 0|#endif 3968| |#if 0 3969| | r = get_max_match_length(target, &d, env); 3970| | if (r == 0 && d == 0) { 3971| | /* ()* ==> ()?, ()+ ==> () */ 3972| | qn->upper = 1; 3973| | if (qn->lower > 1) qn->lower = 1; 3974| | if (NTYPE(target) == NT_STR) { 3975| | qn->upper = qn->lower = 0; /* /(?:)+/ ==> // */ 3976| | } 3977| | } 3978| |#endif 3979| 0| } 3980| 40.4k| } 3981| | 3982| 40.4k| state |= IN_REPEAT; ------------------ | | 3270| 40.4k|#define IN_REPEAT (1<<2) ------------------ 3983| 40.4k| if (qn->lower != qn->upper) ------------------ | Branch (3983:11): [True: 40.4k, False: 0] ------------------ 3984| 40.4k| state |= IN_VAR_REPEAT; ------------------ | | 3271| 40.4k|#define IN_VAR_REPEAT (1<<3) ------------------ 3985| 40.4k| r = setup_tree(target, reg, state, env); 3986| 40.4k| if (r) break; ------------------ | Branch (3986:11): [True: 0, False: 40.4k] ------------------ 3987| | 3988| | /* expand string */ 3989| 40.4k|#define EXPAND_STRING_MAX_LENGTH 100 3990| 40.4k| if (NTYPE(target) == NT_STR) { ------------------ | | 69| 40.4k|#define NTYPE(node) ((node)->u.base.type) ------------------ if (NTYPE(target) == NT_STR) { ------------------ | | 38| 40.4k|#define NT_STR 0 ------------------ | Branch (3990:11): [True: 1.34k, False: 39.0k] ------------------ 3991| 1.34k| if (qn->lower > 1) { ------------------ | Branch (3991:6): [True: 0, False: 1.34k] ------------------ 3992| 0| int i, n = qn->lower; 3993| 0| OnigDistance len = NSTRING_LEN(target); ------------------ | | 108| 0|#define NSTRING_LEN(node) (OnigDistance )((node)->u.str.end - (node)->u.str.s) ------------------ 3994| 0| StrNode* sn = NSTR(target); ------------------ | | 76| 0|#define NSTR(node) (&((node)->u.str)) ------------------ 3995| 0| Node* np; 3996| | 3997| 0| np = onig_node_new_str(sn->s, sn->end); 3998| 0| if (IS_NULL(np)) return ONIGERR_MEMORY; ------------------ | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 0] | | ------------------ ------------------ if (IS_NULL(np)) return ONIGERR_MEMORY; ------------------ | | 629| 0|#define ONIGERR_MEMORY -5 ------------------ 3999| 0| NSTR(np)->flag = sn->flag; ------------------ | | 76| 0|#define NSTR(node) (&((node)->u.str)) ------------------ 4000| | 4001| 0| for (i = 1; i < n && (i+1) * len <= EXPAND_STRING_MAX_LENGTH; i++) { ------------------ | | 3989| 0|#define EXPAND_STRING_MAX_LENGTH 100 ------------------ | Branch (4001:16): [True: 0, False: 0] | Branch (4001:25): [True: 0, False: 0] ------------------ 4002| 0| r = onig_node_str_cat(np, sn->s, sn->end); 4003| 0| if (r) { ------------------ | Branch (4003:10): [True: 0, False: 0] ------------------ 4004| 0| onig_node_free(np); 4005| 0| return r; 4006| 0| } 4007| 0| } 4008| 0| if (i < qn->upper || IS_REPEAT_INFINITE(qn->upper)) { ------------------ | | 416| 0|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 415| 0|#define REPEAT_INFINITE -1 | | ------------------ | | | Branch (416:33): [True: 0, False: 0] | | ------------------ ------------------ | Branch (4008:8): [True: 0, False: 0] ------------------ 4009| 0| Node *np1, *np2; 4010| | 4011| 0| qn->lower -= i; 4012| 0| if (! IS_REPEAT_INFINITE(qn->upper)) ------------------ | | 416| 0|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 415| 0|#define REPEAT_INFINITE -1 | | ------------------ ------------------ | Branch (4012:10): [True: 0, False: 0] ------------------ 4013| 0| qn->upper -= i; 4014| | 4015| 0| np1 = onig_node_new_list(np, NULL); 4016| 0| if (IS_NULL(np1)) { ------------------ | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 0] | | ------------------ ------------------ 4017| 0| onig_node_free(np); 4018| 0| return ONIGERR_MEMORY; ------------------ | | 629| 0|#define ONIGERR_MEMORY -5 ------------------ 4019| 0| } 4020| 0| swap_node(np1, node); 4021| 0| np2 = onig_node_list_add(node, np1); 4022| 0| if (IS_NULL(np2)) { ------------------ | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 0] | | ------------------ ------------------ 4023| 0| onig_node_free(np1); 4024| 0| return ONIGERR_MEMORY; ------------------ | | 629| 0|#define ONIGERR_MEMORY -5 ------------------ 4025| 0| } 4026| 0| } 4027| 0| else { 4028| 0| swap_node(np, node); 4029| 0| onig_node_free(np); 4030| 0| } 4031| 0| break; /* break case NT_QTFR: */ 4032| 0| } 4033| 1.34k| } 4034| | 4035| |#ifdef USE_OP_PUSH_OR_JUMP_EXACT 4036| | if (qn->greedy && (qn->target_empty_info != 0)) { 4037| | if (NTYPE(target) == NT_QTFR) { 4038| | QtfrNode* tqn = NQTFR(target); 4039| | if (IS_NOT_NULL(tqn->head_exact)) { 4040| | qn->head_exact = tqn->head_exact; 4041| | tqn->head_exact = NULL; 4042| | } 4043| | } 4044| | else { 4045| | qn->head_exact = get_head_value_node(qn->target, 1, reg); 4046| | } 4047| | } 4048| |#endif 4049| 40.4k| } 4050| 40.4k| break; 4051| | 4052| 40.4k| case NT_ENCLOSE: ------------------ | | 44| 8.08k|#define NT_ENCLOSE 6 ------------------ | Branch (4052:3): [True: 8.08k, False: 223k] ------------------ 4053| 8.08k| { 4054| 8.08k| EncloseNode* en = NENCLOSE(node); ------------------ | | 81| 8.08k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 4055| | 4056| 8.08k| switch (en->type) { ------------------ | Branch (4056:15): [True: 0, False: 8.08k] ------------------ 4057| 1.34k| case ENCLOSE_OPTION: ------------------ | | 95| 1.34k|#define ENCLOSE_OPTION (1<<1) ------------------ | Branch (4057:7): [True: 1.34k, False: 6.74k] ------------------ 4058| 1.34k| { 4059| 1.34k| OnigOptionType options = reg->options; 4060| 1.34k| reg->options = NENCLOSE(node)->option; ------------------ | | 81| 1.34k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 4061| 1.34k| r = setup_tree(NENCLOSE(node)->target, reg, state, env); ------------------ | | 81| 1.34k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 4062| 1.34k| reg->options = options; 4063| 1.34k| } 4064| 1.34k| break; 4065| | 4066| 6.74k| case ENCLOSE_MEMORY: ------------------ | | 94| 6.74k|#define ENCLOSE_MEMORY (1<<0) ------------------ | Branch (4066:7): [True: 6.74k, False: 1.34k] ------------------ 4067| 6.74k| if ((state & (IN_ALT | IN_NOT | IN_VAR_REPEAT | IN_CALL)) != 0) { ------------------ | | 3268| 6.74k|#define IN_ALT (1<<0) ------------------ if ((state & (IN_ALT | IN_NOT | IN_VAR_REPEAT | IN_CALL)) != 0) { ------------------ | | 3269| 6.74k|#define IN_NOT (1<<1) ------------------ if ((state & (IN_ALT | IN_NOT | IN_VAR_REPEAT | IN_CALL)) != 0) { ------------------ | | 3271| 6.74k|#define IN_VAR_REPEAT (1<<3) ------------------ if ((state & (IN_ALT | IN_NOT | IN_VAR_REPEAT | IN_CALL)) != 0) { ------------------ | | 3272| 6.74k|#define IN_CALL (1<<4) ------------------ | Branch (4067:6): [True: 0, False: 6.74k] ------------------ 4068| 0| BIT_STATUS_ON_AT(env->bt_mem_start, en->regnum); ------------------ | | 367| 0|#define BIT_STATUS_ON_AT(stats,n) do {\ | | 368| 0| if ((n) < (int )BIT_STATUS_BITS_NUM)\ | | ------------------ | | | | 361| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (368:7): [True: 0, False: 0] | | ------------------ | | 369| 0| (stats) |= (1 << (n));\ | | 370| 0| else\ | | 371| 0| (stats) |= 1;\ | | 372| 0|} while (0) | | ------------------ | | | Branch (372:10): [Folded - Ignored] | | ------------------ ------------------ 4069| | /* SET_ENCLOSE_STATUS(node, NST_MEM_IN_ALT_NOT); */ 4070| 0| } 4071| 6.74k| if (IS_ENCLOSE_CALLED(en)) ------------------ | | 147| 6.74k|#define IS_ENCLOSE_CALLED(en) (((en)->state & NST_CALLED) != 0) | | ------------------ | | | | 136| 6.74k|#define NST_CALLED (1<<8) | | ------------------ | | | Branch (147:40): [True: 0, False: 6.74k] | | ------------------ ------------------ 4072| 0| state |= IN_CALL; ------------------ | | 3272| 0|#define IN_CALL (1<<4) ------------------ 4073| 6.74k| if (IS_ENCLOSE_RECURSION(en)) ------------------ | | 149| 6.74k|#define IS_ENCLOSE_RECURSION(en) (((en)->state & NST_RECURSION) != 0) | | ------------------ | | | | 135| 6.74k|#define NST_RECURSION (1<<7) | | ------------------ | | | Branch (149:40): [True: 0, False: 6.74k] | | ------------------ ------------------ 4074| 0| state |= IN_RECCALL; ------------------ | | 3273| 0|#define IN_RECCALL (1<<5) ------------------ 4075| 6.74k| else if ((state & IN_RECCALL) != 0) ------------------ | | 3273| 6.74k|#define IN_RECCALL (1<<5) ------------------ | Branch (4075:11): [True: 0, False: 6.74k] ------------------ 4076| 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) | | ------------------ ------------------ 4077| 6.74k| r = setup_tree(en->target, reg, state, env); 4078| 6.74k| break; 4079| | 4080| 0| case ENCLOSE_STOP_BACKTRACK: ------------------ | | 96| 0|#define ENCLOSE_STOP_BACKTRACK (1<<2) ------------------ | Branch (4080:7): [True: 0, False: 8.08k] ------------------ 4081| 0| { 4082| 0| Node* target = en->target; 4083| 0| r = setup_tree(target, reg, state, env); 4084| 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 (4084:8): [True: 0, False: 0] ------------------ 4085| 0| QtfrNode* tqn = NQTFR(target); ------------------ | | 80| 0|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 4086| 0| if (IS_REPEAT_INFINITE(tqn->upper) && tqn->lower <= 1 && ------------------ | | 416| 0|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 415| 0|#define REPEAT_INFINITE -1 | | ------------------ | | | Branch (416:33): [True: 0, False: 0] | | ------------------ ------------------ | Branch (4086:44): [True: 0, False: 0] ------------------ 4087| 0| tqn->greedy != 0) { /* (?>a*), a*+ etc... */ ------------------ | Branch (4087:3): [True: 0, False: 0] ------------------ 4088| 0| int qtype = NTYPE(tqn->target); ------------------ | | 69| 0|#define NTYPE(node) ((node)->u.base.type) ------------------ 4089| 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)) | | | | ------------------ | | ------------------ ------------------ 4090| 0| SET_ENCLOSE_STATUS(node, NST_STOP_BT_SIMPLE_REPEAT); ------------------ | | 144| 0|#define SET_ENCLOSE_STATUS(node,f) (node)->u.enclose.state |= (f) ------------------ 4091| 0| } 4092| 0| } 4093| 0| } 4094| 0| break; 4095| | 4096| 0| case ENCLOSE_CONDITION: ------------------ | | 97| 0|#define ENCLOSE_CONDITION (1<<3) ------------------ | Branch (4096:7): [True: 0, False: 8.08k] ------------------ 4097| 0|#ifdef USE_NAMED_GROUP 4098| 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 (4098:6): [True: 0, False: 0] ------------------ 4099| 0| env->num_named > 0 && ------------------ | Branch (4099:6): [True: 0, False: 0] ------------------ 4100| 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] | | ------------------ ------------------ 4101| 0| !ONIG_IS_OPTION_ON(env->option, ONIG_OPTION_CAPTURE_GROUP)) { ------------------ | | 476| 0|#define ONIG_IS_OPTION_ON(options,option) ((options) & (option)) ------------------ | Branch (4101:6): [True: 0, False: 0] ------------------ 4102| 0| return ONIGERR_NUMBERED_BACKREF_OR_CALL_NOT_ALLOWED; ------------------ | | 675| 0|#define ONIGERR_NUMBERED_BACKREF_OR_CALL_NOT_ALLOWED -209 ------------------ 4103| 0| } 4104| 0|#endif 4105| 0| if (NENCLOSE(node)->regnum > env->num_mem) ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ | Branch (4105:6): [True: 0, False: 0] ------------------ 4106| 0| return ONIGERR_INVALID_BACKREF; ------------------ | | 674| 0|#define ONIGERR_INVALID_BACKREF -208 ------------------ 4107| 0| r = setup_tree(NENCLOSE(node)->target, reg, state, env); ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 4108| 0| break; 4109| | 4110| 0| case ENCLOSE_ABSENT: ------------------ | | 98| 0|#define ENCLOSE_ABSENT (1<<4) ------------------ | Branch (4110:7): [True: 0, False: 8.08k] ------------------ 4111| 0| r = setup_tree(NENCLOSE(node)->target, reg, state, env); ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 4112| 0| break; 4113| 8.08k| } 4114| 8.08k| } 4115| 8.08k| break; 4116| | 4117| 39.0k| case NT_ANCHOR: ------------------ | | 45| 39.0k|#define NT_ANCHOR 7 ------------------ | Branch (4117:3): [True: 39.0k, False: 192k] ------------------ 4118| 39.0k| { 4119| 39.0k| AnchorNode* an = NANCHOR(node); ------------------ | | 82| 39.0k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 4120| | 4121| 39.0k| switch (an->type) { ------------------ | Branch (4121:15): [True: 39.0k, False: 0] ------------------ 4122| 0| case ANCHOR_PREC_READ: ------------------ | | 545| 0|#define ANCHOR_PREC_READ (1<<10) ------------------ | Branch (4122:7): [True: 0, False: 39.0k] ------------------ 4123| 0| r = setup_tree(an->target, reg, state, env); 4124| 0| break; 4125| 0| case ANCHOR_PREC_READ_NOT: ------------------ | | 546| 0|#define ANCHOR_PREC_READ_NOT (1<<11) ------------------ | Branch (4125:7): [True: 0, False: 39.0k] ------------------ 4126| 0| r = setup_tree(an->target, reg, (state | IN_NOT), env); ------------------ | | 3269| 0|#define IN_NOT (1<<1) ------------------ 4127| 0| break; 4128| | 4129| |/* allowed node types in look-behind */ 4130| 0|#define ALLOWED_TYPE_IN_LB \ 4131| 0| ( BIT_NT_LIST | BIT_NT_ALT | BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE | \ 4132| 0| BIT_NT_CANY | BIT_NT_ANCHOR | BIT_NT_ENCLOSE | BIT_NT_QTFR | BIT_NT_CALL ) 4133| | 4134| 0|#define ALLOWED_ENCLOSE_IN_LB ( ENCLOSE_MEMORY | ENCLOSE_OPTION ) 4135| 0|#define ALLOWED_ENCLOSE_IN_LB_NOT ENCLOSE_OPTION 4136| | 4137| 0|#define ALLOWED_ANCHOR_IN_LB \ 4138| 0|( ANCHOR_LOOK_BEHIND | ANCHOR_LOOK_BEHIND_NOT | ANCHOR_BEGIN_LINE | \ 4139| 0| ANCHOR_END_LINE | ANCHOR_BEGIN_BUF | ANCHOR_BEGIN_POSITION | ANCHOR_KEEP | \ 4140| 0| ANCHOR_WORD_BOUND | ANCHOR_NOT_WORD_BOUND | \ 4141| 0| ANCHOR_WORD_BEGIN | ANCHOR_WORD_END ) 4142| 0|#define ALLOWED_ANCHOR_IN_LB_NOT \ 4143| 0|( ANCHOR_LOOK_BEHIND | ANCHOR_LOOK_BEHIND_NOT | ANCHOR_BEGIN_LINE | \ 4144| 0| ANCHOR_END_LINE | ANCHOR_BEGIN_BUF | ANCHOR_BEGIN_POSITION | ANCHOR_KEEP | \ 4145| 0| ANCHOR_WORD_BOUND | ANCHOR_NOT_WORD_BOUND | \ 4146| 0| ANCHOR_WORD_BEGIN | ANCHOR_WORD_END ) 4147| | 4148| 0| case ANCHOR_LOOK_BEHIND: ------------------ | | 547| 0|#define ANCHOR_LOOK_BEHIND (1<<12) ------------------ | Branch (4148:7): [True: 0, False: 39.0k] ------------------ 4149| 0| { 4150| 0| r = check_type_tree(an->target, ALLOWED_TYPE_IN_LB, ------------------ | | 4131| 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)) | | | | ------------------ | | ------------------ | | 4132| 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)) | | | | ------------------ | | ------------------ ------------------ 4151| 0| ALLOWED_ENCLOSE_IN_LB, ALLOWED_ANCHOR_IN_LB); ------------------ | | 4134| 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); ------------------ | | 4137| 0|#define ALLOWED_ANCHOR_IN_LB \ | | 4138| 0|( ANCHOR_LOOK_BEHIND | ANCHOR_LOOK_BEHIND_NOT | ANCHOR_BEGIN_LINE | \ | | ------------------ | | | | 547| 0|#define ANCHOR_LOOK_BEHIND (1<<12) | | ------------------ | | ( ANCHOR_LOOK_BEHIND | ANCHOR_LOOK_BEHIND_NOT | ANCHOR_BEGIN_LINE | \ | | ------------------ | | | | 548| 0|#define ANCHOR_LOOK_BEHIND_NOT (1<<13) | | ------------------ | | ( ANCHOR_LOOK_BEHIND | ANCHOR_LOOK_BEHIND_NOT | ANCHOR_BEGIN_LINE | \ | | ------------------ | | | | 535| 0|#define ANCHOR_BEGIN_LINE (1<<1) | | ------------------ | | 4139| 0| ANCHOR_END_LINE | ANCHOR_BEGIN_BUF | ANCHOR_BEGIN_POSITION | ANCHOR_KEEP | \ | | ------------------ | | | | 539| 0|#define ANCHOR_END_LINE (1<<5) | | ------------------ | | ANCHOR_END_LINE | ANCHOR_BEGIN_BUF | ANCHOR_BEGIN_POSITION | ANCHOR_KEEP | \ | | ------------------ | | | | 534| 0|#define ANCHOR_BEGIN_BUF (1<<0) | | ------------------ | | ANCHOR_END_LINE | ANCHOR_BEGIN_BUF | ANCHOR_BEGIN_POSITION | ANCHOR_KEEP | \ | | ------------------ | | | | 536| 0|#define ANCHOR_BEGIN_POSITION (1<<2) | | ------------------ | | ANCHOR_END_LINE | ANCHOR_BEGIN_BUF | ANCHOR_BEGIN_POSITION | ANCHOR_KEEP | \ | | ------------------ | | | | 553| 0|#define ANCHOR_KEEP (1<<16) | | ------------------ | | 4140| 0| ANCHOR_WORD_BOUND | ANCHOR_NOT_WORD_BOUND | \ | | ------------------ | | | | 541| 0|#define ANCHOR_WORD_BOUND (1<<6) | | ------------------ | | ANCHOR_WORD_BOUND | ANCHOR_NOT_WORD_BOUND | \ | | ------------------ | | | | 542| 0|#define ANCHOR_NOT_WORD_BOUND (1<<7) | | ------------------ | | 4141| 0| ANCHOR_WORD_BEGIN | ANCHOR_WORD_END ) | | ------------------ | | | | 543| 0|#define ANCHOR_WORD_BEGIN (1<<8) | | ------------------ | | ANCHOR_WORD_BEGIN | ANCHOR_WORD_END ) | | ------------------ | | | | 544| 0|#define ANCHOR_WORD_END (1<<9) | | ------------------ ------------------ 4152| 0| if (r < 0) return r; ------------------ | Branch (4152:8): [True: 0, False: 0] ------------------ 4153| 0| if (r > 0) return ONIGERR_INVALID_LOOK_BEHIND_PATTERN; ------------------ | | 662| 0|#define ONIGERR_INVALID_LOOK_BEHIND_PATTERN -122 ------------------ | Branch (4153:8): [True: 0, False: 0] ------------------ 4154| 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 (4154:8): [True: 0, False: 0] ------------------ 4155| 0| r = setup_tree(an->target, reg, (state | IN_LOOK_BEHIND), env); ------------------ | | 3274| 0|#define IN_LOOK_BEHIND (1<<6) ------------------ 4156| 0| if (r != 0) return r; ------------------ | Branch (4156:8): [True: 0, False: 0] ------------------ 4157| 0| r = setup_look_behind(node, reg, env); 4158| 0| } 4159| 0| break; 4160| | 4161| 0| case ANCHOR_LOOK_BEHIND_NOT: ------------------ | | 548| 0|#define ANCHOR_LOOK_BEHIND_NOT (1<<13) ------------------ | Branch (4161:7): [True: 0, False: 39.0k] ------------------ 4162| 0| { 4163| 0| r = check_type_tree(an->target, ALLOWED_TYPE_IN_LB, ------------------ | | 4131| 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)) | | | | ------------------ | | ------------------ | | 4132| 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)) | | | | ------------------ | | ------------------ ------------------ 4164| 0| ALLOWED_ENCLOSE_IN_LB_NOT, ALLOWED_ANCHOR_IN_LB_NOT); ------------------ | | 4135| 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); ------------------ | | 4142| 0|#define ALLOWED_ANCHOR_IN_LB_NOT \ | | 4143| 0|( ANCHOR_LOOK_BEHIND | ANCHOR_LOOK_BEHIND_NOT | ANCHOR_BEGIN_LINE | \ | | ------------------ | | | | 547| 0|#define ANCHOR_LOOK_BEHIND (1<<12) | | ------------------ | | ( ANCHOR_LOOK_BEHIND | ANCHOR_LOOK_BEHIND_NOT | ANCHOR_BEGIN_LINE | \ | | ------------------ | | | | 548| 0|#define ANCHOR_LOOK_BEHIND_NOT (1<<13) | | ------------------ | | ( ANCHOR_LOOK_BEHIND | ANCHOR_LOOK_BEHIND_NOT | ANCHOR_BEGIN_LINE | \ | | ------------------ | | | | 535| 0|#define ANCHOR_BEGIN_LINE (1<<1) | | ------------------ | | 4144| 0| ANCHOR_END_LINE | ANCHOR_BEGIN_BUF | ANCHOR_BEGIN_POSITION | ANCHOR_KEEP | \ | | ------------------ | | | | 539| 0|#define ANCHOR_END_LINE (1<<5) | | ------------------ | | ANCHOR_END_LINE | ANCHOR_BEGIN_BUF | ANCHOR_BEGIN_POSITION | ANCHOR_KEEP | \ | | ------------------ | | | | 534| 0|#define ANCHOR_BEGIN_BUF (1<<0) | | ------------------ | | ANCHOR_END_LINE | ANCHOR_BEGIN_BUF | ANCHOR_BEGIN_POSITION | ANCHOR_KEEP | \ | | ------------------ | | | | 536| 0|#define ANCHOR_BEGIN_POSITION (1<<2) | | ------------------ | | ANCHOR_END_LINE | ANCHOR_BEGIN_BUF | ANCHOR_BEGIN_POSITION | ANCHOR_KEEP | \ | | ------------------ | | | | 553| 0|#define ANCHOR_KEEP (1<<16) | | ------------------ | | 4145| 0| ANCHOR_WORD_BOUND | ANCHOR_NOT_WORD_BOUND | \ | | ------------------ | | | | 541| 0|#define ANCHOR_WORD_BOUND (1<<6) | | ------------------ | | ANCHOR_WORD_BOUND | ANCHOR_NOT_WORD_BOUND | \ | | ------------------ | | | | 542| 0|#define ANCHOR_NOT_WORD_BOUND (1<<7) | | ------------------ | | 4146| 0| ANCHOR_WORD_BEGIN | ANCHOR_WORD_END ) | | ------------------ | | | | 543| 0|#define ANCHOR_WORD_BEGIN (1<<8) | | ------------------ | | ANCHOR_WORD_BEGIN | ANCHOR_WORD_END ) | | ------------------ | | | | 544| 0|#define ANCHOR_WORD_END (1<<9) | | ------------------ ------------------ 4165| 0| if (r < 0) return r; ------------------ | Branch (4165:8): [True: 0, False: 0] ------------------ 4166| 0| if (r > 0) return ONIGERR_INVALID_LOOK_BEHIND_PATTERN; ------------------ | | 662| 0|#define ONIGERR_INVALID_LOOK_BEHIND_PATTERN -122 ------------------ | Branch (4166:8): [True: 0, False: 0] ------------------ 4167| 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 (4167:8): [True: 0, False: 0] ------------------ 4168| 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) ------------------ 4169| 0| env); 4170| 0| if (r != 0) return r; ------------------ | Branch (4170:8): [True: 0, False: 0] ------------------ 4171| 0| r = setup_look_behind(node, reg, env); 4172| 0| } 4173| 0| break; 4174| 39.0k| } 4175| 39.0k| } 4176| 39.0k| break; 4177| | 4178| 39.0k| default: ------------------ | Branch (4178:3): [True: 0, False: 231k] ------------------ 4179| 0| break; 4180| 231k| } 4181| | 4182| 231k| return r; 4183| 231k|} regcomp.c:next_setup: 3333| 101k|{ 3334| 101k| int type; 3335| | 3336| 107k| retry: 3337| 107k| type = NTYPE(node); ------------------ | | 69| 107k|#define NTYPE(node) ((node)->u.base.type) ------------------ 3338| 107k| if (type == NT_QTFR) { ------------------ | | 43| 107k|#define NT_QTFR 5 ------------------ | Branch (3338:7): [True: 36.3k, False: 71.4k] ------------------ 3339| 36.3k| QtfrNode* qn = NQTFR(node); ------------------ | | 80| 36.3k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 3340| 36.3k| if (qn->greedy && IS_REPEAT_INFINITE(qn->upper)) { ------------------ | | 416| 35.0k|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 415| 35.0k|#define REPEAT_INFINITE -1 | | ------------------ | | | Branch (416:33): [True: 33.7k, False: 1.34k] | | ------------------ ------------------ | Branch (3340:9): [True: 35.0k, False: 1.34k] ------------------ 3341| 33.7k|#ifdef USE_QTFR_PEEK_NEXT 3342| 33.7k| Node* n = get_head_value_node(next_node, 1, reg); 3343| | /* '\0': for UTF-16BE etc... */ 3344| 33.7k| if (IS_NOT_NULL(n) && NSTR(n)->s[0] != '\0') { ------------------ | | 306| 67.4k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 20.2k, False: 13.4k] | | ------------------ ------------------ if (IS_NOT_NULL(n) && NSTR(n)->s[0] != '\0') { ------------------ | | 76| 20.2k|#define NSTR(node) (&((node)->u.str)) ------------------ | Branch (3344:29): [True: 20.2k, False: 0] ------------------ 3345| 20.2k| qn->next_head_exact = n; 3346| 20.2k| } 3347| 33.7k|#endif 3348| | /* automatic possessification a*b ==> (?>a*)b */ 3349| 33.7k| if (qn->lower <= 1) { ------------------ | Branch (3349:11): [True: 33.7k, False: 0] ------------------ 3350| 33.7k| int ttype = NTYPE(qn->target); ------------------ | | 69| 33.7k|#define NTYPE(node) ((node)->u.base.type) ------------------ 3351| 33.7k| if (IS_NODE_TYPE_SIMPLE(ttype)) { ------------------ | | 66| 33.7k| ((NTYPE2BIT(type) & (BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE |\ | | ------------------ | | | | 51| 33.7k|#define NTYPE2BIT(type) (1<<(type)) | | ------------------ | | ((NTYPE2BIT(type) & (BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE |\ | | ------------------ | | | | 53| 33.7k|#define BIT_NT_STR NTYPE2BIT(NT_STR) | | | | ------------------ | | | | | | 51| 33.7k|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | ((NTYPE2BIT(type) & (BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE |\ | | ------------------ | | | | 54| 33.7k|#define BIT_NT_CCLASS NTYPE2BIT(NT_CCLASS) | | | | ------------------ | | | | | | 51| 33.7k|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | ((NTYPE2BIT(type) & (BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE |\ | | ------------------ | | | | 55| 33.7k|#define BIT_NT_CTYPE NTYPE2BIT(NT_CTYPE) | | | | ------------------ | | | | | | 51| 33.7k|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | | Branch (66:3): [True: 31.0k, False: 2.69k] | | ------------------ | | 67| 33.7k| BIT_NT_CANY | BIT_NT_BREF)) != 0) | | ------------------ | | | | 56| 33.7k|#define BIT_NT_CANY NTYPE2BIT(NT_CANY) | | | | ------------------ | | | | | | 51| 33.7k|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ | | BIT_NT_CANY | BIT_NT_BREF)) != 0) | | ------------------ | | | | 57| 33.7k|#define BIT_NT_BREF NTYPE2BIT(NT_BREF) | | | | ------------------ | | | | | | 51| 33.7k|#define NTYPE2BIT(type) (1<<(type)) | | | | ------------------ | | ------------------ ------------------ 3352| 31.0k| Node *x, *y; 3353| 31.0k| x = get_head_value_node(qn->target, 0, reg); 3354| 31.0k| if (IS_NOT_NULL(x)) { ------------------ | | 306| 31.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 26.9k, False: 4.04k] | | ------------------ ------------------ 3355| 26.9k| y = get_head_value_node(next_node, 0, reg); 3356| 26.9k| if (IS_NOT_NULL(y) && is_not_included(x, y, reg)) { ------------------ | | 306| 53.9k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 17.5k, False: 9.43k] | | ------------------ ------------------ | Branch (3356:28): [True: 17.5k, False: 0] ------------------ 3357| 17.5k| Node* en = onig_node_new_enclose(ENCLOSE_STOP_BACKTRACK); ------------------ | | 96| 17.5k|#define ENCLOSE_STOP_BACKTRACK (1<<2) ------------------ 3358| 17.5k| CHECK_NULL_RETURN_MEMERR(en); ------------------ | | 308| 17.5k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 17.5k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 17.5k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 3359| 17.5k| SET_ENCLOSE_STATUS(en, NST_STOP_BT_SIMPLE_REPEAT); ------------------ | | 144| 17.5k|#define SET_ENCLOSE_STATUS(node,f) (node)->u.enclose.state |= (f) ------------------ 3360| 17.5k| swap_node(node, en); 3361| 17.5k| NENCLOSE(node)->target = en; ------------------ | | 81| 17.5k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 3362| 17.5k| } 3363| 26.9k| } 3364| 31.0k| } 3365| 33.7k| } 3366| 33.7k| } 3367| 36.3k| } 3368| 71.4k| else if (type == NT_ENCLOSE) { ------------------ | | 44| 71.4k|#define NT_ENCLOSE 6 ------------------ | Branch (3368:12): [True: 8.08k, False: 63.3k] ------------------ 3369| 8.08k| EncloseNode* en = NENCLOSE(node); ------------------ | | 81| 8.08k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 3370| 8.08k| if (en->type == ENCLOSE_MEMORY) { ------------------ | | 94| 8.08k|#define ENCLOSE_MEMORY (1<<0) ------------------ | Branch (3370:9): [True: 6.74k, False: 1.34k] ------------------ 3371| 6.74k| node = en->target; 3372| 6.74k| goto retry; 3373| 6.74k| } 3374| 8.08k| } 3375| 101k| return 0; 3376| 107k|} regcomp.c:get_head_value_node: 2746| 94.3k|{ 2747| 94.3k| Node* n = NULL_NODE; ------------------ | | 283| 94.3k|#define NULL_NODE ((Node* )0) ------------------ 2748| | 2749| 94.3k| switch (NTYPE(node)) { ------------------ | | 69| 94.3k|#define NTYPE(node) ((node)->u.base.type) ------------------ 2750| 0| case NT_BREF: ------------------ | | 42| 0|#define NT_BREF 4 ------------------ | Branch (2750:3): [True: 0, False: 94.3k] ------------------ 2751| 2.69k| case NT_ALT: ------------------ | | 47| 2.69k|#define NT_ALT 9 ------------------ | Branch (2751:3): [True: 2.69k, False: 91.6k] ------------------ 2752| 9.43k| case NT_CANY: ------------------ | | 41| 9.43k|#define NT_CANY 3 ------------------ | Branch (2752:3): [True: 6.74k, False: 87.6k] ------------------ 2753| 9.43k|#ifdef USE_SUBEXP_CALL 2754| 9.43k| case NT_CALL: ------------------ | | 48| 9.43k|#define NT_CALL 10 ------------------ | Branch (2754:3): [True: 0, False: 94.3k] ------------------ 2755| 9.43k|#endif 2756| 9.43k| break; 2757| | 2758| 0| case NT_CTYPE: ------------------ | | 40| 0|#define NT_CTYPE 2 ------------------ | Branch (2758:3): [True: 0, False: 94.3k] ------------------ 2759| 29.6k| case NT_CCLASS: ------------------ | | 39| 29.6k|#define NT_CCLASS 1 ------------------ | Branch (2759:3): [True: 29.6k, False: 64.7k] ------------------ 2760| 29.6k| if (exact == 0) { ------------------ | Branch (2760:9): [True: 26.9k, False: 2.69k] ------------------ 2761| 26.9k| n = node; 2762| 26.9k| } 2763| 29.6k| break; 2764| | 2765| 0| case NT_LIST: ------------------ | | 46| 0|#define NT_LIST 8 ------------------ | Branch (2765:3): [True: 0, False: 94.3k] ------------------ 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| 37.7k| case NT_STR: ------------------ | | 38| 37.7k|#define NT_STR 0 ------------------ | Branch (2769:3): [True: 37.7k, False: 56.6k] ------------------ 2770| 37.7k| { 2771| 37.7k| StrNode* sn = NSTR(node); ------------------ | | 76| 37.7k|#define NSTR(node) (&((node)->u.str)) ------------------ 2772| | 2773| 37.7k| if (sn->end <= sn->s) ------------------ | Branch (2773:11): [True: 0, False: 37.7k] ------------------ 2774| 0| break; 2775| | 2776| 37.7k| if (exact == 0 || ------------------ | Branch (2776:11): [True: 17.5k, False: 20.2k] ------------------ 2777| 37.7k| NSTRING_IS_RAW(node) || !IS_IGNORECASE(reg->options)) { ------------------ | | 114| 57.9k|#define NSTRING_IS_RAW(node) (((node)->u.str.flag & NSTR_RAW) != 0) | | ------------------ | | | | 104| 20.2k|#define NSTR_RAW (1<<0) /* by backslashed number */ | | ------------------ | | | Branch (114:39): [True: 0, False: 20.2k] | | ------------------ ------------------ NSTRING_IS_RAW(node) || !IS_IGNORECASE(reg->options)) { ------------------ | | 390| 20.2k|#define IS_IGNORECASE(option) ((option) & ONIG_OPTION_IGNORECASE) | | ------------------ | | | | 451| 20.2k|#define ONIG_OPTION_IGNORECASE 1U | | ------------------ ------------------ | Branch (2777:28): [True: 20.2k, False: 0] ------------------ 2778| 37.7k| n = node; 2779| 37.7k| } 2780| 37.7k| } 2781| 0| break; 2782| | 2783| 13.4k| case NT_QTFR: ------------------ | | 43| 13.4k|#define NT_QTFR 5 ------------------ | Branch (2783:3): [True: 13.4k, False: 80.8k] ------------------ 2784| 13.4k| { 2785| 13.4k| QtfrNode* qn = NQTFR(node); ------------------ | | 80| 13.4k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 2786| 13.4k| if (qn->lower > 0) { ------------------ | Branch (2786:11): [True: 2.69k, False: 10.7k] ------------------ 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| 2.69k| n = get_head_value_node(qn->target, exact, reg); 2793| 2.69k| } 2794| 13.4k| } 2795| 13.4k| break; 2796| | 2797| 0| case NT_ENCLOSE: ------------------ | | 44| 0|#define NT_ENCLOSE 6 ------------------ | Branch (2797:3): [True: 0, False: 94.3k] ------------------ 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| 4.04k| case NT_ANCHOR: ------------------ | | 45| 4.04k|#define NT_ANCHOR 7 ------------------ | Branch (2823:3): [True: 4.04k, False: 90.3k] ------------------ 2824| 4.04k| if (NANCHOR(node)->type == ANCHOR_PREC_READ) ------------------ | | 82| 4.04k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ if (NANCHOR(node)->type == ANCHOR_PREC_READ) ------------------ | | 545| 4.04k|#define ANCHOR_PREC_READ (1<<10) ------------------ | Branch (2824:9): [True: 0, False: 4.04k] ------------------ 2825| 0| n = get_head_value_node(NANCHOR(node)->target, exact, reg); ------------------ | | 82| 0|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 2826| 4.04k| break; 2827| | 2828| 0| default: ------------------ | Branch (2828:3): [True: 0, False: 94.3k] ------------------ 2829| 0| break; 2830| 94.3k| } 2831| | 2832| 94.3k| return n; 2833| 94.3k|} regcomp.c:is_not_included: 2551| 17.5k|{ 2552| 17.5k| int i; 2553| 17.5k| OnigDistance len; 2554| 17.5k| OnigCodePoint code; 2555| 17.5k| UChar *p; ------------------ | | 76| 17.5k|# define UChar OnigUChar ------------------ 2556| 17.5k| int ytype; 2557| | 2558| 35.0k| retry: 2559| 35.0k| ytype = NTYPE(y); ------------------ | | 69| 35.0k|#define NTYPE(node) ((node)->u.base.type) ------------------ 2560| 35.0k| switch (NTYPE(x)) { ------------------ | | 69| 35.0k|#define NTYPE(node) ((node)->u.base.type) ------------------ 2561| 0| case NT_CTYPE: ------------------ | | 40| 0|#define NT_CTYPE 2 ------------------ | Branch (2561:3): [True: 0, False: 35.0k] ------------------ 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| 17.5k| swap: 2575| 17.5k| { 2576| 17.5k| Node* tmp; 2577| 17.5k| tmp = x; x = y; y = tmp; 2578| 17.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| 17.5k| case NT_CCLASS: ------------------ | | 39| 17.5k|#define NT_CCLASS 1 ------------------ | Branch (2592:3): [True: 17.5k, False: 17.5k] ------------------ 2593| 17.5k| { 2594| 17.5k| CClassNode* xc = NCCLASS(x); ------------------ | | 77| 17.5k|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 2595| 17.5k| switch (ytype) { 2596| 0| case NT_CTYPE: ------------------ | | 40| 0|#define NT_CTYPE 2 ------------------ | Branch (2596:7): [True: 0, False: 17.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)) { ------------------ | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 0] | | ------------------ ------------------ if (IS_NULL(xc->mbuf) && !IS_NCCLASS_NOT(xc)) { ------------------ | | 803| 0|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 796| 0|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 793| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ | Branch (2600:31): [True: 0, False: 0] ------------------ 2601| 0| for (i = 0; i < SINGLE_BYTE_SIZE; i++) { ------------------ | | 420| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 419| 0|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (2601:20): [True: 0, False: 0] ------------------ 2602| 0| if (BITSET_AT(xc->bs, i)) { ------------------ | | 442| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (442: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; ------------------ | | 884| 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)) | | ------------------ | | | | 401| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | | | ------------------ | | | | | | 372| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | | | ------------------ | | | | | | | Branch (372:48): [True: 0, False: 0] | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 2605| 0| } 2606| 0| else { 2607| 0| if (ONIGENC_IS_CODE_WORD(reg->enc, i)) return 0; ------------------ | | 401| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | ------------------ | | | | 372| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (372: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; ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 0] | | ------------------ ------------------ 2617| 0| for (i = 0; i < SINGLE_BYTE_SIZE; i++) { ------------------ | | 420| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 419| 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); ------------------ | | 884| 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)) | | ------------------ | | | | 401| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | | | ------------------ | | | | | | 372| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | | | ------------------ | | | | | | | Branch (372:48): [True: 0, False: 0] | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 2621| 0| else 2622| 0| is_word = ONIGENC_IS_CODE_WORD(reg->enc, i); ------------------ | | 401| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | ------------------ | | | | 372| 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)) { ------------------ | | 803| 0|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 796| 0|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 793| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ | Branch (2624:7): [True: 0, False: 0] ------------------ 2625| 0| if (BITSET_AT(xc->bs, i)) ------------------ | | 442| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (442:36): [True: 0, False: 0] | | ------------------ ------------------ 2626| 0| return 0; 2627| 0| } 2628| 0| else { 2629| 0| if (! BITSET_AT(xc->bs, i)) ------------------ | | 442| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 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: 17.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++) { ------------------ | | 420| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 419| 0|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (2648:16): [True: 0, False: 0] ------------------ 2649| 0| v = BITSET_AT(xc->bs, i); ------------------ | | 442| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 2650| 0| if ((v != 0 && !IS_NCCLASS_NOT(xc)) || ------------------ | | 803| 0|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 796| 0|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 793| 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))) { ------------------ | | 803| 0|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 796| 0|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 793| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | | | | Branch (796:37): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ | Branch (2651:4): [True: 0, False: 0] ------------------ 2652| 0| v = BITSET_AT(yc->bs, i); ------------------ | | 442| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 2653| 0| if ((v != 0 && !IS_NCCLASS_NOT(yc)) || ------------------ | | 803| 0|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 796| 0|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 793| 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))) ------------------ | | 803| 0|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 796| 0|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 793| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | | | | Branch (796: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)) || ------------------ | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 0] | | ------------------ ------------------ if ((IS_NULL(xc->mbuf) && !IS_NCCLASS_NOT(xc)) || ------------------ | | 803| 0|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 796| 0|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 793| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ | Branch (2658:30): [True: 0, False: 0] ------------------ 2659| 0| (IS_NULL(yc->mbuf) && !IS_NCCLASS_NOT(yc))) ------------------ | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 0] | | ------------------ ------------------ (IS_NULL(yc->mbuf) && !IS_NCCLASS_NOT(yc))) ------------------ | | 803| 0|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 796| 0|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 793| 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| 17.5k| case NT_STR: ------------------ | | 38| 17.5k|#define NT_STR 0 ------------------ | Branch (2665:7): [True: 17.5k, False: 0] ------------------ 2666| 17.5k| goto swap; 2667| 0| break; 2668| | 2669| 0| default: ------------------ | Branch (2669:7): [True: 0, False: 17.5k] ------------------ 2670| 0| break; 2671| 17.5k| } 2672| 17.5k| } 2673| 0| break; 2674| | 2675| 17.5k| case NT_STR: ------------------ | | 38| 17.5k|#define NT_STR 0 ------------------ | Branch (2675:3): [True: 17.5k, False: 17.5k] ------------------ 2676| 17.5k| { 2677| 17.5k| StrNode* xs = NSTR(x); ------------------ | | 76| 17.5k|#define NSTR(node) (&((node)->u.str)) ------------------ 2678| 17.5k| if (NSTRING_LEN(x) == 0) ------------------ | | 108| 17.5k|#define NSTRING_LEN(node) (OnigDistance )((node)->u.str.end - (node)->u.str.s) ------------------ | Branch (2678:11): [True: 0, False: 17.5k] ------------------ 2679| 0| break; 2680| | 2681| 17.5k| switch (ytype) { 2682| 0| case NT_CTYPE: ------------------ | | 40| 0|#define NT_CTYPE 2 ------------------ | Branch (2682:7): [True: 0, False: 17.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) | | ------------------ | | | | 366| 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)) | | ------------------ | | | | 401| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | | | ------------------ | | | | | | 372| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | | | ------------------ | | | | | | | Branch (372: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| 17.5k| case NT_CCLASS: ------------------ | | 39| 17.5k|#define NT_CCLASS 1 ------------------ | Branch (2703:7): [True: 17.5k, False: 0] ------------------ 2704| 17.5k| { 2705| 17.5k| CClassNode* cc = NCCLASS(y); ------------------ | | 77| 17.5k|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 2706| | 2707| 17.5k| code = ONIGENC_MBC_TO_CODE(reg->enc, xs->s, ------------------ | | 366| 17.5k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) ------------------ 2708| 17.5k| xs->s + ONIGENC_MBC_MAXLEN(reg->enc)); 2709| 17.5k| return (onig_is_code_in_cc(reg->enc, code, cc) != 0 ? 0 : 1); ------------------ | Branch (2709:12): [True: 0, False: 17.5k] ------------------ 2710| 0| } 2711| 0| break; 2712| | 2713| 0| case NT_STR: ------------------ | | 38| 0|#define NT_STR 0 ------------------ | Branch (2713:7): [True: 0, False: 17.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: 17.5k] ------------------ 2732| 0| break; 2733| 17.5k| } 2734| 17.5k| } 2735| 0| break; 2736| | 2737| 0| default: ------------------ | Branch (2737:3): [True: 0, False: 35.0k] ------------------ 2738| 0| break; 2739| 35.0k| } 2740| | 2741| 0| return 0; 2742| 35.0k|} regcomp.c:swap_node: 72| 17.5k|{ 73| 17.5k| Node c; 74| 17.5k| c = *a; *a = *b; *b = c; 75| | 76| 17.5k| if (NTYPE(a) == NT_STR) { ------------------ | | 69| 17.5k|#define NTYPE(node) ((node)->u.base.type) ------------------ if (NTYPE(a) == NT_STR) { ------------------ | | 38| 17.5k|#define NT_STR 0 ------------------ | Branch (76:7): [True: 0, False: 17.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| 17.5k| if (NTYPE(b) == NT_STR) { ------------------ | | 69| 17.5k|#define NTYPE(node) ((node)->u.base.type) ------------------ if (NTYPE(b) == NT_STR) { ------------------ | | 38| 17.5k|#define NT_STR 0 ------------------ | Branch (85:7): [True: 0, False: 17.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| 17.5k|} regcomp.c:distance_add: 97| 533k|{ 98| 533k| if (d1 == ONIG_INFINITE_DISTANCE || d2 == ONIG_INFINITE_DISTANCE) ------------------ | | 85| 1.06M|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ if (d1 == ONIG_INFINITE_DISTANCE || d2 == ONIG_INFINITE_DISTANCE) ------------------ | | 85| 407k|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ | Branch (98:7): [True: 126k, False: 407k] | Branch (98:39): [True: 40.4k, False: 366k] ------------------ 99| 167k| return ONIG_INFINITE_DISTANCE; ------------------ | | 85| 167k|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ 100| 366k| else { 101| 366k| if (d1 <= ONIG_INFINITE_DISTANCE - d2) return d1 + d2; ------------------ | | 85| 366k|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ | Branch (101:9): [True: 366k, False: 0] ------------------ 102| 0| else return ONIG_INFINITE_DISTANCE; ------------------ | | 85| 0|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ 103| 366k| } 104| 533k|} regcomp.c:clear_optimize_info: 5365| 31.0k|{ 5366| 31.0k| reg->optimize = ONIG_OPTIMIZE_NONE; ------------------ | | 349| 31.0k|#define ONIG_OPTIMIZE_NONE 0 ------------------ 5367| 31.0k| reg->anchor = 0; 5368| 31.0k| reg->anchor_dmin = 0; 5369| 31.0k| reg->anchor_dmax = 0; 5370| 31.0k| reg->sub_anchor = 0; 5371| 31.0k| reg->exact_end = (UChar* )NULL; 5372| 31.0k| reg->threshold_len = 0; 5373| 31.0k| if (IS_NOT_NULL(reg->exact)) { ------------------ | | 306| 31.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 31.0k] | | ------------------ ------------------ 5374| 0| xfree(reg->exact); ------------------ | | 145| 0|# define xfree free ------------------ 5375| 0| reg->exact = (UChar* )NULL; 5376| 0| } 5377| 31.0k|} regcomp.c:set_optimize_info_from_tree: 5305| 31.0k|{ 5306| | 5307| 31.0k| int r; 5308| 31.0k| NodeOptInfo opt; 5309| 31.0k| OptEnv env; 5310| | 5311| 31.0k| env.enc = reg->enc; 5312| 31.0k| env.options = reg->options; 5313| 31.0k| env.case_fold_flag = reg->case_fold_flag; 5314| 31.0k| env.scan_env = scan_env; 5315| 31.0k| clear_mml(&env.mmd); 5316| | 5317| 31.0k| r = optimize_node_left(node, &opt, &env); 5318| 31.0k| if (r) return r; ------------------ | Branch (5318:7): [True: 0, False: 31.0k] ------------------ 5319| | 5320| 31.0k| reg->anchor = opt.anc.left_anchor & (ANCHOR_BEGIN_BUF | ------------------ | | 534| 31.0k|#define ANCHOR_BEGIN_BUF (1<<0) ------------------ 5321| 31.0k| ANCHOR_BEGIN_POSITION | ANCHOR_ANYCHAR_STAR | ANCHOR_ANYCHAR_STAR_ML | ------------------ | | 536| 31.0k|#define ANCHOR_BEGIN_POSITION (1<<2) ------------------ ANCHOR_BEGIN_POSITION | ANCHOR_ANYCHAR_STAR | ANCHOR_ANYCHAR_STAR_ML | ------------------ | | 550| 31.0k|#define ANCHOR_ANYCHAR_STAR (1<<14) /* ".*" optimize info */ ------------------ ANCHOR_BEGIN_POSITION | ANCHOR_ANYCHAR_STAR | ANCHOR_ANYCHAR_STAR_ML | ------------------ | | 551| 31.0k|#define ANCHOR_ANYCHAR_STAR_ML (1<<15) /* ".*" optimize info (multi-line) */ ------------------ 5322| 31.0k| ANCHOR_LOOK_BEHIND); ------------------ | | 547| 31.0k|#define ANCHOR_LOOK_BEHIND (1<<12) ------------------ 5323| | 5324| 31.0k| if ((opt.anc.left_anchor & (ANCHOR_LOOK_BEHIND | ANCHOR_PREC_READ_NOT)) != 0) ------------------ | | 547| 31.0k|#define ANCHOR_LOOK_BEHIND (1<<12) ------------------ if ((opt.anc.left_anchor & (ANCHOR_LOOK_BEHIND | ANCHOR_PREC_READ_NOT)) != 0) ------------------ | | 546| 31.0k|#define ANCHOR_PREC_READ_NOT (1<<11) ------------------ | Branch (5324:7): [True: 0, False: 31.0k] ------------------ 5325| 0| reg->anchor &= ~ANCHOR_ANYCHAR_STAR_ML; ------------------ | | 551| 0|#define ANCHOR_ANYCHAR_STAR_ML (1<<15) /* ".*" optimize info (multi-line) */ ------------------ 5326| | 5327| 31.0k| reg->anchor |= opt.anc.right_anchor & (ANCHOR_END_BUF | ANCHOR_SEMI_END_BUF | ------------------ | | 537| 31.0k|#define ANCHOR_END_BUF (1<<3) ------------------ reg->anchor |= opt.anc.right_anchor & (ANCHOR_END_BUF | ANCHOR_SEMI_END_BUF | ------------------ | | 538| 31.0k|#define ANCHOR_SEMI_END_BUF (1<<4) ------------------ 5328| 31.0k| ANCHOR_PREC_READ_NOT); ------------------ | | 546| 31.0k|#define ANCHOR_PREC_READ_NOT (1<<11) ------------------ 5329| | 5330| 31.0k| if (reg->anchor & (ANCHOR_END_BUF | ANCHOR_SEMI_END_BUF)) { ------------------ | | 537| 31.0k|#define ANCHOR_END_BUF (1<<3) ------------------ if (reg->anchor & (ANCHOR_END_BUF | ANCHOR_SEMI_END_BUF)) { ------------------ | | 538| 31.0k|#define ANCHOR_SEMI_END_BUF (1<<4) ------------------ | Branch (5330:7): [True: 0, False: 31.0k] ------------------ 5331| 0| reg->anchor_dmin = opt.len.min; 5332| 0| reg->anchor_dmax = opt.len.max; 5333| 0| } 5334| | 5335| 31.0k| if (opt.exb.len > 0 || opt.exm.len > 0) { ------------------ | Branch (5335:7): [True: 1.34k, False: 29.6k] | Branch (5335:26): [True: 20.2k, False: 9.43k] ------------------ 5336| 21.5k| select_opt_exact_info(reg->enc, &opt.exb, &opt.exm); 5337| 21.5k| if (opt.map.value > 0 && ------------------ | Branch (5337:9): [True: 21.5k, False: 0] ------------------ 5338| 21.5k| comp_opt_exact_or_map_info(&opt.exb, &opt.map) > 0) { ------------------ | Branch (5338:2): [True: 6.74k, False: 14.8k] ------------------ 5339| 6.74k| goto set_map; 5340| 6.74k| } 5341| 14.8k| else { 5342| 14.8k| r = set_optimize_exact_info(reg, &opt.exb); 5343| 14.8k| set_sub_anchor(reg, &opt.exb.anc); 5344| 14.8k| } 5345| 21.5k| } 5346| 9.43k| else if (opt.map.value > 0) { ------------------ | Branch (5346:12): [True: 4.04k, False: 5.39k] ------------------ 5347| 10.7k| set_map: 5348| 10.7k| set_optimize_map_info(reg, &opt.map); 5349| 10.7k| set_sub_anchor(reg, &opt.map.anc); 5350| 10.7k| } 5351| 5.39k| else { 5352| 5.39k| reg->sub_anchor |= opt.anc.left_anchor & ANCHOR_BEGIN_LINE; ------------------ | | 535| 5.39k|#define ANCHOR_BEGIN_LINE (1<<1) ------------------ 5353| 5.39k| if (opt.len.max == 0) ------------------ | Branch (5353:9): [True: 2.69k, False: 2.69k] ------------------ 5354| 2.69k| reg->sub_anchor |= opt.anc.right_anchor & ANCHOR_END_LINE; ------------------ | | 539| 2.69k|#define ANCHOR_END_LINE (1<<5) ------------------ 5355| 5.39k| } 5356| | 5357| |#if defined(ONIG_DEBUG_COMPILE) || defined(ONIG_DEBUG_MATCH) 5358| | print_optimize_info(stderr, reg); 5359| |#endif 5360| 31.0k| return r; 5361| 31.0k|} regcomp.c:clear_mml: 4387| 1.05M|{ 4388| 1.05M| mml->min = mml->max = 0; 4389| 1.05M|} regcomp.c:optimize_node_left: 4868| 249k|{ 4869| 249k| int type; 4870| 249k| int r = 0; 4871| | 4872| 249k| clear_node_opt_info(opt); 4873| 249k| set_bound_node_opt_info(opt, &env->mmd); 4874| | 4875| 249k| type = NTYPE(node); ------------------ | | 69| 249k|#define NTYPE(node) ((node)->u.base.type) ------------------ 4876| 249k| switch (type) { 4877| 32.3k| case NT_LIST: ------------------ | | 46| 32.3k|#define NT_LIST 8 ------------------ | Branch (4877:3): [True: 32.3k, False: 217k] ------------------ 4878| 32.3k| { 4879| 32.3k| OptEnv nenv; 4880| 32.3k| NodeOptInfo nopt; 4881| 32.3k| Node* nd = node; 4882| | 4883| 32.3k| copy_opt_env(&nenv, env); 4884| 133k| do { 4885| 133k| r = optimize_node_left(NCAR(nd), &nopt, &nenv); ------------------ | | 86| 133k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 133k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 4886| 133k| if (r == 0) { ------------------ | Branch (4886:6): [True: 133k, False: 0] ------------------ 4887| 133k| add_mml(&nenv.mmd, &nopt.len); 4888| 133k| concat_left_node_opt_info(env->enc, opt, &nopt); 4889| 133k| } 4890| 133k| } while (r == 0 && IS_NOT_NULL(nd = NCDR(nd))); ------------------ | | 306| 133k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 101k, False: 32.3k] | | ------------------ ------------------ | Branch (4890:16): [True: 133k, False: 0] ------------------ 4891| 32.3k| } 4892| 32.3k| break; 4893| | 4894| 8.08k| case NT_ALT: ------------------ | | 47| 8.08k|#define NT_ALT 9 ------------------ | Branch (4894:3): [True: 8.08k, False: 241k] ------------------ 4895| 8.08k| { 4896| 8.08k| NodeOptInfo nopt; 4897| 8.08k| Node* nd = node; 4898| | 4899| 18.8k| do { 4900| 18.8k| r = optimize_node_left(NCAR(nd), &nopt, env); ------------------ | | 86| 18.8k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 18.8k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 4901| 18.8k| if (r == 0) { ------------------ | Branch (4901:6): [True: 18.8k, False: 0] ------------------ 4902| 18.8k| if (nd == node) copy_node_opt_info(opt, &nopt); ------------------ | Branch (4902:8): [True: 8.08k, False: 10.7k] ------------------ 4903| 10.7k| else alt_merge_node_opt_info(opt, &nopt, env); 4904| 18.8k| } 4905| 18.8k| } while ((r == 0) && IS_NOT_NULL(nd = NCDR(nd))); ------------------ | | 306| 18.8k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 10.7k, False: 8.08k] | | ------------------ ------------------ | Branch (4905:16): [True: 18.8k, False: 0] ------------------ 4906| 8.08k| } 4907| 8.08k| break; 4908| | 4909| 57.9k| case NT_STR: ------------------ | | 38| 57.9k|#define NT_STR 0 ------------------ | Branch (4909:3): [True: 57.9k, False: 191k] ------------------ 4910| 57.9k| { 4911| 57.9k| StrNode* sn = NSTR(node); ------------------ | | 76| 57.9k|#define NSTR(node) (&((node)->u.str)) ------------------ 4912| 57.9k| OnigDistance slen = sn->end - sn->s; 4913| 57.9k| int is_raw = NSTRING_IS_RAW(node); ------------------ | | 114| 57.9k|#define NSTRING_IS_RAW(node) (((node)->u.str.flag & NSTR_RAW) != 0) | | ------------------ | | | | 104| 57.9k|#define NSTR_RAW (1<<0) /* by backslashed number */ | | ------------------ ------------------ 4914| | 4915| 57.9k| if (! NSTRING_IS_AMBIG(node)) { ------------------ | | 115| 57.9k|#define NSTRING_IS_AMBIG(node) (((node)->u.str.flag & NSTR_AMBIG) != 0) | | ------------------ | | | | 105| 57.9k|#define NSTR_AMBIG (1<<1) | | ------------------ ------------------ | Branch (4915:11): [True: 57.9k, False: 0] ------------------ 4916| 57.9k| concat_opt_exact_info_str(&opt->exb, sn->s, sn->end, 4917| 57.9k| is_raw, env->enc); 4918| 57.9k| opt->exb.ignore_case = 0; 4919| 57.9k| if (slen > 0) { ------------------ | Branch (4919:6): [True: 56.6k, False: 1.34k] ------------------ 4920| 56.6k| add_char_opt_map_info(&opt->map, *(sn->s), env->enc); 4921| 56.6k| } 4922| 57.9k| set_mml(&opt->len, slen, slen); 4923| 57.9k| } 4924| 0| else { 4925| 0| OnigDistance max; 4926| | 4927| 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] | | ------------------ ------------------ 4928| 0| int n = onigenc_strlen(env->enc, sn->s, sn->end); 4929| 0| max = (OnigDistance )ONIGENC_MBC_MAXLEN_DIST(env->enc) * n; ------------------ | | 363| 0|#define ONIGENC_MBC_MAXLEN_DIST(enc) ONIGENC_MBC_MAXLEN(enc) | | ------------------ | | | | 362| 0|#define ONIGENC_MBC_MAXLEN(enc) ((enc)->max_enc_len) | | ------------------ ------------------ 4930| 0| } 4931| 0| else { 4932| 0| concat_opt_exact_info_str(&opt->exb, sn->s, sn->end, 4933| 0| is_raw, env->enc); 4934| 0| opt->exb.ignore_case = 1; 4935| | 4936| 0| if (slen > 0) { ------------------ | Branch (4936:8): [True: 0, False: 0] ------------------ 4937| 0| r = add_char_amb_opt_map_info(&opt->map, sn->s, sn->end, 4938| 0| env->enc, env->case_fold_flag); 4939| 0| if (r != 0) break; ------------------ | Branch (4939:10): [True: 0, False: 0] ------------------ 4940| 0| } 4941| | 4942| 0| max = slen; 4943| 0| } 4944| | 4945| 0| set_mml(&opt->len, slen, max); 4946| 0| } 4947| | 4948| 57.9k| if ((OnigDistance )opt->exb.len == slen) ------------------ | Branch (4948:11): [True: 52.5k, False: 5.39k] ------------------ 4949| 52.5k| opt->exb.reach_end = 1; 4950| 57.9k| } 4951| 0| break; 4952| | 4953| 32.3k| case NT_CCLASS: ------------------ | | 39| 32.3k|#define NT_CCLASS 1 ------------------ | Branch (4953:3): [True: 32.3k, False: 217k] ------------------ 4954| 32.3k| { 4955| 32.3k| int i, z; 4956| 32.3k| CClassNode* cc = NCCLASS(node); ------------------ | | 77| 32.3k|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 4957| | 4958| | /* no need to check ignore case. (set in setup_tree()) */ 4959| | 4960| 32.3k| if (IS_NOT_NULL(cc->mbuf) || IS_NCCLASS_NOT(cc)) { ------------------ | | 306| 64.7k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 32.3k] | | ------------------ ------------------ if (IS_NOT_NULL(cc->mbuf) || IS_NCCLASS_NOT(cc)) { ------------------ | | 803| 32.3k|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 796| 32.3k|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 793| 32.3k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | | | | Branch (796:37): [True: 8.08k, False: 24.2k] | | | | ------------------ | | ------------------ ------------------ 4961| 8.08k| OnigDistance min = ONIGENC_MBC_MINLEN(env->enc); ------------------ | | 364| 8.08k|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) ------------------ 4962| 8.08k| OnigDistance max = ONIGENC_MBC_MAXLEN_DIST(env->enc); ------------------ | | 363| 8.08k|#define ONIGENC_MBC_MAXLEN_DIST(enc) ONIGENC_MBC_MAXLEN(enc) | | ------------------ | | | | 362| 8.08k|#define ONIGENC_MBC_MAXLEN(enc) ((enc)->max_enc_len) | | ------------------ ------------------ 4963| | 4964| 8.08k| set_mml(&opt->len, min, max); 4965| 8.08k| } 4966| 24.2k| else { 4967| 6.23M| for (i = 0; i < SINGLE_BYTE_SIZE; i++) { ------------------ | | 420| 6.23M|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 419| 6.23M|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (4967:14): [True: 6.21M, False: 24.2k] ------------------ 4968| 6.21M| z = BITSET_AT(cc->bs, i); ------------------ | | 442| 6.21M|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 439| 6.21M|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 6.21M|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 6.21M|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 440| 6.21M|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 6.21M|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 6.21M|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 4969| 6.21M| if ((z && !IS_NCCLASS_NOT(cc)) || (!z && IS_NCCLASS_NOT(cc))) { ------------------ | | 803| 119k|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 796| 119k|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 793| 119k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ if ((z && !IS_NCCLASS_NOT(cc)) || (!z && IS_NCCLASS_NOT(cc))) { ------------------ | | 803| 6.09M|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 796| 6.09M|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 793| 6.09M|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | | | | Branch (796:37): [True: 0, False: 6.09M] | | | | ------------------ | | ------------------ ------------------ | Branch (4969:9): [True: 119k, False: 6.09M] | Branch (4969:14): [True: 119k, False: 0] | Branch (4969:39): [True: 6.09M, False: 0] ------------------ 4970| 119k| add_char_opt_map_info(&opt->map, (UChar )i, env->enc); 4971| 119k| } 4972| 6.21M| } 4973| 24.2k| set_mml(&opt->len, 1, 1); 4974| 24.2k| } 4975| 32.3k| } 4976| 32.3k| break; 4977| | 4978| 0| case NT_CTYPE: ------------------ | | 40| 0|#define NT_CTYPE 2 ------------------ | Branch (4978:3): [True: 0, False: 249k] ------------------ 4979| 0| { 4980| 0| int i, min, max; 4981| 0| int maxcode; 4982| | 4983| 0| max = ONIGENC_MBC_MAXLEN_DIST(env->enc); ------------------ | | 363| 0|#define ONIGENC_MBC_MAXLEN_DIST(enc) ONIGENC_MBC_MAXLEN(enc) | | ------------------ | | | | 362| 0|#define ONIGENC_MBC_MAXLEN(enc) ((enc)->max_enc_len) | | ------------------ ------------------ 4984| | 4985| 0| if (max == 1) { ------------------ | Branch (4985:11): [True: 0, False: 0] ------------------ 4986| 0| min = 1; 4987| | 4988| 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; ------------------ | | 420| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 419| 0|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (4988:12): [True: 0, False: 0] ------------------ 4989| 0| switch (NCTYPE(node)->ctype) { ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ | Branch (4989:10): [True: 0, False: 0] ------------------ 4990| 0| case ONIGENC_CTYPE_WORD: ------------------ | | 306| 0|#define ONIGENC_CTYPE_WORD 12 ------------------ | Branch (4990:2): [True: 0, False: 0] ------------------ 4991| 0| if (NCTYPE(node)->not != 0) { ------------------ | | 78| 0|#define NCTYPE(node) (&((node)->u.ctype)) ------------------ | Branch (4991:8): [True: 0, False: 0] ------------------ 4992| 0| for (i = 0; i < SINGLE_BYTE_SIZE; i++) { ------------------ | | 420| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 419| 0|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (4992:18): [True: 0, False: 0] ------------------ 4993| 0| if (! ONIGENC_IS_CODE_WORD(env->enc, i) || i >= maxcode) { ------------------ | | 401| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | ------------------ | | | | 372| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | ------------------ ------------------ | Branch (4993:12): [True: 0, False: 0] | Branch (4993:51): [True: 0, False: 0] ------------------ 4994| 0| add_char_opt_map_info(&opt->map, (UChar )i, env->enc); 4995| 0| } 4996| 0| } 4997| 0| } 4998| 0| else { 4999| 0| for (i = 0; i < maxcode; i++) { ------------------ | Branch (4999:18): [True: 0, False: 0] ------------------ 5000| 0| if (ONIGENC_IS_CODE_WORD(env->enc, i)) { ------------------ | | 401| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | ------------------ | | | | 372| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (372:48): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 5001| 0| add_char_opt_map_info(&opt->map, (UChar )i, env->enc); 5002| 0| } 5003| 0| } 5004| 0| } 5005| 0| break; 5006| 0| } 5007| 0| } 5008| 0| else { 5009| 0| min = ONIGENC_MBC_MINLEN(env->enc); ------------------ | | 364| 0|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) ------------------ 5010| 0| } 5011| 0| set_mml(&opt->len, min, max); 5012| 0| } 5013| 0| break; 5014| | 5015| 13.4k| case NT_CANY: ------------------ | | 41| 13.4k|#define NT_CANY 3 ------------------ | Branch (5015:3): [True: 13.4k, False: 235k] ------------------ 5016| 13.4k| { 5017| 13.4k| OnigDistance min = ONIGENC_MBC_MINLEN(env->enc); ------------------ | | 364| 13.4k|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) ------------------ 5018| 13.4k| OnigDistance max = ONIGENC_MBC_MAXLEN_DIST(env->enc); ------------------ | | 363| 13.4k|#define ONIGENC_MBC_MAXLEN_DIST(enc) ONIGENC_MBC_MAXLEN(enc) | | ------------------ | | | | 362| 13.4k|#define ONIGENC_MBC_MAXLEN(enc) ((enc)->max_enc_len) | | ------------------ ------------------ 5019| 13.4k| set_mml(&opt->len, min, max); 5020| 13.4k| } 5021| 13.4k| break; 5022| | 5023| 39.0k| case NT_ANCHOR: ------------------ | | 45| 39.0k|#define NT_ANCHOR 7 ------------------ | Branch (5023:3): [True: 39.0k, False: 210k] ------------------ 5024| 39.0k| switch (NANCHOR(node)->type) { ------------------ | | 82| 39.0k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ | Branch (5024:13): [True: 1.34k, False: 37.7k] ------------------ 5025| 0| case ANCHOR_BEGIN_BUF: ------------------ | | 534| 0|#define ANCHOR_BEGIN_BUF (1<<0) ------------------ | Branch (5025:5): [True: 0, False: 39.0k] ------------------ 5026| 0| case ANCHOR_BEGIN_POSITION: ------------------ | | 536| 0|#define ANCHOR_BEGIN_POSITION (1<<2) ------------------ | Branch (5026:5): [True: 0, False: 39.0k] ------------------ 5027| 26.9k| case ANCHOR_BEGIN_LINE: ------------------ | | 535| 26.9k|#define ANCHOR_BEGIN_LINE (1<<1) ------------------ | Branch (5027:5): [True: 26.9k, False: 12.1k] ------------------ 5028| 26.9k| case ANCHOR_END_BUF: ------------------ | | 537| 26.9k|#define ANCHOR_END_BUF (1<<3) ------------------ | Branch (5028:5): [True: 0, False: 39.0k] ------------------ 5029| 26.9k| case ANCHOR_SEMI_END_BUF: ------------------ | | 538| 26.9k|#define ANCHOR_SEMI_END_BUF (1<<4) ------------------ | Branch (5029:5): [True: 0, False: 39.0k] ------------------ 5030| 37.7k| case ANCHOR_END_LINE: ------------------ | | 539| 37.7k|#define ANCHOR_END_LINE (1<<5) ------------------ | Branch (5030:5): [True: 10.7k, False: 28.3k] ------------------ 5031| 37.7k| case ANCHOR_LOOK_BEHIND: /* just for (?<=x).* */ ------------------ | | 547| 37.7k|#define ANCHOR_LOOK_BEHIND (1<<12) ------------------ | Branch (5031:5): [True: 0, False: 39.0k] ------------------ 5032| 37.7k| case ANCHOR_PREC_READ_NOT: /* just for (?!x).* */ ------------------ | | 546| 37.7k|#define ANCHOR_PREC_READ_NOT (1<<11) ------------------ | Branch (5032:5): [True: 0, False: 39.0k] ------------------ 5033| 37.7k| add_opt_anc_info(&opt->anc, NANCHOR(node)->type); ------------------ | | 82| 37.7k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 5034| 37.7k| break; 5035| | 5036| 0| case ANCHOR_PREC_READ: ------------------ | | 545| 0|#define ANCHOR_PREC_READ (1<<10) ------------------ | Branch (5036:5): [True: 0, False: 39.0k] ------------------ 5037| 0| { 5038| 0| NodeOptInfo nopt; 5039| | 5040| 0| r = optimize_node_left(NANCHOR(node)->target, &nopt, env); ------------------ | | 82| 0|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 5041| 0| if (r == 0) { ------------------ | Branch (5041:6): [True: 0, False: 0] ------------------ 5042| 0| if (nopt.exb.len > 0) ------------------ | Branch (5042:8): [True: 0, False: 0] ------------------ 5043| 0| copy_opt_exact_info(&opt->expr, &nopt.exb); 5044| 0| else if (nopt.exm.len > 0) ------------------ | Branch (5044:13): [True: 0, False: 0] ------------------ 5045| 0| copy_opt_exact_info(&opt->expr, &nopt.exm); 5046| | 5047| 0| opt->expr.reach_end = 0; 5048| | 5049| 0| if (nopt.map.value > 0) ------------------ | Branch (5049:8): [True: 0, False: 0] ------------------ 5050| 0| copy_opt_map_info(&opt->map, &nopt.map); 5051| 0| } 5052| 0| } 5053| 0| break; 5054| | 5055| 0| case ANCHOR_LOOK_BEHIND_NOT: ------------------ | | 548| 0|#define ANCHOR_LOOK_BEHIND_NOT (1<<13) ------------------ | Branch (5055:5): [True: 0, False: 39.0k] ------------------ 5056| 0| break; 5057| 39.0k| } 5058| 39.0k| break; 5059| | 5060| 39.0k| case NT_BREF: ------------------ | | 42| 0|#define NT_BREF 4 ------------------ | Branch (5060:3): [True: 0, False: 249k] ------------------ 5061| 0| { 5062| 0| int i; 5063| 0| int* backs; 5064| 0| OnigDistance min, max, tmin, tmax; 5065| 0| Node** nodes = SCANENV_MEM_NODES(env->scan_env); ------------------ | | 287| 0| (IS_NOT_NULL((senv)->mem_nodes_dynamic) ? \ | | ------------------ | | | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | | | ------------------ | | | | | Branch (306:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 288| 0| (senv)->mem_nodes_dynamic : (senv)->mem_nodes_static) ------------------ 5066| 0| BRefNode* br = NBREF(node); ------------------ | | 79| 0|#define NBREF(node) (&((node)->u.bref)) ------------------ 5067| | 5068| 0| if (br->state & NST_RECURSION) { ------------------ | | 135| 0|#define NST_RECURSION (1<<7) ------------------ | Branch (5068:11): [True: 0, False: 0] ------------------ 5069| 0| set_mml(&opt->len, 0, ONIG_INFINITE_DISTANCE); ------------------ | | 85| 0|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ 5070| 0| break; 5071| 0| } 5072| 0| backs = BACKREFS_P(br); ------------------ | | 120| 0| (IS_NOT_NULL((br)->back_dynamic) ? (br)->back_dynamic : (br)->back_static); | | ------------------ | | | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | | | ------------------ | | | | | Branch (306:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 5073| 0| r = get_min_match_length(nodes[backs[0]], &min, env->scan_env); 5074| 0| if (r != 0) break; ------------------ | Branch (5074:11): [True: 0, False: 0] ------------------ 5075| 0| r = get_max_match_length(nodes[backs[0]], &max, env->scan_env); 5076| 0| if (r != 0) break; ------------------ | Branch (5076:11): [True: 0, False: 0] ------------------ 5077| 0| for (i = 1; i < br->back_num; i++) { ------------------ | Branch (5077:19): [True: 0, False: 0] ------------------ 5078| 0| r = get_min_match_length(nodes[backs[i]], &tmin, env->scan_env); 5079| 0| if (r != 0) break; ------------------ | Branch (5079:6): [True: 0, False: 0] ------------------ 5080| 0| r = get_max_match_length(nodes[backs[i]], &tmax, env->scan_env); 5081| 0| if (r != 0) break; ------------------ | Branch (5081:6): [True: 0, False: 0] ------------------ 5082| 0| if (min > tmin) min = tmin; ------------------ | Branch (5082:6): [True: 0, False: 0] ------------------ 5083| 0| if (max < tmax) max = tmax; ------------------ | Branch (5083:6): [True: 0, False: 0] ------------------ 5084| 0| } 5085| 0| if (r == 0) set_mml(&opt->len, min, max); ------------------ | Branch (5085:11): [True: 0, False: 0] ------------------ 5086| 0| } 5087| 0| break; 5088| | 5089| 0|#ifdef USE_SUBEXP_CALL 5090| 0| case NT_CALL: ------------------ | | 48| 0|#define NT_CALL 10 ------------------ | Branch (5090:3): [True: 0, False: 249k] ------------------ 5091| 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] | | ------------------ ------------------ 5092| 0| set_mml(&opt->len, 0, ONIG_INFINITE_DISTANCE); ------------------ | | 85| 0|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ 5093| 0| else { 5094| 0| OnigOptionType save = env->options; 5095| 0| env->options = NENCLOSE(NCALL(node)->target)->option; ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 5096| 0| r = optimize_node_left(NCALL(node)->target, opt, env); ------------------ | | 84| 0|#define NCALL(node) (&((node)->u.call)) ------------------ 5097| 0| env->options = save; 5098| 0| } 5099| 0| break; 5100| 0|#endif 5101| | 5102| 40.4k| case NT_QTFR: ------------------ | | 43| 40.4k|#define NT_QTFR 5 ------------------ | Branch (5102:3): [True: 40.4k, False: 208k] ------------------ 5103| 40.4k| { 5104| 40.4k| int i; 5105| 40.4k| OnigDistance min, max; 5106| 40.4k| NodeOptInfo nopt; 5107| 40.4k| QtfrNode* qn = NQTFR(node); ------------------ | | 80| 40.4k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 5108| | 5109| 40.4k| r = optimize_node_left(qn->target, &nopt, env); 5110| 40.4k| if (r) break; ------------------ | Branch (5110:11): [True: 0, False: 40.4k] ------------------ 5111| | 5112| 40.4k| if (qn->lower == 0 && IS_REPEAT_INFINITE(qn->upper)) { ------------------ | | 416| 16.1k|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 415| 16.1k|#define REPEAT_INFINITE -1 | | ------------------ | | | Branch (416:33): [True: 14.8k, False: 1.34k] | | ------------------ ------------------ | Branch (5112:11): [True: 16.1k, False: 24.2k] ------------------ 5113| 14.8k| if (env->mmd.max == 0 && ------------------ | Branch (5113:6): [True: 8.08k, False: 6.74k] ------------------ 5114| 14.8k| NTYPE(qn->target) == NT_CANY && qn->greedy) { ------------------ | | 69| 8.08k|#define NTYPE(node) ((node)->u.base.type) ------------------ NTYPE(qn->target) == NT_CANY && qn->greedy) { ------------------ | | 41| 22.9k|#define NT_CANY 3 ------------------ | Branch (5114:6): [True: 0, False: 8.08k] | Branch (5114:38): [True: 0, False: 0] ------------------ 5115| 0| if (IS_MULTILINE(env->options)) ------------------ | | 389| 0|#define IS_MULTILINE(option) ((option) & ONIG_OPTION_MULTILINE) | | ------------------ | | | | 453| 0|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | ------------------ | | | | | | 452| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | ------------------ | | | | | | | | 451| 0|#define ONIG_OPTION_IGNORECASE 1U | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (389:35): [True: 0, False: 0] | | ------------------ ------------------ 5116| | /* implicit anchor: /.*a/ ==> /\A.*a/ */ 5117| 0| add_opt_anc_info(&opt->anc, ANCHOR_ANYCHAR_STAR_ML); ------------------ | | 551| 0|#define ANCHOR_ANYCHAR_STAR_ML (1<<15) /* ".*" optimize info (multi-line) */ ------------------ 5118| 0| else 5119| 0| add_opt_anc_info(&opt->anc, ANCHOR_ANYCHAR_STAR); ------------------ | | 550| 0|#define ANCHOR_ANYCHAR_STAR (1<<14) /* ".*" optimize info */ ------------------ 5120| 0| } 5121| 14.8k| } 5122| 25.6k| else { 5123| 25.6k| if (qn->lower > 0) { ------------------ | Branch (5123:6): [True: 24.2k, False: 1.34k] ------------------ 5124| 24.2k| copy_node_opt_info(opt, &nopt); 5125| 24.2k| if (nopt.exb.len > 0) { ------------------ | Branch (5125:8): [True: 0, False: 24.2k] ------------------ 5126| 0| if (nopt.exb.reach_end) { ------------------ | Branch (5126:10): [True: 0, False: 0] ------------------ 5127| 0| for (i = 2; i <= qn->lower && ------------------ | Branch (5127:20): [True: 0, False: 0] ------------------ 5128| 0| ! is_full_opt_exact_info(&opt->exb); i++) { ------------------ | Branch (5128:6): [True: 0, False: 0] ------------------ 5129| 0| concat_opt_exact_info(&opt->exb, &nopt.exb, env->enc); 5130| 0| } 5131| 0| if (i < qn->lower) { ------------------ | Branch (5131:12): [True: 0, False: 0] ------------------ 5132| 0| opt->exb.reach_end = 0; 5133| 0| } 5134| 0| } 5135| 0| } 5136| | 5137| 24.2k| if (qn->lower != qn->upper) { ------------------ | Branch (5137:8): [True: 24.2k, False: 0] ------------------ 5138| 24.2k| opt->exb.reach_end = 0; 5139| 24.2k| opt->exm.reach_end = 0; 5140| 24.2k| } 5141| 24.2k| if (qn->lower > 1) ------------------ | Branch (5141:8): [True: 0, False: 24.2k] ------------------ 5142| 0| opt->exm.reach_end = 0; 5143| 24.2k| } 5144| 25.6k| } 5145| | 5146| 40.4k| min = distance_multiply(nopt.len.min, qn->lower); 5147| 40.4k| if (IS_REPEAT_INFINITE(qn->upper)) ------------------ | | 416| 40.4k|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 415| 40.4k|#define REPEAT_INFINITE -1 | | ------------------ | | | Branch (416:33): [True: 39.0k, False: 1.34k] | | ------------------ ------------------ 5148| 39.0k| max = (nopt.len.max > 0 ? ONIG_INFINITE_DISTANCE : 0); ------------------ | | 85| 39.0k|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ | Branch (5148:9): [True: 39.0k, False: 0] ------------------ 5149| 1.34k| else 5150| 1.34k| max = distance_multiply(nopt.len.max, qn->upper); 5151| | 5152| 40.4k| set_mml(&opt->len, min, max); 5153| 40.4k| } 5154| 0| break; 5155| | 5156| 25.6k| case NT_ENCLOSE: ------------------ | | 44| 25.6k|#define NT_ENCLOSE 6 ------------------ | Branch (5156:3): [True: 25.6k, False: 223k] ------------------ 5157| 25.6k| { 5158| 25.6k| EncloseNode* en = NENCLOSE(node); ------------------ | | 81| 25.6k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 5159| | 5160| 25.6k| switch (en->type) { ------------------ | Branch (5160:15): [True: 0, False: 25.6k] ------------------ 5161| 1.34k| case ENCLOSE_OPTION: ------------------ | | 95| 1.34k|#define ENCLOSE_OPTION (1<<1) ------------------ | Branch (5161:7): [True: 1.34k, False: 24.2k] ------------------ 5162| 1.34k| { 5163| 1.34k| OnigOptionType save = env->options; 5164| | 5165| 1.34k| env->options = en->option; 5166| 1.34k| r = optimize_node_left(en->target, opt, env); 5167| 1.34k| env->options = save; 5168| 1.34k| } 5169| 1.34k| break; 5170| | 5171| 6.74k| case ENCLOSE_MEMORY: ------------------ | | 94| 6.74k|#define ENCLOSE_MEMORY (1<<0) ------------------ | Branch (5171:7): [True: 6.74k, False: 18.8k] ------------------ 5172| 6.74k|#ifdef USE_SUBEXP_CALL 5173| 6.74k| en->opt_count++; 5174| 6.74k| if (en->opt_count > MAX_NODE_OPT_INFO_REF_COUNT) { ------------------ | | 4864| 6.74k|#define MAX_NODE_OPT_INFO_REF_COUNT 5 ------------------ | Branch (5174:6): [True: 0, False: 6.74k] ------------------ 5175| 0| OnigDistance min, max; 5176| | 5177| 0| min = 0; 5178| 0| max = ONIG_INFINITE_DISTANCE; ------------------ | | 85| 0|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ 5179| 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] | | ------------------ ------------------ 5180| 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] | | ------------------ ------------------ 5181| 0| set_mml(&opt->len, min, max); 5182| 0| } 5183| 6.74k| else 5184| 6.74k|#endif 5185| 6.74k| { 5186| 6.74k| r = optimize_node_left(en->target, opt, env); 5187| | 5188| 6.74k| if (is_set_opt_anc_info(&opt->anc, ANCHOR_ANYCHAR_STAR_MASK)) { ------------------ | | 91| 6.74k|#define ANCHOR_ANYCHAR_STAR_MASK (ANCHOR_ANYCHAR_STAR | ANCHOR_ANYCHAR_STAR_ML) | | ------------------ | | | | 550| 6.74k|#define ANCHOR_ANYCHAR_STAR (1<<14) /* ".*" optimize info */ | | ------------------ | | #define ANCHOR_ANYCHAR_STAR_MASK (ANCHOR_ANYCHAR_STAR | ANCHOR_ANYCHAR_STAR_ML) | | ------------------ | | | | 551| 6.74k|#define ANCHOR_ANYCHAR_STAR_ML (1<<15) /* ".*" optimize info (multi-line) */ | | ------------------ ------------------ | Branch (5188:8): [True: 0, False: 6.74k] ------------------ 5189| 0| if (BIT_STATUS_AT(env->scan_env->backrefed_mem, en->regnum)) ------------------ | | 365| 0| ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1)) | | ------------------ | | | | 361| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (365:3): [True: 0, False: 0] | | | Branch (365:4): [True: 0, False: 0] | | ------------------ ------------------ 5190| 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) | | ------------------ | | | | 550| 0|#define ANCHOR_ANYCHAR_STAR (1<<14) /* ".*" optimize info */ | | ------------------ | | #define ANCHOR_ANYCHAR_STAR_MASK (ANCHOR_ANYCHAR_STAR | ANCHOR_ANYCHAR_STAR_ML) | | ------------------ | | | | 551| 0|#define ANCHOR_ANYCHAR_STAR_ML (1<<15) /* ".*" optimize info (multi-line) */ | | ------------------ ------------------ 5191| 0| } 5192| 6.74k| } 5193| 6.74k| break; 5194| | 5195| 17.5k| case ENCLOSE_STOP_BACKTRACK: ------------------ | | 96| 17.5k|#define ENCLOSE_STOP_BACKTRACK (1<<2) ------------------ | Branch (5195:7): [True: 17.5k, False: 8.08k] ------------------ 5196| 17.5k| case ENCLOSE_CONDITION: ------------------ | | 97| 17.5k|#define ENCLOSE_CONDITION (1<<3) ------------------ | Branch (5196:7): [True: 0, False: 25.6k] ------------------ 5197| 17.5k| r = optimize_node_left(en->target, opt, env); 5198| 17.5k| break; 5199| | 5200| 0| case ENCLOSE_ABSENT: ------------------ | | 98| 0|#define ENCLOSE_ABSENT (1<<4) ------------------ | Branch (5200:7): [True: 0, False: 25.6k] ------------------ 5201| 0| set_mml(&opt->len, 0, ONIG_INFINITE_DISTANCE); ------------------ | | 85| 0|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ 5202| 0| break; 5203| 25.6k| } 5204| 25.6k| } 5205| 25.6k| break; 5206| | 5207| 25.6k| default: ------------------ | Branch (5207:3): [True: 0, False: 249k] ------------------ 5208| |#ifdef ONIG_DEBUG 5209| | fprintf(stderr, "optimize_node_left: undefined node type %d\n", 5210| | NTYPE(node)); 5211| |#endif 5212| 0| r = ONIGERR_TYPE_BUG; ------------------ | | 630| 0|#define ONIGERR_TYPE_BUG -6 ------------------ 5213| 0| break; 5214| 249k| } 5215| | 5216| 249k| return r; 5217| 249k|} regcomp.c:clear_node_opt_info: 4777| 249k|{ 4778| 249k| clear_mml(&opt->len); 4779| 249k| clear_opt_anc_info(&opt->anc); 4780| 249k| clear_opt_exact_info(&opt->exb); 4781| 249k| clear_opt_exact_info(&opt->exm); 4782| 249k| clear_opt_exact_info(&opt->expr); 4783| 249k| clear_opt_map_info(&opt->map); 4784| 249k|} regcomp.c:clear_opt_anc_info: 4429| 1.16M|{ 4430| 1.16M| anc->left_anchor = 0; 4431| 1.16M| anc->right_anchor = 0; 4432| 1.16M|} regcomp.c:clear_opt_exact_info: 4512| 773k|{ 4513| 773k| clear_mml(&ex->mmd); 4514| 773k| clear_opt_anc_info(&ex->anc); 4515| 773k| ex->reach_end = 0; 4516| 773k| ex->ignore_case = -1; /* unset */ 4517| 773k| ex->len = 0; 4518| 773k| ex->s[0] = '\0'; 4519| 773k|} regcomp.c:clear_opt_map_info: 4645| 249k|{ 4646| 249k| static const OptMapInfo clean_info = { 4647| 249k| {0, 0}, {0, 0}, 0, 4648| 249k| { 4649| 249k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4650| 249k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4651| 249k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4652| 249k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4653| 249k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4654| 249k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4655| 249k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4656| 249k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4657| 249k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4658| 249k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4659| 249k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4660| 249k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4661| 249k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4662| 249k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4663| 249k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4664| 249k| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 4665| 249k| } 4666| 249k| }; 4667| | 4668| 249k| xmemcpy(map, &clean_info, sizeof(OptMapInfo)); ------------------ | | 209| 249k|#define xmemcpy memcpy ------------------ 4669| 249k|} regcomp.c:set_bound_node_opt_info: 4769| 249k|{ 4770| 249k| copy_mml(&(opt->exb.mmd), mmd); 4771| 249k| copy_mml(&(opt->expr.mmd), mmd); 4772| 249k| copy_mml(&(opt->map.mmd), mmd); 4773| 249k|} regcomp.c:copy_mml: 4393| 748k|{ 4394| 748k| to->min = from->min; 4395| 748k| to->max = from->max; 4396| 748k|} regcomp.c:copy_opt_env: 4423| 32.3k|{ 4424| 32.3k| *to = *from; 4425| 32.3k|} regcomp.c:add_mml: 4400| 266k|{ 4401| 266k| to->min = distance_add(to->min, from->min); 4402| 266k| to->max = distance_add(to->max, from->max); 4403| 266k|} regcomp.c:concat_left_node_opt_info: 4794| 133k|{ 4795| 133k| int exb_reach, exm_reach; 4796| 133k| OptAncInfo tanc; 4797| | 4798| 133k| concat_opt_anc_info(&tanc, &to->anc, &add->anc, to->len.max, add->len.max); 4799| 133k| copy_opt_anc_info(&to->anc, &tanc); 4800| | 4801| 133k| if (add->exb.len > 0 && to->len.max == 0) { ------------------ | Branch (4801:7): [True: 39.0k, False: 94.3k] | Branch (4801:27): [True: 8.08k, False: 31.0k] ------------------ 4802| 8.08k| concat_opt_anc_info(&tanc, &to->anc, &add->exb.anc, 4803| 8.08k| to->len.max, add->len.max); 4804| 8.08k| copy_opt_anc_info(&add->exb.anc, &tanc); 4805| 8.08k| } 4806| | 4807| 133k| if (add->map.value > 0 && to->len.max == 0) { ------------------ | Branch (4807:7): [True: 62.0k, False: 71.4k] | Branch (4807:29): [True: 14.8k, False: 47.1k] ------------------ 4808| 14.8k| if (add->map.mmd.max == 0) ------------------ | Branch (4808:9): [True: 14.8k, False: 0] ------------------ 4809| 14.8k| add->map.anc.left_anchor |= to->anc.left_anchor; 4810| 14.8k| } 4811| | 4812| 133k| exb_reach = to->exb.reach_end; 4813| 133k| exm_reach = to->exm.reach_end; 4814| | 4815| 133k| if (add->len.max != 0) ------------------ | Branch (4815:7): [True: 93.0k, False: 40.4k] ------------------ 4816| 93.0k| to->exb.reach_end = to->exm.reach_end = 0; 4817| | 4818| 133k| if (add->exb.len > 0) { ------------------ | Branch (4818:7): [True: 39.0k, False: 94.3k] ------------------ 4819| 39.0k| if (exb_reach) { ------------------ | Branch (4819:9): [True: 0, False: 39.0k] ------------------ 4820| 0| concat_opt_exact_info(&to->exb, &add->exb, enc); 4821| 0| clear_opt_exact_info(&add->exb); 4822| 0| } 4823| 39.0k| else if (exm_reach) { ------------------ | Branch (4823:14): [True: 1.34k, False: 37.7k] ------------------ 4824| 1.34k| concat_opt_exact_info(&to->exm, &add->exb, enc); 4825| 1.34k| clear_opt_exact_info(&add->exb); 4826| 1.34k| } 4827| 39.0k| } 4828| 133k| select_opt_exact_info(enc, &to->exm, &add->exb); 4829| 133k| select_opt_exact_info(enc, &to->exm, &add->exm); 4830| | 4831| 133k| if (to->expr.len > 0) { ------------------ | Branch (4831:7): [True: 0, False: 133k] ------------------ 4832| 0| if (add->len.max > 0) { ------------------ | Branch (4832:9): [True: 0, False: 0] ------------------ 4833| 0| if (to->expr.len > (int )add->len.max) ------------------ | Branch (4833:11): [True: 0, False: 0] ------------------ 4834| 0| to->expr.len = (int )add->len.max; 4835| | 4836| 0| if (to->expr.mmd.max == 0) ------------------ | Branch (4836:11): [True: 0, False: 0] ------------------ 4837| 0| select_opt_exact_info(enc, &to->exb, &to->expr); 4838| 0| else 4839| 0| select_opt_exact_info(enc, &to->exm, &to->expr); 4840| 0| } 4841| 0| } 4842| 133k| else if (add->expr.len > 0) { ------------------ | Branch (4842:12): [True: 0, False: 133k] ------------------ 4843| 0| copy_opt_exact_info(&to->expr, &add->expr); 4844| 0| } 4845| | 4846| 133k| select_opt_map_info(&to->map, &add->map); 4847| | 4848| 133k| add_mml(&to->len, &add->len); 4849| 133k|} regcomp.c:concat_opt_anc_info: 4443| 142k|{ 4444| 142k| clear_opt_anc_info(to); 4445| | 4446| 142k| to->left_anchor = left->left_anchor; 4447| 142k| if (left_len == 0) { ------------------ | Branch (4447:7): [True: 68.7k, False: 74.1k] ------------------ 4448| 68.7k| to->left_anchor |= right->left_anchor; 4449| 68.7k| } 4450| | 4451| 142k| to->right_anchor = right->right_anchor; 4452| 142k| if (right_len == 0) { ------------------ | Branch (4452:7): [True: 40.4k, False: 102k] ------------------ 4453| 40.4k| to->right_anchor |= left->right_anchor; 4454| 40.4k| } 4455| 102k| else { 4456| 102k| to->right_anchor |= (left->right_anchor & ANCHOR_PREC_READ_NOT); ------------------ | | 546| 102k|#define ANCHOR_PREC_READ_NOT (1<<11) ------------------ 4457| 102k| } 4458| 142k|} regcomp.c:copy_opt_anc_info: 4436| 142k|{ 4437| 142k| *to = *from; 4438| 142k|} regcomp.c:select_opt_map_info: 4710| 133k|{ 4711| 133k| const int z = 1<<15; /* 32768: something big value */ 4712| | 4713| 133k| int v1, v2; 4714| | 4715| 133k| if (alt->value == 0) return ; ------------------ | Branch (4715:7): [True: 71.4k, False: 62.0k] ------------------ 4716| 62.0k| if (now->value == 0) { ------------------ | Branch (4716:7): [True: 28.3k, False: 33.7k] ------------------ 4717| 28.3k| copy_opt_map_info(now, alt); 4718| 28.3k| return ; 4719| 28.3k| } 4720| | 4721| 33.7k| v1 = z / now->value; 4722| 33.7k| v2 = z / alt->value; 4723| 33.7k| if (comp_distance_value(&now->mmd, &alt->mmd, v1, v2) > 0) ------------------ | Branch (4723:7): [True: 0, False: 33.7k] ------------------ 4724| 0| copy_opt_map_info(now, alt); 4725| 33.7k|} regcomp.c:comp_distance_value: 4356| 67.4k|{ 4357| 67.4k| if (v2 <= 0) return -1; ------------------ | Branch (4357:7): [True: 0, False: 67.4k] ------------------ 4358| 67.4k| if (v1 <= 0) return 1; ------------------ | Branch (4358:7): [True: 0, False: 67.4k] ------------------ 4359| | 4360| 67.4k| v1 *= distance_value(d1); 4361| 67.4k| v2 *= distance_value(d2); 4362| | 4363| 67.4k| if (v2 > v1) return 1; ------------------ | Branch (4363:7): [True: 5.39k, False: 62.0k] ------------------ 4364| 62.0k| if (v2 < v1) return -1; ------------------ | Branch (4364:7): [True: 29.6k, False: 32.3k] ------------------ 4365| | 4366| 32.3k| if (d2->min < d1->min) return 1; ------------------ | Branch (4366:7): [True: 1.34k, False: 31.0k] ------------------ 4367| 31.0k| if (d2->min > d1->min) return -1; ------------------ | Branch (4367:7): [True: 24.2k, False: 6.74k] ------------------ 4368| 6.74k| return 0; 4369| 31.0k|} regcomp.c:distance_value: 4327| 134k|{ 4328| | /* 1000 / (min-max-dist + 1) */ 4329| 134k| static const short int dist_vals[] = { 4330| 134k| 1000, 500, 333, 250, 200, 167, 143, 125, 111, 100, 4331| 134k| 91, 83, 77, 71, 67, 63, 59, 56, 53, 50, 4332| 134k| 48, 45, 43, 42, 40, 38, 37, 36, 34, 33, 4333| 134k| 32, 31, 30, 29, 29, 28, 27, 26, 26, 25, 4334| 134k| 24, 24, 23, 23, 22, 22, 21, 21, 20, 20, 4335| 134k| 20, 19, 19, 19, 18, 18, 18, 17, 17, 17, 4336| 134k| 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 4337| 134k| 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 4338| 134k| 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 4339| 134k| 11, 11, 11, 11, 11, 10, 10, 10, 10, 10 4340| 134k| }; 4341| | 4342| 134k| OnigDistance d; 4343| | 4344| 134k| if (mm->max == ONIG_INFINITE_DISTANCE) return 0; ------------------ | | 85| 134k|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ | Branch (4344:7): [True: 84.9k, False: 49.8k] ------------------ 4345| | 4346| 49.8k| d = mm->max - mm->min; 4347| 49.8k| if (d < numberof(dist_vals)) ------------------ | | 128| 49.8k|# define numberof(array) (int )(sizeof(array) / sizeof((array)[0])) ------------------ | Branch (4347:7): [True: 49.8k, False: 0] ------------------ 4348| | /* return dist_vals[d] * 16 / (mm->min + 12); */ 4349| 49.8k| return (int )dist_vals[d]; 4350| 0| else 4351| 0| return 1; 4352| 49.8k|} regcomp.c:copy_node_opt_info: 4788| 32.3k|{ 4789| 32.3k| *to = *from; 4790| 32.3k|} regcomp.c:alt_merge_node_opt_info: 4853| 10.7k|{ 4854| 10.7k| alt_merge_opt_anc_info (&to->anc, &add->anc); 4855| 10.7k| alt_merge_opt_exact_info(&to->exb, &add->exb, env); 4856| 10.7k| alt_merge_opt_exact_info(&to->exm, &add->exm, env); 4857| 10.7k| alt_merge_opt_exact_info(&to->expr, &add->expr, env); 4858| 10.7k| alt_merge_opt_map_info(env->enc, &to->map, &add->map); 4859| | 4860| 10.7k| alt_merge_mml(&to->len, &add->len); 4861| 10.7k|} regcomp.c:alt_merge_opt_anc_info: 4499| 29.6k|{ 4500| 29.6k| to->left_anchor &= add->left_anchor; 4501| 29.6k| to->right_anchor &= add->right_anchor; 4502| 29.6k|} regcomp.c:alt_merge_opt_exact_info: 4575| 32.3k|{ 4576| 32.3k| int i, j, len; 4577| | 4578| 32.3k| if (add->len == 0 || to->len == 0) { ------------------ | Branch (4578:7): [True: 21.5k, False: 10.7k] | Branch (4578:24): [True: 1.34k, False: 9.43k] ------------------ 4579| 22.9k| clear_opt_exact_info(to); 4580| 22.9k| return ; 4581| 22.9k| } 4582| | 4583| 9.43k| if (! is_equal_mml(&to->mmd, &add->mmd)) { ------------------ | Branch (4583:7): [True: 1.34k, False: 8.08k] ------------------ 4584| 1.34k| clear_opt_exact_info(to); 4585| 1.34k| return ; 4586| 1.34k| } 4587| | 4588| 13.4k| for (i = 0; i < to->len && i < add->len; ) { ------------------ | Branch (4588:15): [True: 13.4k, False: 0] | Branch (4588:30): [True: 13.4k, False: 0] ------------------ 4589| 13.4k| if (to->s[i] != add->s[i]) break; ------------------ | Branch (4589:9): [True: 8.08k, False: 5.39k] ------------------ 4590| 5.39k| len = enclen(env->enc, to->s + i, to->s + to->len); ------------------ | | 93| 5.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)) | | ------------------ | | | | 361| 5.39k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 5.39k] | | ------------------ ------------------ 4591| | 4592| 5.39k| for (j = 1; j < len; j++) { ------------------ | Branch (4592:17): [True: 0, False: 5.39k] ------------------ 4593| 0| if (to->s[i+j] != add->s[i+j]) break; ------------------ | Branch (4593:11): [True: 0, False: 0] ------------------ 4594| 0| } 4595| 5.39k| if (j < len) break; ------------------ | Branch (4595:9): [True: 0, False: 5.39k] ------------------ 4596| 5.39k| i += len; 4597| 5.39k| } 4598| | 4599| 8.08k| if (! add->reach_end || i < add->len || i < to->len) { ------------------ | Branch (4599:7): [True: 0, False: 8.08k] | Branch (4599:27): [True: 8.08k, False: 0] | Branch (4599:43): [True: 0, False: 0] ------------------ 4600| 8.08k| to->reach_end = 0; 4601| 8.08k| } 4602| 8.08k| to->len = i; 4603| 8.08k| if (to->ignore_case < 0) ------------------ | Branch (4603:7): [True: 0, False: 8.08k] ------------------ 4604| 0| to->ignore_case = add->ignore_case; 4605| 8.08k| else if (add->ignore_case >= 0) ------------------ | Branch (4605:12): [True: 8.08k, False: 0] ------------------ 4606| 8.08k| to->ignore_case |= add->ignore_case; 4607| | 4608| 8.08k| alt_merge_opt_anc_info(&to->anc, &add->anc); 4609| 8.08k| if (! to->reach_end) to->anc.right_anchor = 0; ------------------ | Branch (4609:7): [True: 8.08k, False: 0] ------------------ 4610| 8.08k|} regcomp.c:is_equal_mml: 4373| 9.43k|{ 4374| 9.43k| return (a->min == b->min && a->max == b->max) ? 1 : 0; ------------------ | Branch (4374:11): [True: 8.08k, False: 1.34k] | Branch (4374:31): [True: 8.08k, False: 0] ------------------ 4375| 9.43k|} regcomp.c:alt_merge_opt_map_info: 4742| 10.7k|{ 4743| 10.7k| int i, val; 4744| | 4745| | /* if (! is_equal_mml(&to->mmd, &add->mmd)) return ; */ 4746| 10.7k| if (to->value == 0) return ; ------------------ | Branch (4746:7): [True: 0, False: 10.7k] ------------------ 4747| 10.7k| if (add->value == 0 || to->mmd.max < add->mmd.min) { ------------------ | Branch (4747:7): [True: 0, False: 10.7k] | Branch (4747:26): [True: 0, False: 10.7k] ------------------ 4748| 0| clear_opt_map_info(to); 4749| 0| return ; 4750| 0| } 4751| | 4752| 10.7k| alt_merge_mml(&to->mmd, &add->mmd); 4753| | 4754| 10.7k| val = 0; 4755| 2.77M| for (i = 0; i < ONIG_CHAR_TABLE_SIZE; i++) { ------------------ | | 753| 2.77M|#define ONIG_CHAR_TABLE_SIZE 256 ------------------ | Branch (4755:15): [True: 2.76M, False: 10.7k] ------------------ 4756| 2.76M| if (add->map[i]) ------------------ | Branch (4756:9): [True: 10.7k, False: 2.74M] ------------------ 4757| 10.7k| to->map[i] = 1; 4758| | 4759| 2.76M| if (to->map[i]) ------------------ | Branch (4759:9): [True: 20.2k, False: 2.74M] ------------------ 4760| 20.2k| val += map_position_value(enc, i); 4761| 2.76M| } 4762| 10.7k| to->value = val; 4763| | 4764| 10.7k| alt_merge_opt_anc_info(&to->anc, &add->anc); 4765| 10.7k|} regcomp.c:map_position_value: 4303| 199k|{ 4304| 199k| static const short int ByteValTable[] = { 4305| 199k| 5, 1, 1, 1, 1, 1, 1, 1, 1, 10, 10, 1, 1, 10, 1, 1, 4306| 199k| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4307| 199k| 12, 4, 7, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 4308| 199k| 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4309| 199k| 5, 6, 6, 6, 6, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4310| 199k| 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 6, 5, 5, 5, 4311| 199k| 5, 6, 6, 6, 6, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4312| 199k| 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1 4313| 199k| }; 4314| | 4315| 199k| if (i < numberof(ByteValTable)) { ------------------ | | 128| 199k|# define numberof(array) (int )(sizeof(array) / sizeof((array)[0])) ------------------ | Branch (4315:7): [True: 199k, False: 0] ------------------ 4316| 199k| if (i == 0 && ONIGENC_MBC_MINLEN(enc) > 1) ------------------ | | 364| 0|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) ------------------ | Branch (4316:9): [True: 0, False: 199k] | Branch (4316:19): [True: 0, False: 0] ------------------ 4317| 0| return 20; 4318| 199k| else 4319| 199k| return (int )ByteValTable[i]; 4320| 199k| } 4321| 0| else 4322| 0| return 4; /* Take it easy. */ 4323| 199k|} regcomp.c:alt_merge_mml: 4416| 21.5k|{ 4417| 21.5k| if (to->min > from->min) to->min = from->min; ------------------ | Branch (4417:7): [True: 2.69k, False: 18.8k] ------------------ 4418| 21.5k| if (to->max < from->max) to->max = from->max; ------------------ | Branch (4418:7): [True: 4.04k, False: 17.5k] ------------------ 4419| 21.5k|} regcomp.c:concat_opt_exact_info_str: 4559| 57.9k|{ 4560| 57.9k| int i, j, len; 4561| 57.9k| UChar *p; ------------------ | | 76| 57.9k|# define UChar OnigUChar ------------------ 4562| | 4563| 478k| for (i = to->len, p = s; p < end && i < OPT_EXACT_MAXLEN; ) { ------------------ | | 89| 425k|#define OPT_EXACT_MAXLEN 24 /* This must be smaller than ONIG_CHAR_TABLE_SIZE. */ ------------------ | Branch (4563:28): [True: 425k, False: 52.5k] | Branch (4563:39): [True: 420k, False: 5.39k] ------------------ 4564| 420k| len = enclen(enc, p, end); ------------------ | | 93| 420k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 361| 420k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 420k] | | ------------------ ------------------ 4565| 420k| if (i + len > OPT_EXACT_MAXLEN) break; ------------------ | | 89| 420k|#define OPT_EXACT_MAXLEN 24 /* This must be smaller than ONIG_CHAR_TABLE_SIZE. */ ------------------ | Branch (4565:9): [True: 0, False: 420k] ------------------ 4566| 841k| for (j = 0; j < len && p < end; j++) ------------------ | Branch (4566:17): [True: 420k, False: 420k] | Branch (4566:28): [True: 420k, False: 0] ------------------ 4567| 420k| to->s[i++] = *p++; 4568| 420k| } 4569| | 4570| 57.9k| to->len = i; 4571| 57.9k|} regcomp.c:add_char_opt_map_info: 4679| 176k|{ 4680| 176k| if (map->map[c] == 0) { ------------------ | Branch (4680:7): [True: 176k, False: 0] ------------------ 4681| 176k| map->map[c] = 1; 4682| 176k| map->value += map_position_value(enc, c); 4683| 176k| } 4684| 176k|} regcomp.c:set_mml: 4380| 144k|{ 4381| 144k| mml->min = min; 4382| 144k| mml->max = max; 4383| 144k|} regcomp.c:add_opt_anc_info: 4481| 37.7k|{ 4482| 37.7k| if (is_left_anchor(anc)) ------------------ | Branch (4482:7): [True: 26.9k, False: 10.7k] ------------------ 4483| 26.9k| to->left_anchor |= anc; 4484| 10.7k| else 4485| 10.7k| to->right_anchor |= anc; 4486| 37.7k|} regcomp.c:is_left_anchor: 4462| 37.7k|{ 4463| 37.7k| if (anc == ANCHOR_END_BUF || anc == ANCHOR_SEMI_END_BUF || ------------------ | | 537| 75.4k|#define ANCHOR_END_BUF (1<<3) ------------------ if (anc == ANCHOR_END_BUF || anc == ANCHOR_SEMI_END_BUF || ------------------ | | 538| 75.4k|#define ANCHOR_SEMI_END_BUF (1<<4) ------------------ | Branch (4463:7): [True: 0, False: 37.7k] | Branch (4463:32): [True: 0, False: 37.7k] ------------------ 4464| 37.7k| anc == ANCHOR_END_LINE || anc == ANCHOR_PREC_READ || ------------------ | | 539| 75.4k|#define ANCHOR_END_LINE (1<<5) ------------------ anc == ANCHOR_END_LINE || anc == ANCHOR_PREC_READ || ------------------ | | 545| 64.7k|#define ANCHOR_PREC_READ (1<<10) ------------------ | Branch (4464:7): [True: 10.7k, False: 26.9k] | Branch (4464:33): [True: 0, False: 26.9k] ------------------ 4465| 37.7k| anc == ANCHOR_PREC_READ_NOT) ------------------ | | 546| 26.9k|#define ANCHOR_PREC_READ_NOT (1<<11) ------------------ | Branch (4465:7): [True: 0, False: 26.9k] ------------------ 4466| 10.7k| return 0; 4467| | 4468| 26.9k| return 1; 4469| 37.7k|} regcomp.c:copy_opt_exact_info: 4523| 45.8k|{ 4524| 45.8k| *to = *from; 4525| 45.8k|} regcomp.c:copy_opt_map_info: 4673| 28.3k|{ 4674| 28.3k| *to = *from; 4675| 28.3k|} regcomp.c:concat_opt_exact_info: 4529| 1.34k|{ 4530| 1.34k| int i, j, len; 4531| 1.34k| UChar *p, *end; ------------------ | | 76| 1.34k|# define UChar OnigUChar ------------------ 4532| 1.34k| OptAncInfo tanc; 4533| | 4534| 1.34k| if (to->ignore_case < 0) ------------------ | Branch (4534:7): [True: 0, False: 1.34k] ------------------ 4535| 0| to->ignore_case = add->ignore_case; 4536| 1.34k| else if (to->ignore_case != add->ignore_case) ------------------ | Branch (4536:12): [True: 0, False: 1.34k] ------------------ 4537| 0| return ; /* avoid */ 4538| | 4539| 1.34k| p = add->s; 4540| 1.34k| end = p + add->len; 4541| 5.39k| for (i = to->len; p < end; ) { ------------------ | Branch (4541:21): [True: 4.04k, False: 1.34k] ------------------ 4542| 4.04k| len = enclen(enc, p, end); ------------------ | | 93| 4.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)) | | ------------------ | | | | 361| 4.04k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 4.04k] | | ------------------ ------------------ 4543| 4.04k| if (i + len > OPT_EXACT_MAXLEN) break; ------------------ | | 89| 4.04k|#define OPT_EXACT_MAXLEN 24 /* This must be smaller than ONIG_CHAR_TABLE_SIZE. */ ------------------ | Branch (4543:9): [True: 0, False: 4.04k] ------------------ 4544| 8.08k| for (j = 0; j < len && p < end; j++) ------------------ | Branch (4544:17): [True: 4.04k, False: 4.04k] | Branch (4544:28): [True: 4.04k, False: 0] ------------------ 4545| 4.04k| to->s[i++] = *p++; 4546| 4.04k| } 4547| | 4548| 1.34k| to->len = i; 4549| 1.34k| to->reach_end = (p == end ? add->reach_end : 0); ------------------ | Branch (4549:20): [True: 1.34k, False: 0] ------------------ 4550| | 4551| 1.34k| concat_opt_anc_info(&tanc, &to->anc, &add->anc, 1, 1); 4552| 1.34k| if (! to->reach_end) tanc.right_anchor = 0; ------------------ | Branch (4552:7): [True: 1.34k, False: 0] ------------------ 4553| 1.34k| copy_opt_anc_info(&to->anc, &tanc); 4554| 1.34k|} regcomp.c:is_set_opt_anc_info: 4473| 6.74k|{ 4474| 6.74k| if ((to->left_anchor & anc) != 0) return 1; ------------------ | Branch (4474:7): [True: 0, False: 6.74k] ------------------ 4475| | 4476| 6.74k| return ((to->right_anchor & anc) != 0 ? 1 : 0); ------------------ | Branch (4476:11): [True: 0, False: 6.74k] ------------------ 4477| 6.74k|} regcomp.c:select_opt_exact_info: 4614| 288k|{ 4615| 288k| int v1, v2; 4616| | 4617| 288k| v1 = now->len; 4618| 288k| v2 = alt->len; 4619| | 4620| 288k| if (v2 == 0) { ------------------ | Branch (4620:7): [True: 230k, False: 57.9k] ------------------ 4621| 230k| return ; 4622| 230k| } 4623| 57.9k| else if (v1 == 0) { ------------------ | Branch (4623:12): [True: 45.8k, False: 12.1k] ------------------ 4624| 45.8k| copy_opt_exact_info(now, alt); 4625| 45.8k| return ; 4626| 45.8k| } 4627| 12.1k| else if (v1 <= 2 && v2 <= 2) { ------------------ | Branch (4627:12): [True: 2.69k, False: 9.43k] | Branch (4627:23): [True: 1.34k, False: 1.34k] ------------------ 4628| | /* ByteValTable[x] is big value --> low price */ 4629| 1.34k| v2 = map_position_value(enc, now->s[0]); 4630| 1.34k| v1 = map_position_value(enc, alt->s[0]); 4631| | 4632| 1.34k| if (now->len > 1) v1 += 5; ------------------ | Branch (4632:9): [True: 0, False: 1.34k] ------------------ 4633| 1.34k| if (alt->len > 1) v2 += 5; ------------------ | Branch (4633:9): [True: 0, False: 1.34k] ------------------ 4634| 1.34k| } 4635| | 4636| 12.1k| if (now->ignore_case <= 0) v1 *= 2; ------------------ | Branch (4636:7): [True: 12.1k, False: 0] ------------------ 4637| 12.1k| if (alt->ignore_case <= 0) v2 *= 2; ------------------ | Branch (4637:7): [True: 12.1k, False: 0] ------------------ 4638| | 4639| 12.1k| if (comp_distance_value(&now->mmd, &alt->mmd, v1, v2) > 0) ------------------ | Branch (4639:7): [True: 0, False: 12.1k] ------------------ 4640| 0| copy_opt_exact_info(now, alt); 4641| 12.1k|} regcomp.c:comp_opt_exact_or_map_info: 4729| 21.5k|{ 4730| 21.5k|#define COMP_EM_BASE 20 4731| 21.5k| int ve, vm; 4732| | 4733| 21.5k| if (m->value <= 0) return -1; ------------------ | Branch (4733:7): [True: 0, False: 21.5k] ------------------ 4734| | 4735| 21.5k| ve = COMP_EM_BASE * e->len * (e->ignore_case > 0 ? 1 : 2); ------------------ | | 4730| 21.5k|#define COMP_EM_BASE 20 ------------------ | Branch (4735:33): [True: 0, False: 21.5k] ------------------ 4736| 21.5k| vm = COMP_EM_BASE * 5 * 2 / m->value; ------------------ | | 4730| 21.5k|#define COMP_EM_BASE 20 ------------------ 4737| 21.5k| return comp_distance_value(&e->mmd, &m->mmd, ve, vm); 4738| 21.5k|} regcomp.c:set_optimize_exact_info: 5221| 14.8k|{ 5222| 14.8k| int allow_reverse; 5223| | 5224| 14.8k| if (e->len == 0) return 0; ------------------ | Branch (5224:7): [True: 0, False: 14.8k] ------------------ 5225| | 5226| 14.8k| reg->exact = (UChar* )xmalloc(e->len); ------------------ | | 142| 14.8k|# define xmalloc malloc ------------------ 5227| 14.8k| CHECK_NULL_RETURN_MEMERR(reg->exact); ------------------ | | 308| 14.8k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 14.8k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 14.8k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 5228| 14.8k| xmemcpy(reg->exact, e->s, e->len); ------------------ | | 209| 14.8k|#define xmemcpy memcpy ------------------ 5229| 14.8k| reg->exact_end = reg->exact + e->len; 5230| | 5231| 14.8k| allow_reverse = 5232| 14.8k| ONIGENC_IS_ALLOWED_REVERSE_MATCH(reg->enc, reg->exact, reg->exact_end); ------------------ | | 335| 14.8k| (enc)->is_allowed_reverse_match(s,end,enc) ------------------ 5233| | 5234| 14.8k| if (e->ignore_case > 0) { ------------------ | Branch (5234:7): [True: 0, False: 14.8k] ------------------ 5235| 0| if (e->len >= 3 || (e->len >= 2 && allow_reverse)) { ------------------ | Branch (5235:9): [True: 0, False: 0] | Branch (5235:25): [True: 0, False: 0] | Branch (5235:40): [True: 0, False: 0] ------------------ 5236| 0| e->len = set_bm_skip(reg->exact, reg->exact_end, reg, 5237| 0| reg->map, 1); 5238| 0| reg->exact_end = reg->exact + e->len; 5239| 0| if (e->len >= 3) { ------------------ | Branch (5239:11): [True: 0, False: 0] ------------------ 5240| 0| reg->optimize = (allow_reverse != 0 ------------------ | Branch (5240:19): [True: 0, False: 0] ------------------ 5241| 0| ? ONIG_OPTIMIZE_EXACT_BM_IC : ONIG_OPTIMIZE_EXACT_BM_NOT_REV_IC); ------------------ | | 355| 0|#define ONIG_OPTIMIZE_EXACT_BM_IC 6 /* BM (ignore case) */ ------------------ ? ONIG_OPTIMIZE_EXACT_BM_IC : ONIG_OPTIMIZE_EXACT_BM_NOT_REV_IC); ------------------ | | 356| 0|#define ONIG_OPTIMIZE_EXACT_BM_NOT_REV_IC 7 /* BM (applied to a multibyte string) (ignore case) */ ------------------ 5242| 0| } 5243| 0| else if (e->len > 0) { ------------------ | Branch (5243:16): [True: 0, False: 0] ------------------ 5244| 0| reg->optimize = ONIG_OPTIMIZE_EXACT_IC; ------------------ | | 353| 0|#define ONIG_OPTIMIZE_EXACT_IC 4 /* Slow Search (ignore case) */ ------------------ 5245| 0| } 5246| 0| else 5247| 0| return 0; 5248| 0| } 5249| 0| else { 5250| 0| reg->optimize = ONIG_OPTIMIZE_EXACT_IC; ------------------ | | 353| 0|#define ONIG_OPTIMIZE_EXACT_IC 4 /* Slow Search (ignore case) */ ------------------ 5251| 0| } 5252| 0| } 5253| 14.8k| else { 5254| 14.8k| if (e->len >= 3 || (e->len >= 2 && allow_reverse)) { ------------------ | Branch (5254:9): [True: 10.7k, False: 4.04k] | Branch (5254:25): [True: 0, False: 4.04k] | Branch (5254:40): [True: 0, False: 0] ------------------ 5255| 10.7k| set_bm_skip(reg->exact, reg->exact_end, reg, 5256| 10.7k| reg->map, 0); 5257| 10.7k| reg->optimize = (allow_reverse != 0 ------------------ | Branch (5257:24): [True: 10.7k, False: 0] ------------------ 5258| 10.7k| ? ONIG_OPTIMIZE_EXACT_BM : ONIG_OPTIMIZE_EXACT_BM_NOT_REV); ------------------ | | 351| 10.7k|#define ONIG_OPTIMIZE_EXACT_BM 2 /* Boyer Moore Search */ ------------------ ? ONIG_OPTIMIZE_EXACT_BM : ONIG_OPTIMIZE_EXACT_BM_NOT_REV); ------------------ | | 352| 0|#define ONIG_OPTIMIZE_EXACT_BM_NOT_REV 3 /* BM (applied to a multibyte string) */ ------------------ 5259| 10.7k| } 5260| 4.04k| else { 5261| 4.04k| reg->optimize = ONIG_OPTIMIZE_EXACT; ------------------ | | 350| 4.04k|#define ONIG_OPTIMIZE_EXACT 1 /* Slow Search */ ------------------ 5262| 4.04k| } 5263| 14.8k| } 5264| | 5265| 14.8k| reg->dmin = e->mmd.min; 5266| 14.8k| reg->dmax = e->mmd.max; 5267| | 5268| 14.8k| if (reg->dmin != ONIG_INFINITE_DISTANCE) { ------------------ | | 85| 14.8k|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ | Branch (5268:7): [True: 14.8k, False: 0] ------------------ 5269| 14.8k| reg->threshold_len = (int )(reg->dmin + (reg->exact_end - reg->exact)); 5270| 14.8k| } 5271| | 5272| 14.8k| return 0; 5273| 14.8k|} regcomp.c:set_bm_skip: 4189| 10.7k|{ 4190| 10.7k| OnigDistance i, len; 4191| 10.7k| int clen, flen, n, j, k; 4192| 10.7k| UChar *p, buf[ONIGENC_MBC_CASE_FOLD_MAXLEN]; ------------------ | | 76| 10.7k|# define UChar OnigUChar ------------------ 4193| 10.7k| OnigCaseFoldCodeItem items[ONIGENC_GET_CASE_FOLD_CODES_MAX_NUM]; 4194| 10.7k| OnigEncoding enc = reg->enc; 4195| | 4196| 10.7k| len = end - s; 4197| 10.7k| if (len >= ONIG_CHAR_TABLE_SIZE) { ------------------ | | 753| 10.7k|#define ONIG_CHAR_TABLE_SIZE 256 ------------------ | Branch (4197:7): [True: 0, False: 10.7k] ------------------ 4198| | /* This should not happen. */ 4199| 0| return ONIGERR_TYPE_BUG; ------------------ | | 630| 0|#define ONIGERR_TYPE_BUG -6 ------------------ 4200| 0| } 4201| | 4202| 10.7k| if (ignore_case) { ------------------ | Branch (4202:7): [True: 0, False: 10.7k] ------------------ 4203| 0| for (i = 0; i < len; i += clen) { ------------------ | Branch (4203:17): [True: 0, False: 0] ------------------ 4204| 0| p = s + i; 4205| 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) ------------------ 4206| 0| p, end, items); 4207| 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)) | | ------------------ | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 0] | | ------------------ ------------------ 4208| 0| if (p + clen > end) ------------------ | Branch (4208:11): [True: 0, False: 0] ------------------ 4209| 0| clen = (int )(end - p); 4210| | 4211| 0| for (j = 0; j < n; j++) { ------------------ | Branch (4211:19): [True: 0, False: 0] ------------------ 4212| 0| if ((items[j].code_len != 1) || (items[j].byte_len != clen)) { ------------------ | Branch (4212:6): [True: 0, False: 0] | Branch (4212:34): [True: 0, False: 0] ------------------ 4213| | /* Different length isn't supported. Stop optimization at here. */ 4214| 0| end = p; 4215| 0| goto endcheck; 4216| 0| } 4217| 0| flen = ONIGENC_CODE_TO_MBC(enc, items[j].code[0], buf); ------------------ | | 368| 0|#define ONIGENC_CODE_TO_MBC(enc,code,buf) (enc)->code_to_mbc(code,buf,enc) ------------------ 4218| 0| if (flen != clen) { ------------------ | Branch (4218:6): [True: 0, False: 0] ------------------ 4219| | /* Different length isn't supported. Stop optimization at here. */ 4220| 0| end = p; 4221| 0| goto endcheck; 4222| 0| } 4223| 0| } 4224| 0| } 4225| 0|endcheck: 4226| 0| len = end - s; 4227| 0| } 4228| | 4229| 2.77M| for (i = 0; i < ONIG_CHAR_TABLE_SIZE; i++) ------------------ | | 753| 2.77M|#define ONIG_CHAR_TABLE_SIZE 256 ------------------ | Branch (4229:15): [True: 2.76M, False: 10.7k] ------------------ 4230| 2.76M| skip[i] = (UChar )(len + 1); 4231| 10.7k| n = 0; 4232| 167k| for (i = 0; i < len; i += clen) { ------------------ | Branch (4232:15): [True: 156k, False: 10.7k] ------------------ 4233| 156k| p = s + i; 4234| 156k| if (ignore_case) ------------------ | Branch (4234:9): [True: 0, False: 156k] ------------------ 4235| 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) ------------------ 4236| 156k| p, end, items); 4237| 156k| clen = enclen(enc, p, end); ------------------ | | 93| 156k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 361| 156k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 156k] | | ------------------ ------------------ 4238| 156k| if (p + clen > end) ------------------ | Branch (4238:9): [True: 0, False: 156k] ------------------ 4239| 0| clen = (int )(end - p); 4240| | 4241| 312k| for (j = 0; j < clen; j++) { ------------------ | Branch (4241:17): [True: 156k, False: 156k] ------------------ 4242| 156k| skip[s[i + j]] = (UChar )(len - i - j); 4243| 156k| for (k = 0; k < n; k++) { ------------------ | Branch (4243:19): [True: 0, False: 156k] ------------------ 4244| 0| ONIGENC_CODE_TO_MBC(enc, items[k].code[0], buf); ------------------ | | 368| 0|#define ONIGENC_CODE_TO_MBC(enc,code,buf) (enc)->code_to_mbc(code,buf,enc) ------------------ 4245| 0| skip[buf[j]] = (UChar )(len - i - j); 4246| 0| } 4247| 156k| } 4248| 156k| } 4249| | 4250| 10.7k| return (int )len; 4251| 10.7k|} regcomp.c:set_sub_anchor: 5294| 25.6k|{ 5295| 25.6k| reg->sub_anchor |= anc->left_anchor & ANCHOR_BEGIN_LINE; ------------------ | | 535| 25.6k|#define ANCHOR_BEGIN_LINE (1<<1) ------------------ 5296| 25.6k| reg->sub_anchor |= anc->right_anchor & ANCHOR_END_LINE; ------------------ | | 539| 25.6k|#define ANCHOR_END_LINE (1<<5) ------------------ 5297| 25.6k|} regcomp.c:set_optimize_map_info: 5277| 10.7k|{ 5278| 10.7k| int i; 5279| | 5280| 2.77M| for (i = 0; i < ONIG_CHAR_TABLE_SIZE; i++) ------------------ | | 753| 2.77M|#define ONIG_CHAR_TABLE_SIZE 256 ------------------ | Branch (5280:15): [True: 2.76M, False: 10.7k] ------------------ 5281| 2.76M| reg->map[i] = m->map[i]; 5282| | 5283| 10.7k| reg->optimize = ONIG_OPTIMIZE_MAP; ------------------ | | 354| 10.7k|#define ONIG_OPTIMIZE_MAP 5 /* char map */ ------------------ 5284| 10.7k| reg->dmin = m->mmd.min; 5285| 10.7k| reg->dmax = m->mmd.max; 5286| | 5287| 10.7k| if (reg->dmin != ONIG_INFINITE_DISTANCE) { ------------------ | | 85| 10.7k|#define ONIG_INFINITE_DISTANCE ~((OnigDistance )0) ------------------ | Branch (5287:7): [True: 10.7k, False: 0] ------------------ 5288| 10.7k| reg->threshold_len = (int )(reg->dmin + 1); 5289| 10.7k| } 5290| 10.7k|} regcomp.c:compile_tree: 1688| 249k|{ 1689| 249k| int n, type, len, pos, r = 0; 1690| | 1691| 249k| type = NTYPE(node); ------------------ | | 69| 249k|#define NTYPE(node) ((node)->u.base.type) ------------------ 1692| 249k| switch (type) { 1693| 32.3k| case NT_LIST: ------------------ | | 46| 32.3k|#define NT_LIST 8 ------------------ | Branch (1693:3): [True: 32.3k, False: 217k] ------------------ 1694| 133k| do { 1695| 133k| r = compile_tree(NCAR(node), reg); ------------------ | | 86| 133k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 133k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1696| 133k| } while (r == 0 && IS_NOT_NULL(node = NCDR(node))); ------------------ | | 306| 133k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 101k, False: 32.3k] | | ------------------ ------------------ | Branch (1696:14): [True: 133k, False: 0] ------------------ 1697| 32.3k| break; 1698| | 1699| 8.08k| case NT_ALT: ------------------ | | 47| 8.08k|#define NT_ALT 9 ------------------ | Branch (1699:3): [True: 8.08k, False: 241k] ------------------ 1700| 8.08k| { 1701| 8.08k| Node* x = node; 1702| 8.08k| len = 0; 1703| 18.8k| do { 1704| 18.8k| len += compile_length_tree(NCAR(x), reg); ------------------ | | 86| 18.8k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 18.8k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1705| 18.8k| if (NCDR(x) != NULL) { ------------------ | | 87| 18.8k|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 18.8k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ | Branch (1705:6): [True: 10.7k, False: 8.08k] ------------------ 1706| 10.7k| len += SIZE_OP_PUSH + SIZE_OP_JUMP; ------------------ | | 715| 10.7k|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 10.7k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 10.7k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ len += SIZE_OP_PUSH + SIZE_OP_JUMP; ------------------ | | 714| 10.7k|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 10.7k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 10.7k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1707| 10.7k| } 1708| 18.8k| } while (IS_NOT_NULL(x = NCDR(x))); ------------------ | | 306| 18.8k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 10.7k, False: 8.08k] | | ------------------ ------------------ 1709| 8.08k| pos = reg->used + len; /* goal position */ 1710| | 1711| 18.8k| do { 1712| 18.8k| len = compile_length_tree(NCAR(node), reg); ------------------ | | 86| 18.8k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 18.8k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1713| 18.8k| if (IS_NOT_NULL(NCDR(node))) { ------------------ | | 306| 18.8k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 10.7k, False: 8.08k] | | ------------------ ------------------ 1714| 10.7k| r = add_opcode_rel_addr(reg, OP_PUSH, len + SIZE_OP_JUMP); ------------------ | | 714| 10.7k|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 10.7k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 10.7k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1715| 10.7k| if (r) break; ------------------ | Branch (1715:8): [True: 0, False: 10.7k] ------------------ 1716| 10.7k| } 1717| 18.8k| r = compile_tree(NCAR(node), reg); ------------------ | | 86| 18.8k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 18.8k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1718| 18.8k| if (r) break; ------------------ | Branch (1718:6): [True: 0, False: 18.8k] ------------------ 1719| 18.8k| if (IS_NOT_NULL(NCDR(node))) { ------------------ | | 306| 18.8k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 10.7k, False: 8.08k] | | ------------------ ------------------ 1720| 10.7k| len = pos - (reg->used + SIZE_OP_JUMP); ------------------ | | 714| 10.7k|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 10.7k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 10.7k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1721| 10.7k| r = add_opcode_rel_addr(reg, OP_JUMP, len); 1722| 10.7k| if (r) break; ------------------ | Branch (1722:8): [True: 0, False: 10.7k] ------------------ 1723| 10.7k| } 1724| 18.8k| } while (IS_NOT_NULL(node = NCDR(node))); ------------------ | | 306| 18.8k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 10.7k, False: 8.08k] | | ------------------ ------------------ 1725| 8.08k| } 1726| 0| break; 1727| | 1728| 57.9k| case NT_STR: ------------------ | | 38| 57.9k|#define NT_STR 0 ------------------ | Branch (1728:3): [True: 57.9k, False: 191k] ------------------ 1729| 57.9k| if (NSTRING_IS_RAW(node)) ------------------ | | 114| 57.9k|#define NSTRING_IS_RAW(node) (((node)->u.str.flag & NSTR_RAW) != 0) | | ------------------ | | | | 104| 57.9k|#define NSTR_RAW (1<<0) /* by backslashed number */ | | ------------------ | | | Branch (114:39): [True: 0, False: 57.9k] | | ------------------ ------------------ 1730| 0| r = compile_string_raw_node(NSTR(node), reg); ------------------ | | 76| 0|#define NSTR(node) (&((node)->u.str)) ------------------ 1731| 57.9k| else 1732| 57.9k| r = compile_string_node(node, reg); 1733| 57.9k| break; 1734| | 1735| 53.9k| case NT_CCLASS: ------------------ | | 39| 53.9k|#define NT_CCLASS 1 ------------------ | Branch (1735:3): [True: 53.9k, False: 195k] ------------------ 1736| 53.9k| r = compile_cclass_node(NCCLASS(node), reg); ------------------ | | 77| 53.9k|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 1737| 53.9k| break; 1738| | 1739| 0| case NT_CTYPE: ------------------ | | 40| 0|#define NT_CTYPE 2 ------------------ | Branch (1739:3): [True: 0, False: 249k] ------------------ 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; ------------------ | | 630| 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| 9.43k| case NT_CANY: ------------------ | | 41| 9.43k|#define NT_CANY 3 ------------------ | Branch (1762:3): [True: 9.43k, False: 239k] ------------------ 1763| 9.43k| if (IS_MULTILINE(reg->options)) ------------------ | | 389| 9.43k|#define IS_MULTILINE(option) ((option) & ONIG_OPTION_MULTILINE) | | ------------------ | | | | 453| 9.43k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | ------------------ | | | | | | 452| 9.43k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | ------------------ | | | | | | | | 451| 9.43k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (389:35): [True: 0, False: 9.43k] | | ------------------ ------------------ 1764| 0| r = add_opcode(reg, OP_ANYCHAR_ML); 1765| 9.43k| else 1766| 9.43k| r = add_opcode(reg, OP_ANYCHAR); 1767| 9.43k| break; 1768| | 1769| 0| case NT_BREF: ------------------ | | 42| 0|#define NT_BREF 4 ------------------ | Branch (1769:3): [True: 0, False: 249k] ------------------ 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)); ------------------ | | 451| 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)) { ------------------ | | 390| 0|#define IS_IGNORECASE(option) ((option) & ONIG_OPTION_IGNORECASE) | | ------------------ | | | | 451| 0|#define ONIG_OPTION_IGNORECASE 1U | | ------------------ | | | Branch (390: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)) { ------------------ | | 390| 0|#define IS_IGNORECASE(option) ((option) & ONIG_OPTION_IGNORECASE) | | ------------------ | | | | 451| 0|#define ONIG_OPTION_IGNORECASE 1U | | ------------------ | | | Branch (390: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); | | ------------------ | | | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | | | ------------------ | | | | | Branch (306: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: 249k] ------------------ 1833| 0| r = compile_call(NCALL(node), reg); ------------------ | | 84| 0|#define NCALL(node) (&((node)->u.call)) ------------------ 1834| 0| break; 1835| 0|#endif 1836| | 1837| 22.9k| case NT_QTFR: ------------------ | | 43| 22.9k|#define NT_QTFR 5 ------------------ | Branch (1837:3): [True: 22.9k, False: 226k] ------------------ 1838| 22.9k| r = compile_quantifier_node(NQTFR(node), reg); ------------------ | | 80| 22.9k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1839| 22.9k| break; 1840| | 1841| 25.6k| case NT_ENCLOSE: ------------------ | | 44| 25.6k|#define NT_ENCLOSE 6 ------------------ | Branch (1841:3): [True: 25.6k, False: 223k] ------------------ 1842| 25.6k| r = compile_enclose_node(NENCLOSE(node), reg); ------------------ | | 81| 25.6k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1843| 25.6k| break; 1844| | 1845| 39.0k| case NT_ANCHOR: ------------------ | | 45| 39.0k|#define NT_ANCHOR 7 ------------------ | Branch (1845:3): [True: 39.0k, False: 210k] ------------------ 1846| 39.0k| r = compile_anchor_node(NANCHOR(node), reg); ------------------ | | 82| 39.0k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 1847| 39.0k| break; 1848| | 1849| 0| default: ------------------ | Branch (1849:3): [True: 0, False: 249k] ------------------ 1850| |#ifdef ONIG_DEBUG 1851| | fprintf(stderr, "compile_tree: undefined node type %d\n", NTYPE(node)); 1852| |#endif 1853| 0| break; 1854| 249k| } 1855| | 1856| 249k| return r; 1857| 249k|} regcomp.c:compile_length_tree: 1593| 132k|{ 1594| 132k| int len, type, r; 1595| | 1596| 132k| type = NTYPE(node); ------------------ | | 69| 132k|#define NTYPE(node) ((node)->u.base.type) ------------------ 1597| 132k| switch (type) { 1598| 10.7k| case NT_LIST: ------------------ | | 46| 10.7k|#define NT_LIST 8 ------------------ | Branch (1598:3): [True: 10.7k, False: 121k] ------------------ 1599| 10.7k| len = 0; 1600| 26.9k| do { 1601| 26.9k| r = compile_length_tree(NCAR(node), reg); ------------------ | | 86| 26.9k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 26.9k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1602| 26.9k| if (r < 0) return r; ------------------ | Branch (1602:11): [True: 0, False: 26.9k] ------------------ 1603| 26.9k| len += r; 1604| 26.9k| } while (IS_NOT_NULL(node = NCDR(node))); ------------------ | | 306| 26.9k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 16.1k, False: 10.7k] | | ------------------ ------------------ 1605| 10.7k| r = len; 1606| 10.7k| break; 1607| | 1608| 0| case NT_ALT: ------------------ | | 47| 0|#define NT_ALT 9 ------------------ | Branch (1608:3): [True: 0, False: 132k] ------------------ 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))); ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 0] | | ------------------ ------------------ 1618| 0| r = len; 1619| 0| r += (SIZE_OP_PUSH + SIZE_OP_JUMP) * (n - 1); ------------------ | | 715| 0|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ r += (SIZE_OP_PUSH + SIZE_OP_JUMP) * (n - 1); ------------------ | | 714| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1620| 0| } 1621| 0| break; 1622| | 1623| 44.4k| case NT_STR: ------------------ | | 38| 44.4k|#define NT_STR 0 ------------------ | Branch (1623:3): [True: 44.4k, False: 87.6k] ------------------ 1624| 44.4k| if (NSTRING_IS_RAW(node)) ------------------ | | 114| 44.4k|#define NSTRING_IS_RAW(node) (((node)->u.str.flag & NSTR_RAW) != 0) | | ------------------ | | | | 104| 44.4k|#define NSTR_RAW (1<<0) /* by backslashed number */ | | ------------------ | | | Branch (114:39): [True: 0, False: 44.4k] | | ------------------ ------------------ 1625| 0| r = compile_length_string_raw_node(NSTR(node), reg); ------------------ | | 76| 0|#define NSTR(node) (&((node)->u.str)) ------------------ 1626| 44.4k| else 1627| 44.4k| r = compile_length_string_node(node, reg); 1628| 44.4k| break; 1629| | 1630| 44.4k| case NT_CCLASS: ------------------ | | 39| 44.4k|#define NT_CCLASS 1 ------------------ | Branch (1630:3): [True: 44.4k, False: 87.6k] ------------------ 1631| 44.4k| r = compile_length_cclass_node(NCCLASS(node), reg); ------------------ | | 77| 44.4k|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 1632| 44.4k| break; 1633| | 1634| 0| case NT_CTYPE: ------------------ | | 40| 0|#define NT_CTYPE 2 ------------------ | Branch (1634:3): [True: 0, False: 132k] ------------------ 1635| 8.08k| case NT_CANY: ------------------ | | 41| 8.08k|#define NT_CANY 3 ------------------ | Branch (1635:3): [True: 8.08k, False: 124k] ------------------ 1636| 8.08k| r = SIZE_OPCODE; ------------------ | | 682| 8.08k|#define SIZE_OPCODE 1 ------------------ 1637| 8.08k| break; 1638| | 1639| 0| case NT_BREF: ------------------ | | 42| 0|#define NT_BREF 4 ------------------ | Branch (1639:3): [True: 0, False: 132k] ------------------ 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 + ------------------ | | 682| 0|#define SIZE_OPCODE 1 ------------------ r = SIZE_OPCODE + SIZE_OPTION + SIZE_LENGTH + ------------------ | | 689| 0|#define SIZE_OPTION (int )sizeof(OnigOptionType) ------------------ r = SIZE_OPCODE + SIZE_OPTION + SIZE_LENGTH + ------------------ | | 685| 0|#define SIZE_LENGTH (int )sizeof(LengthType) ------------------ 1646| 0| SIZE_LENGTH + (SIZE_MEMNUM * br->back_num); ------------------ | | 685| 0|#define SIZE_LENGTH (int )sizeof(LengthType) ------------------ SIZE_LENGTH + (SIZE_MEMNUM * br->back_num); ------------------ | | 686| 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) ------------------ | | 390| 0|#define IS_IGNORECASE(option) ((option) & ONIG_OPTION_IGNORECASE) | | ------------------ | | | | 451| 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)); ------------------ | | 682| 0|#define SIZE_OPCODE 1 ------------------ ? SIZE_OPCODE : (SIZE_OPCODE + SIZE_MEMNUM)); ------------------ | | 682| 0|#define SIZE_OPCODE 1 ------------------ ? SIZE_OPCODE : (SIZE_OPCODE + SIZE_MEMNUM)); ------------------ | | 686| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) ------------------ 1653| 0| } 1654| 0| else { 1655| 0| r = SIZE_OPCODE + SIZE_LENGTH + (SIZE_MEMNUM * br->back_num); ------------------ | | 682| 0|#define SIZE_OPCODE 1 ------------------ r = SIZE_OPCODE + SIZE_LENGTH + (SIZE_MEMNUM * br->back_num); ------------------ | | 685| 0|#define SIZE_LENGTH (int )sizeof(LengthType) ------------------ r = SIZE_OPCODE + SIZE_LENGTH + (SIZE_MEMNUM * br->back_num); ------------------ | | 686| 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: 132k] ------------------ 1662| 0| r = SIZE_OP_CALL; ------------------ | | 741| 0|#define SIZE_OP_CALL (SIZE_OPCODE + SIZE_ABSADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_CALL (SIZE_OPCODE + SIZE_ABSADDR) | | ------------------ | | | | 684| 0|#define SIZE_ABSADDR (int )sizeof(AbsAddrType) | | ------------------ ------------------ 1663| 0| break; 1664| 0|#endif 1665| | 1666| 10.7k| case NT_QTFR: ------------------ | | 43| 10.7k|#define NT_QTFR 5 ------------------ | Branch (1666:3): [True: 10.7k, False: 121k] ------------------ 1667| 10.7k| r = compile_length_quantifier_node(NQTFR(node), reg); ------------------ | | 80| 10.7k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1668| 10.7k| break; 1669| | 1670| 8.08k| case NT_ENCLOSE: ------------------ | | 44| 8.08k|#define NT_ENCLOSE 6 ------------------ | Branch (1670:3): [True: 8.08k, False: 124k] ------------------ 1671| 8.08k| r = compile_length_enclose_node(NENCLOSE(node), reg); ------------------ | | 81| 8.08k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1672| 8.08k| break; 1673| | 1674| 5.39k| case NT_ANCHOR: ------------------ | | 45| 5.39k|#define NT_ANCHOR 7 ------------------ | Branch (1674:3): [True: 5.39k, False: 126k] ------------------ 1675| 5.39k| r = compile_length_anchor_node(NANCHOR(node), reg); ------------------ | | 82| 5.39k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 1676| 5.39k| break; 1677| | 1678| 0| default: ------------------ | Branch (1678:3): [True: 0, False: 132k] ------------------ 1679| 0| return ONIGERR_TYPE_BUG; ------------------ | | 630| 0|#define ONIGERR_TYPE_BUG -6 ------------------ 1680| 0| break; 1681| 132k| } 1682| | 1683| 132k| return r; 1684| 132k|} regcomp.c:add_compile_string_length: 427| 44.4k|{ 428| 44.4k| int len; 429| 44.4k| int op = select_str_opcode(mb_len, byte_len, ignore_case); 430| | 431| 44.4k| len = SIZE_OPCODE; ------------------ | | 682| 44.4k|#define SIZE_OPCODE 1 ------------------ 432| | 433| 44.4k| if (op == OP_EXACTMBN) len += SIZE_LENGTH; ------------------ | | 685| 0|#define SIZE_LENGTH (int )sizeof(LengthType) ------------------ | Branch (433:7): [True: 0, False: 44.4k] ------------------ 434| 44.4k| if (IS_NEED_STR_LEN_OP_EXACT(op)) ------------------ | | 316| 44.4k| ((op) == OP_EXACTN || (op) == OP_EXACTMB2N ||\ | | ------------------ | | | Branch (316:5): [True: 24.2k, False: 20.2k] | | | Branch (316:29): [True: 0, False: 20.2k] | | ------------------ | | 317| 44.4k| (op) == OP_EXACTMB3N || (op) == OP_EXACTMBN || (op) == OP_EXACTN_IC) | | ------------------ | | | Branch (317:5): [True: 0, False: 20.2k] | | | Branch (317:29): [True: 0, False: 20.2k] | | | Branch (317:53): [True: 0, False: 20.2k] | | ------------------ ------------------ 435| 24.2k| len += SIZE_LENGTH; ------------------ | | 685| 24.2k|#define SIZE_LENGTH (int )sizeof(LengthType) ------------------ 436| | 437| 44.4k| len += (int )byte_len; 438| 44.4k| return len; 439| 44.4k|} regcomp.c:select_str_opcode: 321| 101k|{ 322| 101k| int op; 323| 101k| OnigDistance str_len = (byte_len + mb_len - 1) / mb_len; 324| | 325| 101k| if (ignore_case) { ------------------ | Branch (325:7): [True: 0, False: 101k] ------------------ 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| 101k| else { 332| 101k| switch (mb_len) { 333| 101k| case 1: ------------------ | Branch (333:5): [True: 101k, False: 0] ------------------ 334| 101k| switch (str_len) { 335| 32.3k| case 1: op = OP_EXACT1; break; ------------------ | Branch (335:7): [True: 32.3k, False: 68.7k] ------------------ 336| 2.69k| case 2: op = OP_EXACT2; break; ------------------ | Branch (336:7): [True: 2.69k, False: 98.4k] ------------------ 337| 4.04k| case 3: op = OP_EXACT3; break; ------------------ | Branch (337:7): [True: 4.04k, False: 97.0k] ------------------ 338| 5.39k| case 4: op = OP_EXACT4; break; ------------------ | Branch (338:7): [True: 5.39k, False: 95.7k] ------------------ 339| 8.08k| case 5: op = OP_EXACT5; break; ------------------ | Branch (339:7): [True: 8.08k, False: 93.0k] ------------------ 340| 48.5k| default: op = OP_EXACTN; break; ------------------ | Branch (340:7): [True: 48.5k, False: 52.5k] ------------------ 341| 101k| } 342| 101k| break; 343| | 344| 101k| case 2: ------------------ | Branch (344:5): [True: 0, False: 101k] ------------------ 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: 101k] ------------------ 354| 0| op = OP_EXACTMB3N; 355| 0| break; 356| | 357| 0| default: ------------------ | Branch (357:5): [True: 0, False: 101k] ------------------ 358| 0| op = OP_EXACTMBN; 359| 0| break; 360| 101k| } 361| 101k| } 362| 101k| return op; 363| 101k|} regcomp.c:compile_length_string_node: 465| 44.4k|{ 466| 44.4k| int rlen, r, len, prev_len, blen, ambig; 467| 44.4k| OnigEncoding enc = reg->enc; 468| 44.4k| UChar *p, *prev; ------------------ | | 76| 44.4k|# define UChar OnigUChar ------------------ 469| 44.4k| StrNode* sn; 470| | 471| 44.4k| sn = NSTR(node); ------------------ | | 76| 44.4k|#define NSTR(node) (&((node)->u.str)) ------------------ 472| 44.4k| if (sn->end <= sn->s) ------------------ | Branch (472:7): [True: 0, False: 44.4k] ------------------ 473| 0| return 0; 474| | 475| 44.4k| ambig = NSTRING_IS_AMBIG(node); ------------------ | | 115| 44.4k|#define NSTRING_IS_AMBIG(node) (((node)->u.str.flag & NSTR_AMBIG) != 0) | | ------------------ | | | | 105| 44.4k|#define NSTR_AMBIG (1<<1) | | ------------------ ------------------ 476| | 477| 44.4k| p = prev = sn->s; 478| 44.4k| prev_len = enclen(enc, p, sn->end); ------------------ | | 93| 44.4k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 361| 44.4k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 44.4k] | | ------------------ ------------------ 479| 44.4k| p += prev_len; 480| 44.4k| blen = prev_len; 481| 44.4k| rlen = 0; 482| | 483| 319k| for (; p < sn->end; ) { ------------------ | Branch (483:10): [True: 274k, False: 44.4k] ------------------ 484| 274k| len = enclen(enc, p, sn->end); ------------------ | | 93| 274k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 361| 274k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 274k] | | ------------------ ------------------ 485| 274k| if (len == prev_len || ambig) { ------------------ | Branch (485:9): [True: 274k, False: 0] | Branch (485:28): [True: 0, False: 0] ------------------ 486| 274k| blen += len; 487| 274k| } 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| 274k| p += len; 496| 274k| } 497| 44.4k| r = add_compile_string_length(prev, prev_len, blen, reg, ambig); 498| 44.4k| rlen += r; 499| 44.4k| return rlen; 500| 44.4k|} regcomp.c:compile_length_cclass_node: 587| 44.4k|{ 588| 44.4k| int len; 589| | 590| 44.4k| if (IS_NULL(cc->mbuf)) { ------------------ | | 305| 44.4k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 44.4k, False: 0] | | ------------------ ------------------ 591| 44.4k| len = SIZE_OPCODE + SIZE_BITSET; ------------------ | | 682| 44.4k|#define SIZE_OPCODE 1 ------------------ len = SIZE_OPCODE + SIZE_BITSET; ------------------ | | 432| 44.4k|#define SIZE_BITSET (int )sizeof(BitSet) ------------------ 592| 44.4k| } 593| 0| else { 594| 0| if (ONIGENC_MBC_MINLEN(reg->enc) > 1 || bitset_is_empty(cc->bs)) { ------------------ | | 364| 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; ------------------ | | 682| 0|#define SIZE_OPCODE 1 ------------------ 596| 0| } 597| 0| else { 598| 0| len = SIZE_OPCODE + SIZE_BITSET; ------------------ | | 682| 0|#define SIZE_OPCODE 1 ------------------ len = SIZE_OPCODE + SIZE_BITSET; ------------------ | | 432| 0|#define SIZE_BITSET (int )sizeof(BitSet) ------------------ 599| 0| } 600| 0|#ifdef PLATFORM_UNALIGNED_WORD_ACCESS 601| 0| len += SIZE_LENGTH + cc->mbuf->used; ------------------ | | 685| 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| 44.4k| return len; 608| 44.4k|} regcomp.c:compile_length_quantifier_node: 965| 10.7k|{ 966| 10.7k| int len, mod_tlen; 967| 10.7k| int infinite = IS_REPEAT_INFINITE(qn->upper); ------------------ | | 416| 10.7k|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 415| 10.7k|#define REPEAT_INFINITE -1 | | ------------------ ------------------ 968| 10.7k| int empty_info = qn->target_empty_info; 969| 10.7k| int tlen = compile_length_tree(qn->target, reg); 970| | 971| 10.7k| if (tlen < 0) return tlen; ------------------ | Branch (971:7): [True: 0, False: 10.7k] ------------------ 972| | 973| | /* anychar repeat */ 974| 10.7k| if (NTYPE(qn->target) == NT_CANY) { ------------------ | | 69| 10.7k|#define NTYPE(node) ((node)->u.base.type) ------------------ if (NTYPE(qn->target) == NT_CANY) { ------------------ | | 41| 10.7k|#define NT_CANY 3 ------------------ | Branch (974:7): [True: 0, False: 10.7k] ------------------ 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)) ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 0] | | ------------------ ------------------ 977| 0| return SIZE_OP_ANYCHAR_STAR_PEEK_NEXT + tlen * qn->lower; ------------------ | | 713| 0|#define SIZE_OP_ANYCHAR_STAR_PEEK_NEXT (SIZE_OPCODE + 1) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ 978| 0| else 979| 0| return SIZE_OP_ANYCHAR_STAR + tlen * qn->lower; ------------------ | | 712| 0|#define SIZE_OP_ANYCHAR_STAR SIZE_OPCODE | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ 980| 0| } 981| 0| } 982| | 983| 10.7k| if (empty_info != 0) ------------------ | Branch (983:7): [True: 0, False: 10.7k] ------------------ 984| 0| mod_tlen = tlen + (SIZE_OP_NULL_CHECK_START + SIZE_OP_NULL_CHECK_END); ------------------ | | 736| 0|#define SIZE_OP_NULL_CHECK_START (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_NULL_CHECK_START (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ mod_tlen = tlen + (SIZE_OP_NULL_CHECK_START + SIZE_OP_NULL_CHECK_END); ------------------ | | 737| 0|#define SIZE_OP_NULL_CHECK_END (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_NULL_CHECK_END (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ 985| 10.7k| else 986| 10.7k| mod_tlen = tlen; 987| | 988| 10.7k| if (infinite && ------------------ | Branch (988:7): [True: 10.7k, False: 0] ------------------ 989| 10.7k| (qn->lower <= 1 || tlen * qn->lower <= QUANTIFIER_EXPAND_LIMIT_SIZE)) { ------------------ | | 724| 0|#define QUANTIFIER_EXPAND_LIMIT_SIZE 50 ------------------ | Branch (989:8): [True: 10.7k, False: 0] | Branch (989:26): [True: 0, False: 0] ------------------ 990| 10.7k| if (qn->lower == 1 && tlen > QUANTIFIER_EXPAND_LIMIT_SIZE) { ------------------ | | 724| 8.08k|#define QUANTIFIER_EXPAND_LIMIT_SIZE 50 ------------------ | Branch (990:9): [True: 8.08k, False: 2.69k] | Branch (990:27): [True: 0, False: 8.08k] ------------------ 991| 0| len = SIZE_OP_JUMP; ------------------ | | 714| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 992| 0| } 993| 10.7k| else { 994| 10.7k| len = tlen * qn->lower; 995| 10.7k| } 996| | 997| 10.7k| if (qn->greedy) { ------------------ | Branch (997:9): [True: 10.7k, 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| 10.7k| if (IS_NOT_NULL(qn->next_head_exact)) ------------------ | | 306| 10.7k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 8.08k, False: 2.69k] | | ------------------ ------------------ 1004| 8.08k| len += SIZE_OP_PUSH_IF_PEEK_NEXT + mod_tlen + SIZE_OP_JUMP; ------------------ | | 718| 8.08k|#define SIZE_OP_PUSH_IF_PEEK_NEXT (SIZE_OPCODE + SIZE_RELADDR + 1) | | ------------------ | | | | 682| 8.08k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH_IF_PEEK_NEXT (SIZE_OPCODE + SIZE_RELADDR + 1) | | ------------------ | | | | 683| 8.08k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ len += SIZE_OP_PUSH_IF_PEEK_NEXT + mod_tlen + SIZE_OP_JUMP; ------------------ | | 714| 8.08k|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 8.08k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 8.08k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1005| 2.69k| else 1006| 2.69k| len += SIZE_OP_PUSH + mod_tlen + SIZE_OP_JUMP; ------------------ | | 715| 2.69k|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 2.69k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 2.69k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ len += SIZE_OP_PUSH + mod_tlen + SIZE_OP_JUMP; ------------------ | | 714| 2.69k|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 2.69k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 2.69k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1007| 10.7k| } 1008| 0| else 1009| 0| len += SIZE_OP_JUMP + mod_tlen + SIZE_OP_PUSH; ------------------ | | 714| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ len += SIZE_OP_JUMP + mod_tlen + SIZE_OP_PUSH; ------------------ | | 715| 0|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1010| 10.7k| } 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; ------------------ | | 714| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 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 ------------------ | | 715| 0|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 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); ------------------ | | 715| 0|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 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; ------------------ | | 715| 0|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ len = SIZE_OP_PUSH + SIZE_OP_JUMP + tlen; ------------------ | | 714| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1022| 0| } 1023| 0| else { 1024| 0| len = SIZE_OP_REPEAT_INC ------------------ | | 719| 0|#define SIZE_OP_REPEAT_INC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_REPEAT_INC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ 1025| 0| + mod_tlen + SIZE_OPCODE + SIZE_RELADDR + SIZE_MEMNUM; ------------------ | | 682| 0|#define SIZE_OPCODE 1 ------------------ + mod_tlen + SIZE_OPCODE + SIZE_RELADDR + SIZE_MEMNUM; ------------------ | | 683| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) ------------------ + mod_tlen + SIZE_OPCODE + SIZE_RELADDR + SIZE_MEMNUM; ------------------ | | 686| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) ------------------ 1026| 0| } 1027| | 1028| 10.7k| return len; 1029| 10.7k|} regcomp.c:compile_length_enclose_node: 1213| 8.08k|{ 1214| 8.08k| int len; 1215| 8.08k| int tlen; 1216| | 1217| 8.08k| if (node->type == ENCLOSE_OPTION) ------------------ | | 95| 8.08k|#define ENCLOSE_OPTION (1<<1) ------------------ | Branch (1217:7): [True: 0, False: 8.08k] ------------------ 1218| 0| return compile_length_option_node(node, reg); 1219| | 1220| 8.08k| if (node->target) { ------------------ | Branch (1220:7): [True: 8.08k, False: 0] ------------------ 1221| 8.08k| tlen = compile_length_tree(node->target, reg); 1222| 8.08k| if (tlen < 0) return tlen; ------------------ | Branch (1222:9): [True: 0, False: 8.08k] ------------------ 1223| 8.08k| } 1224| 0| else 1225| 0| tlen = 0; 1226| | 1227| 8.08k| switch (node->type) { 1228| 0| case ENCLOSE_MEMORY: ------------------ | | 94| 0|#define ENCLOSE_MEMORY (1<<0) ------------------ | Branch (1228:3): [True: 0, False: 8.08k] ------------------ 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 ------------------ | | 729| 0|#define SIZE_OP_MEMORY_START_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_START_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ 1232| 0| + SIZE_OP_CALL + SIZE_OP_JUMP + SIZE_OP_RETURN; ------------------ | | 741| 0|#define SIZE_OP_CALL (SIZE_OPCODE + SIZE_ABSADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_CALL (SIZE_OPCODE + SIZE_ABSADDR) | | ------------------ | | | | 684| 0|#define SIZE_ABSADDR (int )sizeof(AbsAddrType) | | ------------------ ------------------ + SIZE_OP_CALL + SIZE_OP_JUMP + SIZE_OP_RETURN; ------------------ | | 714| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ + SIZE_OP_CALL + SIZE_OP_JUMP + SIZE_OP_RETURN; ------------------ | | 742| 0|#define SIZE_OP_RETURN SIZE_OPCODE | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ 1233| 0| if (BIT_STATUS_AT(reg->bt_mem_end, node->regnum)) ------------------ | | 365| 0| ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1)) | | ------------------ | | | | 361| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (365:3): [True: 0, False: 0] | | | Branch (365: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); ------------------ | | 731| 0|#define SIZE_OP_MEMORY_END_PUSH_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END_PUSH_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ ? SIZE_OP_MEMORY_END_PUSH_REC : SIZE_OP_MEMORY_END_PUSH); ------------------ | | 730| 0|#define SIZE_OP_MEMORY_END_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 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); ------------------ | | 733| 0|#define SIZE_OP_MEMORY_END_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ ? SIZE_OP_MEMORY_END_REC : SIZE_OP_MEMORY_END); ------------------ | | 732| 0|#define SIZE_OP_MEMORY_END (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 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; ------------------ | | 729| 0|#define SIZE_OP_MEMORY_START_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_START_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ 1242| 0| len += tlen + (BIT_STATUS_AT(reg->bt_mem_end, node->regnum) ------------------ | | 365| 0| ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1)) | | ------------------ | | | | 361| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (365:3): [True: 0, False: 0] | | | Branch (365:4): [True: 0, False: 0] | | ------------------ ------------------ 1243| 0| ? SIZE_OP_MEMORY_END_PUSH_REC : SIZE_OP_MEMORY_END_REC); ------------------ | | 731| 0|#define SIZE_OP_MEMORY_END_PUSH_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END_PUSH_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ ? SIZE_OP_MEMORY_END_PUSH_REC : SIZE_OP_MEMORY_END_REC); ------------------ | | 733| 0|#define SIZE_OP_MEMORY_END_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 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)) ------------------ | | 365| 0| ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1)) | | ------------------ | | | | 361| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (365:3): [True: 0, False: 0] | | | Branch (365:4): [True: 0, False: 0] | | ------------------ ------------------ 1249| 0| len = SIZE_OP_MEMORY_START_PUSH; ------------------ | | 729| 0|#define SIZE_OP_MEMORY_START_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_START_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ 1250| 0| else 1251| 0| len = SIZE_OP_MEMORY_START; ------------------ | | 728| 0|#define SIZE_OP_MEMORY_START (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_START (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ 1252| | 1253| 0| len += tlen + (BIT_STATUS_AT(reg->bt_mem_end, node->regnum) ------------------ | | 365| 0| ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1)) | | ------------------ | | | | 361| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (365:3): [True: 0, False: 0] | | | Branch (365:4): [True: 0, False: 0] | | ------------------ ------------------ 1254| 0| ? SIZE_OP_MEMORY_END_PUSH : SIZE_OP_MEMORY_END); ------------------ | | 730| 0|#define SIZE_OP_MEMORY_END_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ ? SIZE_OP_MEMORY_END_PUSH : SIZE_OP_MEMORY_END); ------------------ | | 732| 0|#define SIZE_OP_MEMORY_END (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ 1255| 0| } 1256| 0| break; 1257| | 1258| 8.08k| case ENCLOSE_STOP_BACKTRACK: ------------------ | | 96| 8.08k|#define ENCLOSE_STOP_BACKTRACK (1<<2) ------------------ | Branch (1258:3): [True: 8.08k, False: 0] ------------------ 1259| 8.08k| if (IS_ENCLOSE_STOP_BT_SIMPLE_REPEAT(node)) { ------------------ | | 156| 8.08k| (((en)->state & NST_STOP_BT_SIMPLE_REPEAT) != 0) | | ------------------ | | | | 134| 8.08k|#define NST_STOP_BT_SIMPLE_REPEAT (1<<6) | | ------------------ | | | Branch (156:5): [True: 8.08k, False: 0] | | ------------------ ------------------ 1260| 8.08k| QtfrNode* qn = NQTFR(node->target); ------------------ | | 80| 8.08k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1261| 8.08k| tlen = compile_length_tree(qn->target, reg); 1262| 8.08k| if (tlen < 0) return tlen; ------------------ | Branch (1262:11): [True: 0, False: 8.08k] ------------------ 1263| | 1264| 8.08k| len = tlen * qn->lower 1265| 8.08k| + SIZE_OP_PUSH + tlen + SIZE_OP_POP + SIZE_OP_JUMP; ------------------ | | 715| 8.08k|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 8.08k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 8.08k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ + SIZE_OP_PUSH + tlen + SIZE_OP_POP + SIZE_OP_JUMP; ------------------ | | 716| 8.08k|#define SIZE_OP_POP SIZE_OPCODE | | ------------------ | | | | 682| 8.08k|#define SIZE_OPCODE 1 | | ------------------ ------------------ + SIZE_OP_PUSH + tlen + SIZE_OP_POP + SIZE_OP_JUMP; ------------------ | | 714| 8.08k|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 8.08k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 8.08k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1266| 8.08k| } 1267| 0| else { 1268| 0| len = SIZE_OP_PUSH_STOP_BT + tlen + SIZE_OP_POP_STOP_BT; ------------------ | | 734| 0|#define SIZE_OP_PUSH_STOP_BT SIZE_OPCODE | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ len = SIZE_OP_PUSH_STOP_BT + tlen + SIZE_OP_POP_STOP_BT; ------------------ | | 735| 0|#define SIZE_OP_POP_STOP_BT SIZE_OPCODE | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ 1269| 0| } 1270| 8.08k| break; 1271| | 1272| 8.08k| case ENCLOSE_CONDITION: ------------------ | | 97| 0|#define ENCLOSE_CONDITION (1<<3) ------------------ | Branch (1272:3): [True: 0, False: 8.08k] ------------------ 1273| 0| len = SIZE_OP_CONDITION; ------------------ | | 743| 0|#define SIZE_OP_CONDITION (SIZE_OPCODE + SIZE_MEMNUM + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_CONDITION (SIZE_OPCODE + SIZE_MEMNUM + SIZE_RELADDR) | | ------------------ | | | | 686| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ | | #define SIZE_OP_CONDITION (SIZE_OPCODE + SIZE_MEMNUM + SIZE_RELADDR) | | ------------------ | | | | 683| 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; ------------------ | | 714| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 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; ------------------ | | 631| 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; ------------------ | | 664| 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; ------------------ | | 631| 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: 8.08k] ------------------ 1293| 0| len = SIZE_OP_PUSH_ABSENT_POS + SIZE_OP_ABSENT + tlen + SIZE_OP_ABSENT_END; ------------------ | | 744| 0|#define SIZE_OP_PUSH_ABSENT_POS SIZE_OPCODE | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ len = SIZE_OP_PUSH_ABSENT_POS + SIZE_OP_ABSENT + tlen + SIZE_OP_ABSENT_END; ------------------ | | 745| 0|#define SIZE_OP_ABSENT (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_ABSENT (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ len = SIZE_OP_PUSH_ABSENT_POS + SIZE_OP_ABSENT + tlen + SIZE_OP_ABSENT_END; ------------------ | | 746| 0|#define SIZE_OP_ABSENT_END SIZE_OPCODE | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ 1294| 0| break; 1295| | 1296| 0| default: ------------------ | Branch (1296:3): [True: 0, False: 8.08k] ------------------ 1297| 0| return ONIGERR_TYPE_BUG; ------------------ | | 630| 0|#define ONIGERR_TYPE_BUG -6 ------------------ 1298| 0| break; 1299| 8.08k| } 1300| | 1301| 8.08k| return len; 1302| 8.08k|} regcomp.c:compile_length_anchor_node: 1463| 5.39k|{ 1464| 5.39k| int len; 1465| 5.39k| int tlen = 0; 1466| | 1467| 5.39k| if (node->target) { ------------------ | Branch (1467:7): [True: 0, False: 5.39k] ------------------ 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| 5.39k| switch (node->type) { 1473| 0| case ANCHOR_PREC_READ: ------------------ | | 545| 0|#define ANCHOR_PREC_READ (1<<10) ------------------ | Branch (1473:3): [True: 0, False: 5.39k] ------------------ 1474| 0| len = SIZE_OP_PUSH_POS + tlen + SIZE_OP_POP_POS; ------------------ | | 721| 0|#define SIZE_OP_PUSH_POS SIZE_OPCODE | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ len = SIZE_OP_PUSH_POS + tlen + SIZE_OP_POP_POS; ------------------ | | 723| 0|#define SIZE_OP_POP_POS SIZE_OPCODE | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ 1475| 0| break; 1476| 0| case ANCHOR_PREC_READ_NOT: ------------------ | | 546| 0|#define ANCHOR_PREC_READ_NOT (1<<11) ------------------ | Branch (1476:3): [True: 0, False: 5.39k] ------------------ 1477| 0| len = SIZE_OP_PUSH_POS_NOT + tlen + SIZE_OP_FAIL_POS; ------------------ | | 722| 0|#define SIZE_OP_PUSH_POS_NOT (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH_POS_NOT (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ len = SIZE_OP_PUSH_POS_NOT + tlen + SIZE_OP_FAIL_POS; ------------------ | | 724| 0|#define SIZE_OP_FAIL_POS SIZE_OPCODE | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ 1478| 0| break; 1479| 0| case ANCHOR_LOOK_BEHIND: ------------------ | | 547| 0|#define ANCHOR_LOOK_BEHIND (1<<12) ------------------ | Branch (1479:3): [True: 0, False: 5.39k] ------------------ 1480| 0| len = SIZE_OP_LOOK_BEHIND + tlen; ------------------ | | 738| 0|#define SIZE_OP_LOOK_BEHIND (SIZE_OPCODE + SIZE_LENGTH) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_LOOK_BEHIND (SIZE_OPCODE + SIZE_LENGTH) | | ------------------ | | | | 685| 0|#define SIZE_LENGTH (int )sizeof(LengthType) | | ------------------ ------------------ 1481| 0| break; 1482| 0| case ANCHOR_LOOK_BEHIND_NOT: ------------------ | | 548| 0|#define ANCHOR_LOOK_BEHIND_NOT (1<<13) ------------------ | Branch (1482:3): [True: 0, False: 5.39k] ------------------ 1483| 0| len = SIZE_OP_PUSH_LOOK_BEHIND_NOT + tlen + SIZE_OP_FAIL_LOOK_BEHIND_NOT; ------------------ | | 739| 0|#define SIZE_OP_PUSH_LOOK_BEHIND_NOT (SIZE_OPCODE + SIZE_RELADDR + SIZE_LENGTH) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH_LOOK_BEHIND_NOT (SIZE_OPCODE + SIZE_RELADDR + SIZE_LENGTH) | | ------------------ | | | | 683| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ | | #define SIZE_OP_PUSH_LOOK_BEHIND_NOT (SIZE_OPCODE + SIZE_RELADDR + SIZE_LENGTH) | | ------------------ | | | | 685| 0|#define SIZE_LENGTH (int )sizeof(LengthType) | | ------------------ ------------------ len = SIZE_OP_PUSH_LOOK_BEHIND_NOT + tlen + SIZE_OP_FAIL_LOOK_BEHIND_NOT; ------------------ | | 740| 0|#define SIZE_OP_FAIL_LOOK_BEHIND_NOT SIZE_OPCODE | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ 1484| 0| break; 1485| | 1486| 5.39k| default: ------------------ | Branch (1486:3): [True: 5.39k, False: 0] ------------------ 1487| 5.39k| len = SIZE_OPCODE; ------------------ | | 682| 5.39k|#define SIZE_OPCODE 1 ------------------ 1488| 5.39k| break; 1489| 5.39k| } 1490| | 1491| 5.39k| return len; 1492| 5.39k|} regcomp.c:add_opcode_rel_addr: 277| 87.6k|{ 278| 87.6k| int r; 279| | 280| 87.6k| r = add_opcode(reg, opcode); 281| 87.6k| if (r) return r; ------------------ | Branch (281:7): [True: 0, False: 87.6k] ------------------ 282| 87.6k| r = add_rel_addr(reg, addr); 283| 87.6k| return r; 284| 87.6k|} regcomp.c:add_rel_addr: 223| 87.6k|{ 224| 87.6k| RelAddrType ra = (RelAddrType )addr; 225| | 226| 87.6k| BBUF_ADD(reg, &ra, SIZE_RELADDR); ------------------ | | 498| 87.6k|#define BBUF_ADD(buf,bytes,n) BBUF_WRITE((buf),(buf)->used,(bytes),(n)) | | ------------------ | | | | 484| 87.6k|#define BBUF_WRITE(buf,pos,bytes,n) do{\ | | | | 485| 87.6k| int used = (pos) + (int )(n);\ | | | | 486| 87.6k| if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ | | | | ------------------ | | | | | | 464| 4.04k|#define BBUF_EXPAND(buf,low) do{\ | | | | | | 465| 4.04k| UChar *tmp;\ | | | | | | ------------------ | | | | | | | | 76| 4.04k|# define UChar OnigUChar | | | | | | ------------------ | | | | | | 466| 4.04k| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | | | ------------------ | | | | | | | Branch (466:36): [True: 0, False: 4.04k] | | | | | | ------------------ | | | | | | 467| 4.04k| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | | | ------------------ | | | | | | | | 143| 4.04k|# define xrealloc realloc | | | | | | ------------------ | | | | | | 468| 4.04k| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 305| 4.04k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | | | ------------------ | | | | | | | | | Branch (305:39): [True: 0, False: 4.04k] | | | | | | | | ------------------ | | | | | | ------------------ | | | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 629| 0|#define ONIGERR_MEMORY -5 | | | | | | ------------------ | | | | | | 469| 4.04k| (buf)->p = tmp;\ | | | | | | 470| 4.04k|} while (0) | | | | | | ------------------ | | | | | | | Branch (470:10): [Folded - Ignored] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (486:7): [True: 4.04k, False: 83.5k] | | | | ------------------ | | | | 487| 87.6k| xmemcpy((buf)->p + (pos), (bytes), (n));\ | | | | ------------------ | | | | | | 209| 87.6k|#define xmemcpy memcpy | | | | ------------------ | | | | 488| 87.6k| if ((buf)->used < (unsigned int )used) (buf)->used = used;\ | | | | ------------------ | | | | | Branch (488:7): [True: 87.6k, False: 0] | | | | ------------------ | | | | 489| 87.6k|} while (0) | | | | ------------------ | | | | | Branch (489:10): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 227| 87.6k| return 0; 228| 87.6k|} regcomp.c:add_compile_string: 444| 56.6k|{ 445| 56.6k| int op = select_str_opcode(mb_len, byte_len, ignore_case); 446| 56.6k| add_opcode(reg, op); 447| | 448| 56.6k| if (op == OP_EXACTMBN) ------------------ | Branch (448:7): [True: 0, False: 56.6k] ------------------ 449| 0| add_length(reg, mb_len); 450| | 451| 56.6k| if (IS_NEED_STR_LEN_OP_EXACT(op)) { ------------------ | | 316| 56.6k| ((op) == OP_EXACTN || (op) == OP_EXACTMB2N ||\ | | ------------------ | | | Branch (316:5): [True: 24.2k, False: 32.3k] | | | Branch (316:29): [True: 0, False: 32.3k] | | ------------------ | | 317| 56.6k| (op) == OP_EXACTMB3N || (op) == OP_EXACTMBN || (op) == OP_EXACTN_IC) | | ------------------ | | | Branch (317:5): [True: 0, False: 32.3k] | | | Branch (317:29): [True: 0, False: 32.3k] | | | Branch (317:53): [True: 0, False: 32.3k] | | ------------------ ------------------ 452| 24.2k| if (op == OP_EXACTN_IC) ------------------ | Branch (452:9): [True: 0, False: 24.2k] ------------------ 453| 0| add_length(reg, byte_len); 454| 24.2k| else 455| 24.2k| add_length(reg, byte_len / mb_len); 456| 24.2k| } 457| | 458| 56.6k| add_bytes(reg, s, byte_len); 459| 56.6k| return 0; 460| 56.6k|} regcomp.c:add_bytes: 288| 59.3k|{ 289| 59.3k| BBUF_ADD(reg, bytes, len); ------------------ | | 498| 59.3k|#define BBUF_ADD(buf,bytes,n) BBUF_WRITE((buf),(buf)->used,(bytes),(n)) | | ------------------ | | | | 484| 59.3k|#define BBUF_WRITE(buf,pos,bytes,n) do{\ | | | | 485| 59.3k| int used = (pos) + (int )(n);\ | | | | 486| 59.3k| if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ | | | | ------------------ | | | | | | 464| 2.69k|#define BBUF_EXPAND(buf,low) do{\ | | | | | | 465| 2.69k| UChar *tmp;\ | | | | | | ------------------ | | | | | | | | 76| 2.69k|# define UChar OnigUChar | | | | | | ------------------ | | | | | | 466| 2.69k| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | | | ------------------ | | | | | | | Branch (466:36): [True: 0, False: 2.69k] | | | | | | ------------------ | | | | | | 467| 2.69k| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | | | ------------------ | | | | | | | | 143| 2.69k|# define xrealloc realloc | | | | | | ------------------ | | | | | | 468| 2.69k| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 305| 2.69k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | | | ------------------ | | | | | | | | | Branch (305:39): [True: 0, False: 2.69k] | | | | | | | | ------------------ | | | | | | ------------------ | | | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 629| 0|#define ONIGERR_MEMORY -5 | | | | | | ------------------ | | | | | | 469| 2.69k| (buf)->p = tmp;\ | | | | | | 470| 2.69k|} while (0) | | | | | | ------------------ | | | | | | | Branch (470:10): [Folded - Ignored] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (486:7): [True: 2.69k, False: 56.6k] | | | | ------------------ | | | | 487| 59.3k| xmemcpy((buf)->p + (pos), (bytes), (n));\ | | | | ------------------ | | | | | | 209| 59.3k|#define xmemcpy memcpy | | | | ------------------ | | | | 488| 59.3k| if ((buf)->used < (unsigned int )used) (buf)->used = used;\ | | | | ------------------ | | | | | Branch (488:7): [True: 59.3k, False: 0] | | | | ------------------ | | | | 489| 59.3k|} while (0) | | | | ------------------ | | | | | Branch (489:10): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 290| 59.3k| return 0; 291| 59.3k|} regcomp.c:compile_string_node: 513| 57.9k|{ 514| 57.9k| int r, len, prev_len, blen, ambig; 515| 57.9k| OnigEncoding enc = reg->enc; 516| 57.9k| UChar *p, *prev, *end; ------------------ | | 76| 57.9k|# define UChar OnigUChar ------------------ 517| 57.9k| StrNode* sn; 518| | 519| 57.9k| sn = NSTR(node); ------------------ | | 76| 57.9k|#define NSTR(node) (&((node)->u.str)) ------------------ 520| 57.9k| if (sn->end <= sn->s) ------------------ | Branch (520:7): [True: 1.34k, False: 56.6k] ------------------ 521| 1.34k| return 0; 522| | 523| 56.6k| end = sn->end; 524| 56.6k| ambig = NSTRING_IS_AMBIG(node); ------------------ | | 115| 56.6k|#define NSTRING_IS_AMBIG(node) (((node)->u.str.flag & NSTR_AMBIG) != 0) | | ------------------ | | | | 105| 56.6k|#define NSTR_AMBIG (1<<1) | | ------------------ ------------------ 525| | 526| 56.6k| p = prev = sn->s; 527| 56.6k| prev_len = enclen(enc, p, end); ------------------ | | 93| 56.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)) | | ------------------ | | | | 361| 56.6k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 56.6k] | | ------------------ ------------------ 528| 56.6k| p += prev_len; 529| 56.6k| blen = prev_len; 530| | 531| 496k| for (; p < end; ) { ------------------ | Branch (531:10): [True: 439k, False: 56.6k] ------------------ 532| 439k| len = enclen(enc, p, end); ------------------ | | 93| 439k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 361| 439k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 439k] | | ------------------ ------------------ 533| 439k| if (len == prev_len || ambig) { ------------------ | Branch (533:9): [True: 439k, False: 0] | Branch (533:28): [True: 0, False: 0] ------------------ 534| 439k| blen += len; 535| 439k| } 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| 439k| p += len; 549| 439k| } 550| 56.6k| return add_compile_string(prev, prev_len, blen, reg, ambig); 551| 56.6k|} regcomp.c:compile_cclass_node: 612| 53.9k|{ 613| 53.9k| int r; 614| | 615| 53.9k| if (IS_NULL(cc->mbuf)) { ------------------ | | 305| 53.9k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 53.9k, False: 0] | | ------------------ ------------------ 616| 53.9k| if (IS_NCCLASS_NOT(cc)) ------------------ | | 803| 53.9k|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 796| 53.9k|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 793| 53.9k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | | | | Branch (796:37): [True: 14.8k, False: 39.0k] | | | | ------------------ | | ------------------ ------------------ 617| 14.8k| add_opcode(reg, OP_CCLASS_NOT); 618| 39.0k| else 619| 39.0k| add_opcode(reg, OP_CCLASS); 620| | 621| 53.9k| r = add_bitset(reg, cc->bs); 622| 53.9k| } 623| 0| else { 624| 0| if (ONIGENC_MBC_MINLEN(reg->enc) > 1 || bitset_is_empty(cc->bs)) { ------------------ | | 364| 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)) ------------------ | | 803| 0|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 796| 0|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 793| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | | | | Branch (796: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)) ------------------ | | 803| 0|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 796| 0|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 793| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | | | | Branch (796: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| 53.9k| return r; 645| 53.9k|} regcomp.c:add_bitset: 295| 53.9k|{ 296| 53.9k| BBUF_ADD(reg, bs, SIZE_BITSET); ------------------ | | 498| 53.9k|#define BBUF_ADD(buf,bytes,n) BBUF_WRITE((buf),(buf)->used,(bytes),(n)) | | ------------------ | | | | 484| 53.9k|#define BBUF_WRITE(buf,pos,bytes,n) do{\ | | | | 485| 53.9k| int used = (pos) + (int )(n);\ | | | | 486| 53.9k| if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ | | | | ------------------ | | | | | | 464| 21.5k|#define BBUF_EXPAND(buf,low) do{\ | | | | | | 465| 21.5k| UChar *tmp;\ | | | | | | ------------------ | | | | | | | | 76| 21.5k|# define UChar OnigUChar | | | | | | ------------------ | | | | | | 466| 26.9k| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | | | ------------------ | | | | | | | Branch (466:36): [True: 5.39k, False: 21.5k] | | | | | | ------------------ | | | | | | 467| 21.5k| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | | | ------------------ | | | | | | | | 143| 21.5k|# define xrealloc realloc | | | | | | ------------------ | | | | | | 468| 21.5k| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 305| 21.5k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | | | ------------------ | | | | | | | | | Branch (305:39): [True: 0, False: 21.5k] | | | | | | | | ------------------ | | | | | | ------------------ | | | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 629| 0|#define ONIGERR_MEMORY -5 | | | | | | ------------------ | | | | | | 469| 21.5k| (buf)->p = tmp;\ | | | | | | 470| 21.5k|} while (0) | | | | | | ------------------ | | | | | | | Branch (470:10): [Folded - Ignored] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (486:7): [True: 21.5k, False: 32.3k] | | | | ------------------ | | | | 487| 53.9k| xmemcpy((buf)->p + (pos), (bytes), (n));\ | | | | ------------------ | | | | | | 209| 53.9k|#define xmemcpy memcpy | | | | ------------------ | | | | 488| 53.9k| if ((buf)->used < (unsigned int )used) (buf)->used = used;\ | | | | ------------------ | | | | | Branch (488:7): [True: 53.9k, False: 0] | | | | ------------------ | | | | 489| 53.9k|} while (0) | | | | ------------------ | | | | | Branch (489:10): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 297| 53.9k| return 0; 298| 53.9k|} regcomp.c:add_length: 241| 24.2k|{ 242| 24.2k| LengthType l = (LengthType )len; 243| | 244| 24.2k| BBUF_ADD(reg, &l, SIZE_LENGTH); ------------------ | | 498| 24.2k|#define BBUF_ADD(buf,bytes,n) BBUF_WRITE((buf),(buf)->used,(bytes),(n)) | | ------------------ | | | | 484| 24.2k|#define BBUF_WRITE(buf,pos,bytes,n) do{\ | | | | 485| 24.2k| int used = (pos) + (int )(n);\ | | | | 486| 24.2k| if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ | | | | ------------------ | | | | | | 464| 0|#define BBUF_EXPAND(buf,low) do{\ | | | | | | 465| 0| UChar *tmp;\ | | | | | | ------------------ | | | | | | | | 76| 0|# define UChar OnigUChar | | | | | | ------------------ | | | | | | 466| 0| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | | | ------------------ | | | | | | | Branch (466:36): [True: 0, False: 0] | | | | | | ------------------ | | | | | | 467| 0| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | | | ------------------ | | | | | | | | 143| 0|# define xrealloc realloc | | | | | | ------------------ | | | | | | 468| 0| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | | | ------------------ | | | | | | | | | Branch (305:39): [True: 0, False: 0] | | | | | | | | ------------------ | | | | | | ------------------ | | | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 629| 0|#define ONIGERR_MEMORY -5 | | | | | | ------------------ | | | | | | 469| 0| (buf)->p = tmp;\ | | | | | | 470| 0|} while (0) | | | | | | ------------------ | | | | | | | Branch (470:10): [Folded - Ignored] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (486:7): [True: 0, False: 24.2k] | | | | ------------------ | | | | 487| 24.2k| xmemcpy((buf)->p + (pos), (bytes), (n));\ | | | | ------------------ | | | | | | 209| 24.2k|#define xmemcpy memcpy | | | | ------------------ | | | | 488| 24.2k| if ((buf)->used < (unsigned int )used) (buf)->used = used;\ | | | | ------------------ | | | | | Branch (488:7): [True: 24.2k, False: 0] | | | | ------------------ | | | | 489| 24.2k|} while (0) | | | | ------------------ | | | | | Branch (489:10): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 245| 24.2k| return 0; 246| 24.2k|} regcomp.c:add_mem_num: 250| 13.4k|{ 251| 13.4k| MemNumType n = (MemNumType )num; 252| | 253| 13.4k| BBUF_ADD(reg, &n, SIZE_MEMNUM); ------------------ | | 498| 13.4k|#define BBUF_ADD(buf,bytes,n) BBUF_WRITE((buf),(buf)->used,(bytes),(n)) | | ------------------ | | | | 484| 13.4k|#define BBUF_WRITE(buf,pos,bytes,n) do{\ | | | | 485| 13.4k| int used = (pos) + (int )(n);\ | | | | 486| 13.4k| if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ | | | | ------------------ | | | | | | 464| 0|#define BBUF_EXPAND(buf,low) do{\ | | | | | | 465| 0| UChar *tmp;\ | | | | | | ------------------ | | | | | | | | 76| 0|# define UChar OnigUChar | | | | | | ------------------ | | | | | | 466| 0| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | | | ------------------ | | | | | | | Branch (466:36): [True: 0, False: 0] | | | | | | ------------------ | | | | | | 467| 0| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | | | ------------------ | | | | | | | | 143| 0|# define xrealloc realloc | | | | | | ------------------ | | | | | | 468| 0| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | | | ------------------ | | | | | | | | | Branch (305:39): [True: 0, False: 0] | | | | | | | | ------------------ | | | | | | ------------------ | | | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 629| 0|#define ONIGERR_MEMORY -5 | | | | | | ------------------ | | | | | | 469| 0| (buf)->p = tmp;\ | | | | | | 470| 0|} while (0) | | | | | | ------------------ | | | | | | | Branch (470:10): [Folded - Ignored] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (486:7): [True: 0, False: 13.4k] | | | | ------------------ | | | | 487| 13.4k| xmemcpy((buf)->p + (pos), (bytes), (n));\ | | | | ------------------ | | | | | | 209| 13.4k|#define xmemcpy memcpy | | | | ------------------ | | | | 488| 13.4k| if ((buf)->used < (unsigned int )used) (buf)->used = used;\ | | | | ------------------ | | | | | Branch (488:7): [True: 13.4k, False: 0] | | | | ------------------ | | | | 489| 13.4k|} while (0) | | | | ------------------ | | | | | Branch (489:10): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 254| 13.4k| return 0; 255| 13.4k|} regcomp.c:compile_quantifier_node: 1033| 22.9k|{ 1034| 22.9k| int i, r, mod_tlen; 1035| 22.9k| int infinite = IS_REPEAT_INFINITE(qn->upper); ------------------ | | 416| 22.9k|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 415| 22.9k|#define REPEAT_INFINITE -1 | | ------------------ ------------------ 1036| 22.9k| int empty_info = qn->target_empty_info; 1037| 22.9k| int tlen = compile_length_tree(qn->target, reg); 1038| | 1039| 22.9k| if (tlen < 0) return tlen; ------------------ | Branch (1039:7): [True: 0, False: 22.9k] ------------------ 1040| | 1041| 22.9k| if (is_anychar_star_quantifier(qn)) { ------------------ | Branch (1041:7): [True: 6.74k, False: 16.1k] ------------------ 1042| 6.74k| r = compile_tree_n_times(qn->target, qn->lower, reg); 1043| 6.74k| if (r) return r; ------------------ | Branch (1043:9): [True: 0, False: 6.74k] ------------------ 1044| 6.74k| if (IS_NOT_NULL(qn->next_head_exact)) { ------------------ | | 306| 6.74k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 2.69k, False: 4.04k] | | ------------------ ------------------ 1045| 2.69k| if (IS_MULTILINE(reg->options)) ------------------ | | 389| 2.69k|#define IS_MULTILINE(option) ((option) & ONIG_OPTION_MULTILINE) | | ------------------ | | | | 453| 2.69k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | ------------------ | | | | | | 452| 2.69k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | ------------------ | | | | | | | | 451| 2.69k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (389:35): [True: 0, False: 2.69k] | | ------------------ ------------------ 1046| 0| r = add_opcode(reg, OP_ANYCHAR_ML_STAR_PEEK_NEXT); 1047| 2.69k| else 1048| 2.69k| r = add_opcode(reg, OP_ANYCHAR_STAR_PEEK_NEXT); 1049| 2.69k| if (r) return r; ------------------ | Branch (1049:11): [True: 0, False: 2.69k] ------------------ 1050| 2.69k| return add_bytes(reg, NSTR(qn->next_head_exact)->s, 1); ------------------ | | 76| 2.69k|#define NSTR(node) (&((node)->u.str)) ------------------ 1051| 2.69k| } 1052| 4.04k| else { 1053| 4.04k| if (IS_MULTILINE(reg->options)) ------------------ | | 389| 4.04k|#define IS_MULTILINE(option) ((option) & ONIG_OPTION_MULTILINE) | | ------------------ | | | | 453| 4.04k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | ------------------ | | | | | | 452| 4.04k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | ------------------ | | | | | | | | 451| 4.04k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (389:35): [True: 0, False: 4.04k] | | ------------------ ------------------ 1054| 0| return add_opcode(reg, OP_ANYCHAR_ML_STAR); 1055| 4.04k| else 1056| 4.04k| return add_opcode(reg, OP_ANYCHAR_STAR); 1057| 4.04k| } 1058| 6.74k| } 1059| | 1060| 16.1k| if (empty_info != 0) ------------------ | Branch (1060:7): [True: 0, False: 16.1k] ------------------ 1061| 0| mod_tlen = tlen + (SIZE_OP_NULL_CHECK_START + SIZE_OP_NULL_CHECK_END); ------------------ | | 736| 0|#define SIZE_OP_NULL_CHECK_START (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_NULL_CHECK_START (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ mod_tlen = tlen + (SIZE_OP_NULL_CHECK_START + SIZE_OP_NULL_CHECK_END); ------------------ | | 737| 0|#define SIZE_OP_NULL_CHECK_END (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_NULL_CHECK_END (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ 1062| 16.1k| else 1063| 16.1k| mod_tlen = tlen; 1064| | 1065| 16.1k| if (infinite && ------------------ | Branch (1065:7): [True: 14.8k, False: 1.34k] ------------------ 1066| 16.1k| (qn->lower <= 1 || tlen * qn->lower <= QUANTIFIER_EXPAND_LIMIT_SIZE)) { ------------------ | | 724| 0|#define QUANTIFIER_EXPAND_LIMIT_SIZE 50 ------------------ | Branch (1066:8): [True: 14.8k, False: 0] | Branch (1066:26): [True: 0, False: 0] ------------------ 1067| 14.8k| if (qn->lower == 1 && tlen > QUANTIFIER_EXPAND_LIMIT_SIZE) { ------------------ | | 724| 6.74k|#define QUANTIFIER_EXPAND_LIMIT_SIZE 50 ------------------ | Branch (1067:9): [True: 6.74k, False: 8.08k] | Branch (1067:27): [True: 0, False: 6.74k] ------------------ 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)) ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 0] | | ------------------ ------------------ 1075| 0| r = add_opcode_rel_addr(reg, OP_JUMP, SIZE_OP_PUSH_IF_PEEK_NEXT); ------------------ | | 718| 0|#define SIZE_OP_PUSH_IF_PEEK_NEXT (SIZE_OPCODE + SIZE_RELADDR + 1) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH_IF_PEEK_NEXT (SIZE_OPCODE + SIZE_RELADDR + 1) | | ------------------ | | | | 683| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1076| 0| else 1077| 0| r = add_opcode_rel_addr(reg, OP_JUMP, SIZE_OP_PUSH); ------------------ | | 715| 0|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 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); ------------------ | | 714| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 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| 14.8k| else { 1085| 14.8k| r = compile_tree_n_times(qn->target, qn->lower, reg); 1086| 14.8k| if (r) return r; ------------------ | Branch (1086:11): [True: 0, False: 14.8k] ------------------ 1087| 14.8k| } 1088| | 1089| 14.8k| if (qn->greedy) { ------------------ | Branch (1089:9): [True: 13.4k, False: 1.34k] ------------------ 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| 13.4k| if (IS_NOT_NULL(qn->next_head_exact)) { ------------------ | | 306| 13.4k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 13.4k] | | ------------------ ------------------ 1104| 0| r = add_opcode_rel_addr(reg, OP_PUSH_IF_PEEK_NEXT, 1105| 0| mod_tlen + SIZE_OP_JUMP); ------------------ | | 714| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 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)); ------------------ | | 714| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ -(mod_tlen + (int )SIZE_OP_JUMP + (int )SIZE_OP_PUSH_IF_PEEK_NEXT)); ------------------ | | 718| 0|#define SIZE_OP_PUSH_IF_PEEK_NEXT (SIZE_OPCODE + SIZE_RELADDR + 1) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH_IF_PEEK_NEXT (SIZE_OPCODE + SIZE_RELADDR + 1) | | ------------------ | | | | 683| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1112| 0| } 1113| 13.4k| else { 1114| 13.4k| r = add_opcode_rel_addr(reg, OP_PUSH, mod_tlen + SIZE_OP_JUMP); ------------------ | | 714| 13.4k|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 13.4k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 13.4k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1115| 13.4k| if (r) return r; ------------------ | Branch (1115:6): [True: 0, False: 13.4k] ------------------ 1116| 13.4k| r = compile_tree_empty_check(qn->target, reg, empty_info); 1117| 13.4k| if (r) return r; ------------------ | Branch (1117:6): [True: 0, False: 13.4k] ------------------ 1118| 13.4k| r = add_opcode_rel_addr(reg, OP_JUMP, 1119| 13.4k| -(mod_tlen + (int )SIZE_OP_JUMP + (int )SIZE_OP_PUSH)); ------------------ | | 714| 13.4k|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 13.4k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 13.4k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ -(mod_tlen + (int )SIZE_OP_JUMP + (int )SIZE_OP_PUSH)); ------------------ | | 715| 13.4k|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 13.4k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 13.4k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1120| 13.4k| } 1121| 13.4k| } 1122| 1.34k| else { 1123| 1.34k| r = add_opcode_rel_addr(reg, OP_JUMP, mod_tlen); 1124| 1.34k| if (r) return r; ------------------ | Branch (1124:11): [True: 0, False: 1.34k] ------------------ 1125| 1.34k| r = compile_tree_empty_check(qn->target, reg, empty_info); 1126| 1.34k| if (r) return r; ------------------ | Branch (1126:11): [True: 0, False: 1.34k] ------------------ 1127| 1.34k| r = add_opcode_rel_addr(reg, OP_PUSH, -(mod_tlen + (int )SIZE_OP_PUSH)); ------------------ | | 715| 1.34k|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 1.34k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 1.34k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1128| 1.34k| } 1129| 14.8k| } 1130| 1.34k| else if (qn->upper == 0 && qn->is_referred != 0) { /* /(?..){0}/ */ ------------------ | Branch (1130:12): [True: 0, False: 1.34k] | 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.34k| else if (!infinite && qn->greedy && ------------------ | Branch (1135:12): [True: 1.34k, False: 0] | Branch (1135:25): [True: 1.34k, False: 0] ------------------ 1136| 1.34k| (qn->upper == 1 || (tlen + SIZE_OP_PUSH) * qn->upper ------------------ | | 715| 0|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 0|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ | Branch (1136:13): [True: 1.34k, False: 0] | Branch (1136:31): [True: 0, False: 0] ------------------ 1137| 1.34k| <= QUANTIFIER_EXPAND_LIMIT_SIZE)) { ------------------ | | 724| 0|#define QUANTIFIER_EXPAND_LIMIT_SIZE 50 ------------------ 1138| 1.34k| int n = qn->upper - qn->lower; 1139| | 1140| 1.34k| r = compile_tree_n_times(qn->target, qn->lower, reg); 1141| 1.34k| if (r) return r; ------------------ | Branch (1141:9): [True: 0, False: 1.34k] ------------------ 1142| | 1143| 2.69k| for (i = 0; i < n; i++) { ------------------ | Branch (1143:17): [True: 1.34k, False: 1.34k] ------------------ 1144| 1.34k| r = add_opcode_rel_addr(reg, OP_PUSH, 1145| 1.34k| (n - i) * tlen + (n - i - 1) * SIZE_OP_PUSH); ------------------ | | 715| 1.34k|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 1.34k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 1.34k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1146| 1.34k| if (r) return r; ------------------ | Branch (1146:11): [True: 0, False: 1.34k] ------------------ 1147| 1.34k| r = compile_tree(qn->target, reg); 1148| 1.34k| if (r) return r; ------------------ | Branch (1148:11): [True: 0, False: 1.34k] ------------------ 1149| 1.34k| } 1150| 1.34k| } 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); ------------------ | | 714| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 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| 16.1k| return r; 1162| 16.1k|} regcomp.c:is_anychar_star_quantifier: 716| 22.9k|{ 717| 22.9k| if (qn->greedy && IS_REPEAT_INFINITE(qn->upper) && ------------------ | | 416| 44.4k|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 415| 21.5k|#define REPEAT_INFINITE -1 | | ------------------ | | | Branch (416:33): [True: 20.2k, False: 1.34k] | | ------------------ ------------------ | Branch (717:7): [True: 21.5k, False: 1.34k] ------------------ 718| 22.9k| NTYPE(qn->target) == NT_CANY) ------------------ | | 69| 20.2k|#define NTYPE(node) ((node)->u.base.type) ------------------ NTYPE(qn->target) == NT_CANY) ------------------ | | 41| 20.2k|#define NT_CANY 3 ------------------ | Branch (718:7): [True: 6.74k, False: 13.4k] ------------------ 719| 6.74k| return 1; 720| 16.1k| else 721| 16.1k| return 0; 722| 22.9k|} regcomp.c:compile_tree_n_times: 414| 40.4k|{ 415| 40.4k| int i, r; 416| | 417| 64.7k| for (i = 0; i < n; i++) { ------------------ | Branch (417:15): [True: 24.2k, False: 40.4k] ------------------ 418| 24.2k| r = compile_tree(node, reg); 419| 24.2k| if (r) return r; ------------------ | Branch (419:9): [True: 0, False: 24.2k] ------------------ 420| 24.2k| } 421| 40.4k| return 0; 422| 40.4k|} regcomp.c:compile_tree_empty_check: 367| 14.8k|{ 368| 14.8k| int r; 369| 14.8k| int saved_num_null_check = reg->num_null_check; 370| | 371| 14.8k| if (empty_info != 0) { ------------------ | Branch (371:7): [True: 0, False: 14.8k] ------------------ 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| 14.8k| r = compile_tree(node, reg); 380| 14.8k| if (r) return r; ------------------ | Branch (380:7): [True: 0, False: 14.8k] ------------------ 381| | 382| 14.8k| if (empty_info != 0) { ------------------ | Branch (382:7): [True: 0, False: 14.8k] ------------------ 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| 14.8k| return r; 394| 14.8k|} regcomp.c:compile_enclose_node: 1308| 25.6k|{ 1309| 25.6k| int r, len; 1310| | 1311| 25.6k| if (node->type == ENCLOSE_OPTION) ------------------ | | 95| 25.6k|#define ENCLOSE_OPTION (1<<1) ------------------ | Branch (1311:7): [True: 1.34k, False: 24.2k] ------------------ 1312| 1.34k| return compile_option_node(node, reg); 1313| | 1314| 24.2k| switch (node->type) { 1315| 6.74k| case ENCLOSE_MEMORY: ------------------ | | 94| 6.74k|#define ENCLOSE_MEMORY (1<<0) ------------------ | Branch (1315:3): [True: 6.74k, False: 17.5k] ------------------ 1316| 6.74k|#ifdef USE_SUBEXP_CALL 1317| 6.74k| if (IS_ENCLOSE_CALLED(node)) { ------------------ | | 147| 6.74k|#define IS_ENCLOSE_CALLED(en) (((en)->state & NST_CALLED) != 0) | | ------------------ | | | | 136| 6.74k|#define NST_CALLED (1<<8) | | ------------------ | | | Branch (147:40): [True: 0, False: 6.74k] | | ------------------ ------------------ 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; ------------------ | | 501| 0|#define BBUF_GET_OFFSET_POS(buf) ((buf)->used) ------------------ node->call_addr = BBUF_GET_OFFSET_POS(reg) + SIZE_ABSADDR + SIZE_OP_JUMP; ------------------ | | 684| 0|#define SIZE_ABSADDR (int )sizeof(AbsAddrType) ------------------ node->call_addr = BBUF_GET_OFFSET_POS(reg) + SIZE_ABSADDR + SIZE_OP_JUMP; ------------------ | | 714| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 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); ------------------ | | 729| 0|#define SIZE_OP_MEMORY_START_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_START_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ len += (SIZE_OP_MEMORY_START_PUSH + SIZE_OP_RETURN); ------------------ | | 742| 0|#define SIZE_OP_RETURN SIZE_OPCODE | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ ------------------ 1326| 0| if (BIT_STATUS_AT(reg->bt_mem_end, node->regnum)) ------------------ | | 365| 0| ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1)) | | ------------------ | | | | 361| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (365:3): [True: 0, False: 0] | | | Branch (365: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); ------------------ | | 731| 0|#define SIZE_OP_MEMORY_END_PUSH_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END_PUSH_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ ? SIZE_OP_MEMORY_END_PUSH_REC : SIZE_OP_MEMORY_END_PUSH); ------------------ | | 730| 0|#define SIZE_OP_MEMORY_END_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END_PUSH (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 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); ------------------ | | 733| 0|#define SIZE_OP_MEMORY_END_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END_REC (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 0|#define SIZE_MEMNUM (int )sizeof(MemNumType) | | ------------------ ------------------ ? SIZE_OP_MEMORY_END_REC : SIZE_OP_MEMORY_END); ------------------ | | 732| 0|#define SIZE_OP_MEMORY_END (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_MEMORY_END (SIZE_OPCODE + SIZE_MEMNUM) | | ------------------ | | | | 686| 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| 6.74k|#endif 1337| 6.74k| if (BIT_STATUS_AT(reg->bt_mem_start, node->regnum)) ------------------ | | 365| 6.74k| ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1)) | | ------------------ | | | | 361| 6.74k|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (365:3): [True: 0, False: 6.74k] | | | Branch (365:4): [True: 6.74k, False: 0] | | ------------------ ------------------ 1338| 0| r = add_opcode(reg, OP_MEMORY_START_PUSH); 1339| 6.74k| else 1340| 6.74k| r = add_opcode(reg, OP_MEMORY_START); 1341| 6.74k| if (r) return r; ------------------ | Branch (1341:9): [True: 0, False: 6.74k] ------------------ 1342| 6.74k| r = add_mem_num(reg, node->regnum); 1343| 6.74k| if (r) return r; ------------------ | Branch (1343:9): [True: 0, False: 6.74k] ------------------ 1344| 6.74k| r = compile_tree(node->target, reg); 1345| 6.74k| if (r) return r; ------------------ | Branch (1345:9): [True: 0, False: 6.74k] ------------------ 1346| 6.74k|#ifdef USE_SUBEXP_CALL 1347| 6.74k| if (IS_ENCLOSE_CALLED(node)) { ------------------ | | 147| 6.74k|#define IS_ENCLOSE_CALLED(en) (((en)->state & NST_CALLED) != 0) | | ------------------ | | | | 136| 6.74k|#define NST_CALLED (1<<8) | | ------------------ | | | Branch (147:40): [True: 0, False: 6.74k] | | ------------------ ------------------ 1348| 0| if (BIT_STATUS_AT(reg->bt_mem_end, node->regnum)) ------------------ | | 365| 0| ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1)) | | ------------------ | | | | 361| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (365:3): [True: 0, False: 0] | | | Branch (365: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| 6.74k| else if (IS_ENCLOSE_RECURSION(node)) { ------------------ | | 149| 6.74k|#define IS_ENCLOSE_RECURSION(en) (((en)->state & NST_RECURSION) != 0) | | ------------------ | | | | 135| 6.74k|#define NST_RECURSION (1<<7) | | ------------------ | | | Branch (149:40): [True: 0, False: 6.74k] | | ------------------ ------------------ 1361| 0| if (BIT_STATUS_AT(reg->bt_mem_end, node->regnum)) ------------------ | | 365| 0| ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1)) | | ------------------ | | | | 361| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (365:3): [True: 0, False: 0] | | | Branch (365: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| 6.74k| else 1369| 6.74k|#endif 1370| 6.74k| { 1371| 6.74k| if (BIT_STATUS_AT(reg->bt_mem_end, node->regnum)) ------------------ | | 365| 6.74k| ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1)) | | ------------------ | | | | 361| 6.74k|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (365:3): [True: 0, False: 6.74k] | | | Branch (365:4): [True: 6.74k, False: 0] | | ------------------ ------------------ 1372| 0| r = add_opcode(reg, OP_MEMORY_END_PUSH); 1373| 6.74k| else 1374| 6.74k| r = add_opcode(reg, OP_MEMORY_END); 1375| 6.74k| if (r) return r; ------------------ | Branch (1375:11): [True: 0, False: 6.74k] ------------------ 1376| 6.74k| r = add_mem_num(reg, node->regnum); 1377| 6.74k| } 1378| 6.74k| break; 1379| | 1380| 17.5k| case ENCLOSE_STOP_BACKTRACK: ------------------ | | 96| 17.5k|#define ENCLOSE_STOP_BACKTRACK (1<<2) ------------------ | Branch (1380:3): [True: 17.5k, False: 6.74k] ------------------ 1381| 17.5k| if (IS_ENCLOSE_STOP_BT_SIMPLE_REPEAT(node)) { ------------------ | | 156| 17.5k| (((en)->state & NST_STOP_BT_SIMPLE_REPEAT) != 0) | | ------------------ | | | | 134| 17.5k|#define NST_STOP_BT_SIMPLE_REPEAT (1<<6) | | ------------------ | | | Branch (156:5): [True: 17.5k, False: 0] | | ------------------ ------------------ 1382| 17.5k| QtfrNode* qn = NQTFR(node->target); ------------------ | | 80| 17.5k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1383| 17.5k| r = compile_tree_n_times(qn->target, qn->lower, reg); 1384| 17.5k| if (r) return r; ------------------ | Branch (1384:11): [True: 0, False: 17.5k] ------------------ 1385| | 1386| 17.5k| len = compile_length_tree(qn->target, reg); 1387| 17.5k| if (len < 0) return len; ------------------ | Branch (1387:11): [True: 0, False: 17.5k] ------------------ 1388| | 1389| 17.5k| r = add_opcode_rel_addr(reg, OP_PUSH, len + SIZE_OP_POP + SIZE_OP_JUMP); ------------------ | | 716| 17.5k|#define SIZE_OP_POP SIZE_OPCODE | | ------------------ | | | | 682| 17.5k|#define SIZE_OPCODE 1 | | ------------------ ------------------ r = add_opcode_rel_addr(reg, OP_PUSH, len + SIZE_OP_POP + SIZE_OP_JUMP); ------------------ | | 714| 17.5k|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 17.5k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 17.5k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1390| 17.5k| if (r) return r; ------------------ | Branch (1390:11): [True: 0, False: 17.5k] ------------------ 1391| 17.5k| r = compile_tree(qn->target, reg); 1392| 17.5k| if (r) return r; ------------------ | Branch (1392:11): [True: 0, False: 17.5k] ------------------ 1393| 17.5k| r = add_opcode(reg, OP_POP); 1394| 17.5k| if (r) return r; ------------------ | Branch (1394:11): [True: 0, False: 17.5k] ------------------ 1395| 17.5k| r = add_opcode_rel_addr(reg, OP_JUMP, 1396| 17.5k| -((int )SIZE_OP_PUSH + len + (int )SIZE_OP_POP + (int )SIZE_OP_JUMP)); ------------------ | | 715| 17.5k|#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 17.5k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 17.5k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ -((int )SIZE_OP_PUSH + len + (int )SIZE_OP_POP + (int )SIZE_OP_JUMP)); ------------------ | | 716| 17.5k|#define SIZE_OP_POP SIZE_OPCODE | | ------------------ | | | | 682| 17.5k|#define SIZE_OPCODE 1 | | ------------------ ------------------ -((int )SIZE_OP_PUSH + len + (int )SIZE_OP_POP + (int )SIZE_OP_JUMP)); ------------------ | | 714| 17.5k|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 17.5k|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 17.5k|#define SIZE_RELADDR (int )sizeof(RelAddrType) | | ------------------ ------------------ 1397| 17.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| 17.5k| break; 1406| | 1407| 17.5k| case ENCLOSE_CONDITION: ------------------ | | 97| 0|#define ENCLOSE_CONDITION (1<<3) ------------------ | Branch (1407:3): [True: 0, False: 24.2k] ------------------ 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; ------------------ | | 631| 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; ------------------ | | 664| 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); ------------------ | | 714| 0|#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 682| 0|#define SIZE_OPCODE 1 | | ------------------ | | #define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR) | | ------------------ | | | | 683| 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; ------------------ | | 631| 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: 24.2k] ------------------ 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); ------------------ | | 746| 0|#define SIZE_OP_ABSENT_END SIZE_OPCODE | | ------------------ | | | | 682| 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: 24.2k] ------------------ 1454| 0| return ONIGERR_TYPE_BUG; ------------------ | | 630| 0|#define ONIGERR_TYPE_BUG -6 ------------------ 1455| 0| break; 1456| 24.2k| } 1457| | 1458| 24.2k| return r; 1459| 24.2k|} regcomp.c:compile_option_node: 1187| 1.34k|{ 1188| 1.34k| int r; 1189| 1.34k| OnigOptionType prev = reg->options; 1190| | 1191| 1.34k| if (IS_DYNAMIC_OPTION(prev ^ node->option)) { ------------------ | | 410| 1.34k|#define IS_DYNAMIC_OPTION(option) 0 | | ------------------ | | | Branch (410: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.34k| reg->options = node->option; 1201| 1.34k| r = compile_tree(node->target, reg); 1202| 1.34k| reg->options = prev; 1203| | 1204| 1.34k| if (IS_DYNAMIC_OPTION(prev ^ node->option)) { ------------------ | | 410| 1.34k|#define IS_DYNAMIC_OPTION(option) 0 | | ------------------ | | | Branch (410: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.34k| return r; 1209| 1.34k|} regcomp.c:compile_anchor_node: 1496| 39.0k|{ 1497| 39.0k| int r, len; 1498| | 1499| 39.0k| switch (node->type) { 1500| 0| case ANCHOR_BEGIN_BUF: r = add_opcode(reg, OP_BEGIN_BUF); break; ------------------ | | 534| 0|#define ANCHOR_BEGIN_BUF (1<<0) ------------------ | Branch (1500:3): [True: 0, False: 39.0k] ------------------ 1501| 0| case ANCHOR_END_BUF: r = add_opcode(reg, OP_END_BUF); break; ------------------ | | 537| 0|#define ANCHOR_END_BUF (1<<3) ------------------ | Branch (1501:3): [True: 0, False: 39.0k] ------------------ 1502| 26.9k| case ANCHOR_BEGIN_LINE: r = add_opcode(reg, OP_BEGIN_LINE); break; ------------------ | | 535| 26.9k|#define ANCHOR_BEGIN_LINE (1<<1) ------------------ | Branch (1502:3): [True: 26.9k, False: 12.1k] ------------------ 1503| 10.7k| case ANCHOR_END_LINE: r = add_opcode(reg, OP_END_LINE); break; ------------------ | | 539| 10.7k|#define ANCHOR_END_LINE (1<<5) ------------------ | Branch (1503:3): [True: 10.7k, False: 28.3k] ------------------ 1504| 0| case ANCHOR_SEMI_END_BUF: r = add_opcode(reg, OP_SEMI_END_BUF); break; ------------------ | | 538| 0|#define ANCHOR_SEMI_END_BUF (1<<4) ------------------ | Branch (1504:3): [True: 0, False: 39.0k] ------------------ 1505| 0| case ANCHOR_BEGIN_POSITION: r = add_opcode(reg, OP_BEGIN_POSITION); break; ------------------ | | 536| 0|#define ANCHOR_BEGIN_POSITION (1<<2) ------------------ | Branch (1505:3): [True: 0, False: 39.0k] ------------------ 1506| | 1507| 1.34k| case ANCHOR_WORD_BOUND: ------------------ | | 541| 1.34k|#define ANCHOR_WORD_BOUND (1<<6) ------------------ | Branch (1507:3): [True: 1.34k, False: 37.7k] ------------------ 1508| 1.34k| if (node->ascii_range) r = add_opcode(reg, OP_ASCII_WORD_BOUND); ------------------ | Branch (1508:9): [True: 0, False: 1.34k] ------------------ 1509| 1.34k| else r = add_opcode(reg, OP_WORD_BOUND); 1510| 1.34k| break; 1511| 0| case ANCHOR_NOT_WORD_BOUND: ------------------ | | 542| 0|#define ANCHOR_NOT_WORD_BOUND (1<<7) ------------------ | Branch (1511:3): [True: 0, False: 39.0k] ------------------ 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: ------------------ | | 543| 0|#define ANCHOR_WORD_BEGIN (1<<8) ------------------ | Branch (1516:3): [True: 0, False: 39.0k] ------------------ 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: ------------------ | | 544| 0|#define ANCHOR_WORD_END (1<<9) ------------------ | Branch (1520:3): [True: 0, False: 39.0k] ------------------ 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; ------------------ | | 553| 0|#define ANCHOR_KEEP (1<<16) ------------------ | Branch (1525:3): [True: 0, False: 39.0k] ------------------ 1526| | 1527| 0| case ANCHOR_PREC_READ: ------------------ | | 545| 0|#define ANCHOR_PREC_READ (1<<10) ------------------ | Branch (1527:3): [True: 0, False: 39.0k] ------------------ 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: ------------------ | | 546| 0|#define ANCHOR_PREC_READ_NOT (1<<11) ------------------ | Branch (1535:3): [True: 0, False: 39.0k] ------------------ 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); ------------------ | | 724| 0|#define SIZE_OP_FAIL_POS SIZE_OPCODE | | ------------------ | | | | 682| 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: ------------------ | | 547| 0|#define ANCHOR_LOOK_BEHIND (1<<12) ------------------ | Branch (1545:3): [True: 0, False: 39.0k] ------------------ 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; ------------------ | | 662| 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: ------------------ | | 548| 0|#define ANCHOR_LOOK_BEHIND_NOT (1<<13) ------------------ | Branch (1562:3): [True: 0, False: 39.0k] ------------------ 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); ------------------ | | 740| 0|#define SIZE_OP_FAIL_LOOK_BEHIND_NOT SIZE_OPCODE | | ------------------ | | | | 682| 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; ------------------ | | 662| 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: 39.0k] ------------------ 1584| 0| return ONIGERR_TYPE_BUG; ------------------ | | 630| 0|#define ONIGERR_TYPE_BUG -6 ------------------ 1585| 0| break; 1586| 39.0k| } 1587| | 1588| 39.0k| return r; 1589| 39.0k|} regcomp.c:add_opcode: 205| 315k|{ 206| 315k| BBUF_ADD1(reg, opcode); ------------------ | | 499| 315k|#define BBUF_ADD1(buf,byte) BBUF_WRITE1((buf),(buf)->used,(byte)) | | ------------------ | | | | 491| 315k|#define BBUF_WRITE1(buf,pos,byte) do{\ | | | | 492| 315k| int used = (pos) + 1;\ | | | | 493| 315k| if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ | | | | ------------------ | | | | | | 464| 4.04k|#define BBUF_EXPAND(buf,low) do{\ | | | | | | 465| 4.04k| UChar *tmp;\ | | | | | | ------------------ | | | | | | | | 76| 4.04k|# define UChar OnigUChar | | | | | | ------------------ | | | | | | 466| 4.04k| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | | | ------------------ | | | | | | | Branch (466:36): [True: 0, False: 4.04k] | | | | | | ------------------ | | | | | | 467| 4.04k| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | | | ------------------ | | | | | | | | 143| 4.04k|# define xrealloc realloc | | | | | | ------------------ | | | | | | 468| 4.04k| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 305| 4.04k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | | | ------------------ | | | | | | | | | Branch (305:39): [True: 0, False: 4.04k] | | | | | | | | ------------------ | | | | | | ------------------ | | | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 629| 0|#define ONIGERR_MEMORY -5 | | | | | | ------------------ | | | | | | 469| 4.04k| (buf)->p = tmp;\ | | | | | | 470| 4.04k|} while (0) | | | | | | ------------------ | | | | | | | Branch (470:10): [Folded - Ignored] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (493:7): [True: 4.04k, False: 311k] | | | | ------------------ | | | | 494| 315k| (buf)->p[(pos)] = (UChar )(byte);\ | | | | 495| 315k| if ((buf)->used < (unsigned int )used) (buf)->used = used;\ | | | | ------------------ | | | | | Branch (495:7): [True: 315k, False: 0] | | | | ------------------ | | | | 496| 315k|} while (0) | | | | ------------------ | | | | | Branch (496:10): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 207| 315k| return 0; 208| 315k|} onigenc_init: 37| 1|{ 38| 1| return 0; 39| 1|} onigenc_mbclen_approximate: 56| 2.30M|{ 57| 2.30M| int ret = ONIGENC_PRECISE_MBC_ENC_LEN(enc, p, e); ------------------ | | 356| 2.30M|#define ONIGENC_PRECISE_MBC_ENC_LEN(enc,p,e) (enc)->precise_mbc_enc_len(p,e,enc) ------------------ 58| 2.30M| if (ONIGENC_MBCLEN_CHARFOUND_P(ret)) ------------------ | | 346| 2.30M|#define ONIGENC_MBCLEN_CHARFOUND_P(r) (0 < (r)) | | ------------------ | | | Branch (346:49): [True: 2.30M, False: 0] | | ------------------ ------------------ 59| 2.30M| return ONIGENC_MBCLEN_CHARFOUND_LEN(ret); ------------------ | | 347| 2.30M|#define ONIGENC_MBCLEN_CHARFOUND_LEN(r) (r) ------------------ 60| 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] | | ------------------ ------------------ 61| 0| return (int )(e - p) + ONIGENC_MBCLEN_NEEDMORE_LEN(ret); ------------------ | | 354| 0|#define ONIGENC_MBCLEN_NEEDMORE_LEN(r) (-1-(r)) ------------------ 62| 0| return 1; 63| 2.30M|} onigenc_always_true_is_allowed_reverse_match: 662| 14.8k|{ 663| 14.8k| return TRUE; ------------------ | | 73| 14.8k|# define TRUE 1 ------------------ 664| 14.8k|} onig_strcpy: 260| 501k|{ 261| 501k| ptrdiff_t len = end - src; 262| 501k| if (len > 0) { ------------------ | Branch (262:7): [True: 501k, False: 0] ------------------ 263| 501k| xmemcpy(dest, src, len); ------------------ | | 209| 501k|#define xmemcpy memcpy ------------------ 264| 501k| dest[len] = (UChar )0; 265| 501k| } 266| 501k|} onig_st_init_strend_table_with_size: 407| 1.34k|{ 408| 1.34k| static const struct st_hash_type hashType = { 409| 1.34k| str_end_cmp, 410| 1.34k| str_end_hash, 411| 1.34k| }; 412| | 413| 1.34k| return (hash_table_type* ) 414| 1.34k| onig_st_init_table_with_size(&hashType, size); 415| 1.34k|} onig_st_lookup_strend: 420| 4.04k|{ 421| 4.04k| st_str_end_key key; 422| | 423| 4.04k| key.s = (UChar* )str_key; 424| 4.04k| key.end = (UChar* )end_key; 425| | 426| 4.04k| return onig_st_lookup(table, (st_data_t )(&key), value); 427| 4.04k|} onig_st_insert_strend: 432| 5.39k|{ 433| 5.39k| st_str_end_key* key; 434| 5.39k| int result; 435| | 436| 5.39k| key = (st_str_end_key* )xmalloc(sizeof(st_str_end_key)); ------------------ | | 142| 5.39k|# define xmalloc malloc ------------------ 437| 5.39k| key->s = (UChar* )str_key; 438| 5.39k| key->end = (UChar* )end_key; 439| 5.39k| result = onig_st_insert(table, (st_data_t )key, value); 440| 5.39k| if (result) { ------------------ | Branch (440:7): [True: 0, False: 5.39k] ------------------ 441| 0| xfree(key); ------------------ | | 145| 0|# define xfree free ------------------ 442| 0| } 443| 5.39k| return result; 444| 5.39k|} onig_names_free: 526| 31.0k|{ 527| 31.0k| int r; 528| 31.0k| NameTable* t; 529| | 530| 31.0k| r = names_clear(reg); 531| 31.0k| if (r) return r; ------------------ | Branch (531:7): [True: 0, False: 31.0k] ------------------ 532| | 533| 31.0k| t = (NameTable* )reg->name_table; 534| 31.0k| if (IS_NOT_NULL(t)) onig_st_free_table(t); ------------------ | | 306| 31.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 1.34k, False: 29.6k] | | ------------------ ------------------ 535| 31.0k| reg->name_table = (void* )NULL; 536| 31.0k| return 0; 537| 31.0k|} onig_node_free: 1063| 269k|{ 1064| 421k| start: 1065| 421k| if (IS_NULL(node)) return ; ------------------ | | 305| 421k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 60.6k, False: 361k] | | ------------------ ------------------ 1066| | 1067| 361k| switch (NTYPE(node)) { ------------------ | | 69| 361k|#define NTYPE(node) ((node)->u.base.type) | | ------------------ | | | Branch (69:33): [True: 13.4k, False: 347k] | | ------------------ ------------------ 1068| 57.9k| case NT_STR: ------------------ | | 38| 57.9k|#define NT_STR 0 ------------------ | Branch (1068:3): [True: 57.9k, False: 303k] ------------------ 1069| 57.9k| if (NSTR(node)->capa != 0 && ------------------ | | 76| 57.9k|#define NSTR(node) (&((node)->u.str)) ------------------ | Branch (1069:9): [True: 5.39k, False: 52.5k] ------------------ 1070| 57.9k| IS_NOT_NULL(NSTR(node)->s) && NSTR(node)->s != NSTR(node)->buf) { ------------------ | | 306| 63.3k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 5.39k, False: 0] | | ------------------ ------------------ IS_NOT_NULL(NSTR(node)->s) && NSTR(node)->s != NSTR(node)->buf) { ------------------ | | 76| 5.39k|#define NSTR(node) (&((node)->u.str)) ------------------ IS_NOT_NULL(NSTR(node)->s) && NSTR(node)->s != NSTR(node)->buf) { ------------------ | | 76| 5.39k|#define NSTR(node) (&((node)->u.str)) ------------------ | Branch (1070:32): [True: 5.39k, False: 0] ------------------ 1071| 5.39k| xfree(NSTR(node)->s); ------------------ | | 145| 5.39k|# define xfree free ------------------ xfree(NSTR(node)->s); ------------------ | | 76| 5.39k|#define NSTR(node) (&((node)->u.str)) ------------------ 1072| 5.39k| } 1073| 57.9k| break; 1074| | 1075| 133k| case NT_LIST: ------------------ | | 46| 133k|#define NT_LIST 8 ------------------ | Branch (1075:3): [True: 133k, False: 227k] ------------------ 1076| 152k| case NT_ALT: ------------------ | | 47| 152k|#define NT_ALT 9 ------------------ | Branch (1076:3): [True: 18.8k, False: 342k] ------------------ 1077| 152k| onig_node_free(NCAR(node)); ------------------ | | 86| 152k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 152k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1078| 152k| { 1079| 152k| Node* next_node = NCDR(node); ------------------ | | 87| 152k|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 152k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1080| | 1081| 152k| xfree(node); ------------------ | | 145| 152k|# define xfree free ------------------ 1082| 152k| node = next_node; 1083| 152k| goto start; 1084| 133k| } 1085| 0| break; 1086| | 1087| 32.3k| case NT_CCLASS: ------------------ | | 39| 32.3k|#define NT_CCLASS 1 ------------------ | Branch (1087:3): [True: 32.3k, False: 328k] ------------------ 1088| 32.3k| { 1089| 32.3k| CClassNode* cc = NCCLASS(node); ------------------ | | 77| 32.3k|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 1090| | 1091| 32.3k| if (cc->mbuf) ------------------ | Branch (1091:11): [True: 0, False: 32.3k] ------------------ 1092| 0| bbuf_free(cc->mbuf); 1093| 32.3k| } 1094| 32.3k| break; 1095| | 1096| 40.4k| case NT_QTFR: ------------------ | | 43| 40.4k|#define NT_QTFR 5 ------------------ | Branch (1096:3): [True: 40.4k, False: 320k] ------------------ 1097| 40.4k| if (NQTFR(node)->target) ------------------ | | 80| 40.4k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ | Branch (1097:9): [True: 40.4k, False: 0] ------------------ 1098| 40.4k| onig_node_free(NQTFR(node)->target); ------------------ | | 80| 40.4k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1099| 40.4k| break; 1100| | 1101| 25.6k| case NT_ENCLOSE: ------------------ | | 44| 25.6k|#define NT_ENCLOSE 6 ------------------ | Branch (1101:3): [True: 25.6k, False: 335k] ------------------ 1102| 25.6k| if (NENCLOSE(node)->target) ------------------ | | 81| 25.6k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ | Branch (1102:9): [True: 25.6k, False: 0] ------------------ 1103| 25.6k| onig_node_free(NENCLOSE(node)->target); ------------------ | | 81| 25.6k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1104| 25.6k| break; 1105| | 1106| 0| case NT_BREF: ------------------ | | 42| 0|#define NT_BREF 4 ------------------ | Branch (1106:3): [True: 0, False: 361k] ------------------ 1107| 0| if (IS_NOT_NULL(NBREF(node)->back_dynamic)) ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306: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| 39.0k| case NT_ANCHOR: ------------------ | | 45| 39.0k|#define NT_ANCHOR 7 ------------------ | Branch (1111:3): [True: 39.0k, False: 322k] ------------------ 1112| 39.0k| if (NANCHOR(node)->target) ------------------ | | 82| 39.0k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ | Branch (1112:9): [True: 0, False: 39.0k] ------------------ 1113| 0| onig_node_free(NANCHOR(node)->target); ------------------ | | 82| 0|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 1114| 39.0k| break; 1115| 361k| } 1116| | 1117| 208k| xfree(node); ------------------ | | 145| 208k|# define xfree free ------------------ 1118| 208k|} onig_node_new_alt: 1211| 18.8k|{ 1212| 18.8k| Node* node = node_new(); 1213| 18.8k| CHECK_NULL_RETURN(node); ------------------ | | 307| 18.8k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 305| 18.8k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 18.8k] | | | | ------------------ | | ------------------ ------------------ 1214| | 1215| 18.8k| SET_NTYPE(node, NT_ALT); ------------------ | | 71| 18.8k| do { \ | | 72| 18.8k| int value = ntype; \ | | 73| 18.8k| memcpy(&((node)->u.base.type), &value, sizeof(int)); \ | | 74| 18.8k| } while (0) | | ------------------ | | | Branch (74:14): [Folded - Ignored] | | ------------------ ------------------ 1216| 18.8k| NCAR(node) = left; ------------------ | | 86| 18.8k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 18.8k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1217| 18.8k| NCDR(node) = right; ------------------ | | 87| 18.8k|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 18.8k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1218| 18.8k| return node; 1219| 18.8k|} onig_node_new_anchor: 1223| 39.0k|{ 1224| 39.0k| Node* node = node_new(); 1225| 39.0k| CHECK_NULL_RETURN(node); ------------------ | | 307| 39.0k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 305| 39.0k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 39.0k] | | | | ------------------ | | ------------------ ------------------ 1226| | 1227| 39.0k| SET_NTYPE(node, NT_ANCHOR); ------------------ | | 71| 39.0k| do { \ | | 72| 39.0k| int value = ntype; \ | | 73| 39.0k| memcpy(&((node)->u.base.type), &value, sizeof(int)); \ | | 74| 39.0k| } while (0) | | ------------------ | | | Branch (74:14): [Folded - Ignored] | | ------------------ ------------------ 1228| 39.0k| NANCHOR(node)->type = type; ------------------ | | 82| 39.0k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 1229| 39.0k| NANCHOR(node)->target = NULL; ------------------ | | 82| 39.0k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 1230| 39.0k| NANCHOR(node)->char_len = -1; ------------------ | | 82| 39.0k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 1231| 39.0k| NANCHOR(node)->ascii_range = 0; ------------------ | | 82| 39.0k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 1232| 39.0k| return node; 1233| 39.0k|} onig_node_new_enclose: 1348| 17.5k|{ 1349| 17.5k| return node_new_enclose(type); 1350| 17.5k|} onig_node_str_cat: 1377| 497k|{ 1378| 497k| ptrdiff_t addlen = end - s; 1379| | 1380| 497k| if (addlen > 0) { ------------------ | Branch (1380:7): [True: 496k, False: 1.34k] ------------------ 1381| 496k| ptrdiff_t len = NSTR(node)->end - NSTR(node)->s; ------------------ | | 76| 496k|#define NSTR(node) (&((node)->u.str)) ------------------ ptrdiff_t len = NSTR(node)->end - NSTR(node)->s; ------------------ | | 76| 496k|#define NSTR(node) (&((node)->u.str)) ------------------ 1382| | 1383| 496k| if (NSTR(node)->capa > 0 || (len + addlen > NODE_STR_BUF_SIZE - 1)) { ------------------ | | 76| 496k|#define NSTR(node) (&((node)->u.str)) ------------------ if (NSTR(node)->capa > 0 || (len + addlen > NODE_STR_BUF_SIZE - 1)) { ------------------ | | 101| 420k|#define NODE_STR_BUF_SIZE 24 /* sizeof(CClassNode) - sizeof(int)*4 */ ------------------ | Branch (1383:9): [True: 75.4k, False: 420k] | Branch (1383:33): [True: 5.39k, False: 415k] ------------------ 1384| 80.8k| UChar* p; ------------------ | | 76| 80.8k|# define UChar OnigUChar ------------------ 1385| 80.8k| ptrdiff_t capa = len + addlen + NODE_STR_MARGIN; ------------------ | | 100| 80.8k|#define NODE_STR_MARGIN 16 ------------------ 1386| | 1387| 80.8k| if (capa <= NSTR(node)->capa) { ------------------ | | 76| 80.8k|#define NSTR(node) (&((node)->u.str)) ------------------ | Branch (1387:11): [True: 0, False: 80.8k] ------------------ 1388| 0| onig_strcpy(NSTR(node)->s + len, s, end); ------------------ | | 76| 0|#define NSTR(node) (&((node)->u.str)) ------------------ 1389| 0| } 1390| 80.8k| else { 1391| 80.8k| if (NSTR(node)->s == NSTR(node)->buf) ------------------ | | 76| 80.8k|#define NSTR(node) (&((node)->u.str)) ------------------ if (NSTR(node)->s == NSTR(node)->buf) ------------------ | | 76| 80.8k|#define NSTR(node) (&((node)->u.str)) ------------------ | Branch (1391:6): [True: 5.39k, False: 75.4k] ------------------ 1392| 5.39k| p = strcat_capa_from_static(NSTR(node)->s, NSTR(node)->end, ------------------ | | 76| 5.39k|#define NSTR(node) (&((node)->u.str)) ------------------ p = strcat_capa_from_static(NSTR(node)->s, NSTR(node)->end, ------------------ | | 76| 5.39k|#define NSTR(node) (&((node)->u.str)) ------------------ 1393| 5.39k| s, end, capa); 1394| 75.4k| else 1395| 75.4k| p = strcat_capa(NSTR(node)->s, NSTR(node)->end, s, end, capa); ------------------ | | 76| 75.4k|#define NSTR(node) (&((node)->u.str)) ------------------ p = strcat_capa(NSTR(node)->s, NSTR(node)->end, s, end, capa); ------------------ | | 76| 75.4k|#define NSTR(node) (&((node)->u.str)) ------------------ 1396| | 1397| 80.8k| CHECK_NULL_RETURN_MEMERR(p); ------------------ | | 308| 80.8k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 80.8k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 80.8k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 1398| 80.8k| NSTR(node)->s = p; ------------------ | | 76| 80.8k|#define NSTR(node) (&((node)->u.str)) ------------------ 1399| 80.8k| NSTR(node)->capa = (int )capa; ------------------ | | 76| 80.8k|#define NSTR(node) (&((node)->u.str)) ------------------ 1400| 80.8k| } 1401| 80.8k| } 1402| 415k| else { 1403| 415k| onig_strcpy(NSTR(node)->s + len, s, end); ------------------ | | 76| 415k|#define NSTR(node) (&((node)->u.str)) ------------------ 1404| 415k| } 1405| 496k| NSTR(node)->end = NSTR(node)->s + len + addlen; ------------------ | | 76| 496k|#define NSTR(node) (&((node)->u.str)) ------------------ NSTR(node)->end = NSTR(node)->s + len + addlen; ------------------ | | 76| 496k|#define NSTR(node) (&((node)->u.str)) ------------------ 1406| 496k| } 1407| | 1408| 497k| return 0; 1409| 497k|} onig_parse_make_tree: 6625| 31.0k|{ 6626| 31.0k| int r; 6627| 31.0k| UChar* p; ------------------ | | 76| 31.0k|# define UChar OnigUChar ------------------ 6628| | 6629| 31.0k|#ifdef USE_NAMED_GROUP 6630| 31.0k| names_clear(reg); 6631| 31.0k|#endif 6632| | 6633| 31.0k| scan_env_clear(env); 6634| 31.0k| env->option = reg->options; 6635| 31.0k| env->case_fold_flag = reg->case_fold_flag; 6636| 31.0k| env->enc = reg->enc; 6637| 31.0k| env->syntax = reg->syntax; 6638| 31.0k| env->pattern = (UChar* )pattern; 6639| 31.0k| env->pattern_end = (UChar* )end; 6640| 31.0k| env->reg = reg; 6641| | 6642| 31.0k| *root = NULL; 6643| 31.0k| p = (UChar* )pattern; 6644| 31.0k| r = parse_regexp(root, &p, (UChar* )end, env); 6645| 31.0k| reg->num_mem = env->num_mem; 6646| 31.0k| return r; 6647| 31.0k|} regparse.c:str_end_hash: 392| 9.43k|{ 393| 9.43k| const st_str_end_key *x = (const st_str_end_key *)xp; 394| 9.43k| const UChar *p; 395| 9.43k| st_index_t val = 0; 396| | 397| 9.43k| p = x->s; 398| 44.4k| while (p < x->end) { ------------------ | Branch (398:10): [True: 35.0k, False: 9.43k] ------------------ 399| 35.0k| val = val * 997 + (int )*p++; 400| 35.0k| } 401| | 402| 9.43k| return val + (val >> 5); 403| 9.43k|} regparse.c:names_clear: 515| 62.0k|{ 516| 62.0k| NameTable* t = (NameTable* )reg->name_table; 517| | 518| 62.0k| if (IS_NOT_NULL(t)) { ------------------ | | 306| 62.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 1.34k, False: 60.6k] | | ------------------ ------------------ 519| 1.34k| onig_st_foreach(t, i_free_name_entry, 0); 520| 1.34k| } 521| 62.0k| return 0; 522| 62.0k|} regparse.c:i_free_name_entry: 505| 5.39k|{ 506| 5.39k| xfree(e->name); ------------------ | | 145| 5.39k|# define xfree free ------------------ 507| 5.39k| if (IS_NOT_NULL(e->back_refs)) xfree(e->back_refs); ------------------ | | 306| 5.39k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 5.39k] | | ------------------ ------------------ if (IS_NOT_NULL(e->back_refs)) xfree(e->back_refs); ------------------ | | 145| 0|# define xfree free ------------------ 508| 5.39k| xfree(key); ------------------ | | 145| 5.39k|# define xfree free ------------------ 509| 5.39k| xfree(e); ------------------ | | 145| 5.39k|# define xfree free ------------------ 510| 5.39k| return ST_DELETE; 511| 5.39k|} regparse.c:name_find: 541| 5.39k|{ 542| 5.39k| NameEntry* e; 543| 5.39k| NameTable* t = (NameTable* )reg->name_table; 544| | 545| 5.39k| e = (NameEntry* )NULL; 546| 5.39k| if (IS_NOT_NULL(t)) { ------------------ | | 306| 5.39k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 4.04k, False: 1.34k] | | ------------------ ------------------ 547| 4.04k| onig_st_lookup_strend(t, name, name_end, (HashDataType* )((void* )(&e))); 548| 4.04k| } 549| 5.39k| return e; 550| 5.39k|} regparse.c:bbuf_free: 135| 35.0k|{ 136| 35.0k| if (IS_NOT_NULL(bbuf)) { ------------------ | | 306| 35.0k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 17.5k, False: 17.5k] | | ------------------ ------------------ 137| 17.5k| if (IS_NOT_NULL(bbuf->p)) xfree(bbuf->p); ------------------ | | 306| 17.5k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 17.5k, False: 0] | | ------------------ ------------------ if (IS_NOT_NULL(bbuf->p)) xfree(bbuf->p); ------------------ | | 145| 17.5k|# define xfree free ------------------ 138| 17.5k| xfree(bbuf); ------------------ | | 145| 17.5k|# define xfree free ------------------ 139| 17.5k| } 140| 35.0k|} regparse.c:node_new_list: 1175| 133k|{ 1176| 133k| Node* node = node_new(); 1177| 133k| CHECK_NULL_RETURN(node); ------------------ | | 307| 133k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 305| 133k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 133k] | | | | ------------------ | | ------------------ ------------------ 1178| | 1179| 133k| SET_NTYPE(node, NT_LIST); ------------------ | | 71| 133k| do { \ | | 72| 133k| int value = ntype; \ | | 73| 133k| memcpy(&((node)->u.base.type), &value, sizeof(int)); \ | | 74| 133k| } while (0) | | ------------------ | | | Branch (74:14): [Folded - Ignored] | | ------------------ ------------------ 1180| 133k| NCAR(node) = left; ------------------ | | 86| 133k|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 133k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1181| 133k| NCDR(node) = right; ------------------ | | 87| 133k|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 133k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 1182| 133k| return node; 1183| 133k|} regparse.c:node_new: 1122| 361k|{ 1123| 361k| Node* node; 1124| | 1125| 361k| node = (Node* )xmalloc(sizeof(Node)); ------------------ | | 142| 361k|# define xmalloc malloc ------------------ 1126| | /* xmemset(node, 0, sizeof(Node)); */ 1127| 361k| return node; 1128| 361k|} regparse.c:node_new_enclose: 1331| 25.6k|{ 1332| 25.6k| Node* node = node_new(); 1333| 25.6k| CHECK_NULL_RETURN(node); ------------------ | | 307| 25.6k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 305| 25.6k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 25.6k] | | | | ------------------ | | ------------------ ------------------ 1334| | 1335| 25.6k| SET_NTYPE(node, NT_ENCLOSE); ------------------ | | 71| 25.6k| do { \ | | 72| 25.6k| int value = ntype; \ | | 73| 25.6k| memcpy(&((node)->u.base.type), &value, sizeof(int)); \ | | 74| 25.6k| } while (0) | | ------------------ | | | Branch (74:14): [Folded - Ignored] | | ------------------ ------------------ 1336| 25.6k| NENCLOSE(node)->type = type; ------------------ | | 81| 25.6k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1337| 25.6k| NENCLOSE(node)->state = 0; ------------------ | | 81| 25.6k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1338| 25.6k| NENCLOSE(node)->regnum = 0; ------------------ | | 81| 25.6k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1339| 25.6k| NENCLOSE(node)->option = 0; ------------------ | | 81| 25.6k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1340| 25.6k| NENCLOSE(node)->target = NULL; ------------------ | | 81| 25.6k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1341| 25.6k| NENCLOSE(node)->call_addr = -1; ------------------ | | 81| 25.6k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1342| 25.6k| NENCLOSE(node)->opt_count = 0; ------------------ | | 81| 25.6k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1343| 25.6k| return node; 1344| 25.6k|} regparse.c:strcat_capa_from_static: 342| 5.39k|{ 343| 5.39k| UChar* r; ------------------ | | 76| 5.39k|# define UChar OnigUChar ------------------ 344| | 345| 5.39k| r = (UChar* )xmalloc(capa + 1); ------------------ | | 142| 5.39k|# define xmalloc malloc ------------------ 346| 5.39k| CHECK_NULL_RETURN(r); ------------------ | | 307| 5.39k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 305| 5.39k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 5.39k] | | | | ------------------ | | ------------------ ------------------ 347| 5.39k| onig_strcpy(r, dest, dest_end); 348| 5.39k| onig_strcpy(r + (dest_end - dest), src, src_end); 349| 5.39k| return r; 350| 5.39k|} regparse.c:strcat_capa: 325| 75.4k|{ 326| 75.4k| UChar* r; ------------------ | | 76| 75.4k|# define UChar OnigUChar ------------------ 327| | 328| 75.4k| if (dest) ------------------ | Branch (328:7): [True: 75.4k, False: 0] ------------------ 329| 75.4k| r = (UChar* )xrealloc(dest, capa + 1); ------------------ | | 143| 75.4k|# define xrealloc realloc ------------------ 330| 0| else 331| 0| r = (UChar* )xmalloc(capa + 1); ------------------ | | 142| 0|# define xmalloc malloc ------------------ 332| | 333| 75.4k| CHECK_NULL_RETURN(r); ------------------ | | 307| 75.4k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 305| 75.4k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 75.4k] | | | | ------------------ | | ------------------ ------------------ 334| 75.4k| onig_strcpy(r + (dest_end - dest), src, src_end); 335| 75.4k| return r; 336| 75.4k|} regparse.c:node_new_str: 1464| 57.9k|{ 1465| 57.9k| Node* node = node_new(); 1466| 57.9k| CHECK_NULL_RETURN(node); ------------------ | | 307| 57.9k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 305| 57.9k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 57.9k] | | | | ------------------ | | ------------------ ------------------ 1467| | 1468| 57.9k| SET_NTYPE(node, NT_STR); ------------------ | | 71| 57.9k| do { \ | | 72| 57.9k| int value = ntype; \ | | 73| 57.9k| memcpy(&((node)->u.base.type), &value, sizeof(int)); \ | | 74| 57.9k| } while (0) | | ------------------ | | | Branch (74:14): [Folded - Ignored] | | ------------------ ------------------ 1469| 57.9k| NSTR(node)->capa = 0; ------------------ | | 76| 57.9k|#define NSTR(node) (&((node)->u.str)) ------------------ 1470| 57.9k| NSTR(node)->flag = 0; ------------------ | | 76| 57.9k|#define NSTR(node) (&((node)->u.str)) ------------------ 1471| 57.9k| NSTR(node)->s = NSTR(node)->buf; ------------------ | | 76| 57.9k|#define NSTR(node) (&((node)->u.str)) ------------------ NSTR(node)->s = NSTR(node)->buf; ------------------ | | 76| 57.9k|#define NSTR(node) (&((node)->u.str)) ------------------ 1472| 57.9k| NSTR(node)->end = NSTR(node)->buf; ------------------ | | 76| 57.9k|#define NSTR(node) (&((node)->u.str)) ------------------ NSTR(node)->end = NSTR(node)->buf; ------------------ | | 76| 57.9k|#define NSTR(node) (&((node)->u.str)) ------------------ 1473| 57.9k| if (onig_node_str_cat(node, s, end)) { ------------------ | Branch (1473:7): [True: 0, False: 57.9k] ------------------ 1474| 0| onig_node_free(node); 1475| 0| return NULL; 1476| 0| } 1477| 57.9k| return node; 1478| 57.9k|} regparse.c:scan_env_clear: 984| 31.0k|{ 985| 31.0k| int i; 986| | 987| 31.0k| BIT_STATUS_CLEAR(env->capture_history); ------------------ | | 362| 31.0k|#define BIT_STATUS_CLEAR(stats) (stats) = 0 ------------------ 988| 31.0k| BIT_STATUS_CLEAR(env->bt_mem_start); ------------------ | | 362| 31.0k|#define BIT_STATUS_CLEAR(stats) (stats) = 0 ------------------ 989| 31.0k| BIT_STATUS_CLEAR(env->bt_mem_end); ------------------ | | 362| 31.0k|#define BIT_STATUS_CLEAR(stats) (stats) = 0 ------------------ 990| 31.0k| BIT_STATUS_CLEAR(env->backrefed_mem); ------------------ | | 362| 31.0k|#define BIT_STATUS_CLEAR(stats) (stats) = 0 ------------------ 991| 31.0k| env->error = (UChar* )NULL; 992| 31.0k| env->error_end = (UChar* )NULL; 993| 31.0k| env->num_call = 0; 994| 31.0k| env->num_mem = 0; 995| 31.0k|#ifdef USE_NAMED_GROUP 996| 31.0k| env->num_named = 0; 997| 31.0k|#endif 998| 31.0k| env->mem_alloc = 0; 999| 31.0k| env->mem_nodes_dynamic = (Node** )NULL; 1000| | 1001| 279k| for (i = 0; i < SCANENV_MEMNODES_SIZE; i++) ------------------ | | 285| 279k|#define SCANENV_MEMNODES_SIZE 8 ------------------ | Branch (1001:15): [True: 248k, False: 31.0k] ------------------ 1002| 248k| env->mem_nodes_static[i] = NULL_NODE; ------------------ | | 283| 248k|#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| 31.0k| env->parse_depth = 0; 1011| 31.0k| env->warnings_flag = 0; 1012| 31.0k|} regparse.c:parse_regexp: 6593| 31.0k|{ 6594| 31.0k| int r; 6595| 31.0k| OnigToken tok; 6596| | 6597| 31.0k| r = fetch_token(&tok, src, end, env); 6598| 31.0k| if (r < 0) return r; ------------------ | Branch (6598:7): [True: 0, False: 31.0k] ------------------ 6599| 31.0k| r = parse_subexp(top, &tok, TK_EOT, src, end, env); 6600| 31.0k| if (r < 0) return r; ------------------ | Branch (6600:7): [True: 0, False: 31.0k] ------------------ 6601| | 6602| 31.0k|#ifdef USE_SUBEXP_CALL 6603| 31.0k| if (env->num_call > 0) { ------------------ | Branch (6603:7): [True: 0, False: 31.0k] ------------------ 6604| | /* Capture the pattern itself. It is used for (?R), (?0) and \g<0>. */ 6605| 0| const int num = 0; 6606| 0| Node* np; 6607| 0| np = node_new_enclose_memory(env->option, 0); 6608| 0| CHECK_NULL_RETURN_MEMERR(np); ------------------ | | 308| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6609| 0| NENCLOSE(np)->regnum = num; ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 6610| 0| NENCLOSE(np)->target = *top; ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 6611| 0| r = scan_env_set_mem_node(env, num, np); 6612| 0| if (r != 0) { ------------------ | Branch (6612:9): [True: 0, False: 0] ------------------ 6613| 0| onig_node_free(np); 6614| 0| return r; 6615| 0| } 6616| 0| *top = np; 6617| 0| } 6618| 31.0k|#endif 6619| 31.0k| return 0; 6620| 31.0k|} regparse.c:fetch_token: 3306| 695k|{ 3307| 695k| int r, num; 3308| 695k| OnigCodePoint c; 3309| 695k| OnigEncoding enc = env->enc; 3310| 695k| const OnigSyntaxType* syn = env->syntax; 3311| 695k| UChar* prev; ------------------ | | 76| 695k|# define UChar OnigUChar ------------------ 3312| 695k| UChar* p = *src; ------------------ | | 76| 695k|# define UChar OnigUChar ------------------ 3313| 695k| PFETCH_READY; ------------------ | | 295| 695k|# define PFETCH_READY UChar* pfetch_prev = NULL; (void)pfetch_prev | | ------------------ | | | | 76| 695k|# define UChar OnigUChar | | ------------------ ------------------ 3314| | 3315| 695k| start: 3316| 695k| if (PEND) { ------------------ | | 299| 695k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 31.0k, False: 664k] | | | Branch (299:23): [True: 664k, False: 31.0k] | | ------------------ ------------------ 3317| 31.0k| tok->type = TK_EOT; 3318| 31.0k| return tok->type; 3319| 31.0k| } 3320| | 3321| 664k| tok->type = TK_STRING; 3322| 664k| tok->base = 0; 3323| 664k| tok->backp = p; 3324| | 3325| 664k| PFETCH(c); ------------------ | | 305| 664k|#define PFETCH(c) do { \ | | 306| 664k| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 366| 664k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 664k] | | ------------------ | | 307| 664k| pfetch_prev = p; \ | | 308| 664k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 664k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 361| 664k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 664k] | | | | ------------------ | | ------------------ | | 309| 664k|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 3326| 664k| if (p > end) return ONIGERR_PREMATURE_END_OF_CHAR_CLASS; ------------------ | | 645| 0|#define ONIGERR_PREMATURE_END_OF_CHAR_CLASS -103 ------------------ | Branch (3326:6): [True: 0, False: 664k] ------------------ 3327| 664k| if (IS_MC_ESC_CODE(c, syn)) { ------------------ | | 763| 664k| ((code) == MC_ESC(syn) && \ | | ------------------ | | | | 755| 1.32M|#define MC_ESC(syn) (syn)->meta_char_table.esc | | ------------------ | | | Branch (763:4): [True: 24.2k, False: 640k] | | ------------------ | | 764| 664k| !IS_SYNTAX_OP2((syn), ONIG_SYN_OP2_INEFFECTIVE_ESCAPE)) | | ------------------ | | | | 331| 24.2k|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (764:4): [True: 24.2k, False: 0] | | ------------------ ------------------ 3328| 24.2k| if (PEND) return ONIGERR_END_PATTERN_AT_ESCAPE; ------------------ | | 299| 24.2k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 24.2k] | | | Branch (299:23): [True: 24.2k, False: 0] | | ------------------ ------------------ if (PEND) return ONIGERR_END_PATTERN_AT_ESCAPE; ------------------ | | 646| 0|#define ONIGERR_END_PATTERN_AT_ESCAPE -104 ------------------ 3329| | 3330| 24.2k| tok->backp = p; 3331| 24.2k| PFETCH(c); ------------------ | | 305| 24.2k|#define PFETCH(c) do { \ | | 306| 24.2k| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 366| 24.2k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 24.2k] | | ------------------ | | 307| 24.2k| pfetch_prev = p; \ | | 308| 24.2k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 24.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)) | | | | ------------------ | | | | | | 361| 24.2k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 24.2k] | | | | ------------------ | | ------------------ | | 309| 24.2k|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 3332| | 3333| 24.2k| tok->u.c = c; 3334| 24.2k| tok->escaped = 1; 3335| 24.2k| switch (c) { 3336| 0| case '*': ------------------ | Branch (3336:5): [True: 0, False: 24.2k] ------------------ 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; ------------------ | | 415| 0|#define REPEAT_INFINITE -1 ------------------ 3341| 0| goto greedy_check; 3342| 0| break; 3343| | 3344| 0| case '+': ------------------ | Branch (3344:5): [True: 0, False: 24.2k] ------------------ 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; ------------------ | | 415| 0|#define REPEAT_INFINITE -1 ------------------ 3349| 0| goto greedy_check; 3350| 0| break; 3351| | 3352| 0| case '?': ------------------ | Branch (3352:5): [True: 0, False: 24.2k] ------------------ 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| 40.4k| greedy_check: 3358| 40.4k| if (!PEND && PPEEK_IS('?') && ------------------ | | 299| 80.8k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 36.3k, False: 4.04k] | | ------------------ ------------------ if (!PEND && PPEEK_IS('?') && ------------------ | | 320| 76.8k|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 36.3k|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 366| 36.3k|#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: 36.3k, False: 0] | | | | ------------------ | | ------------------ | | | Branch (320:22): [True: 1.34k, False: 35.0k] | | ------------------ ------------------ | Branch (3358:11): [True: 36.3k, False: 4.04k] ------------------ 3359| 40.4k| IS_SYNTAX_OP(syn, ONIG_SYN_OP_QMARK_NON_GREEDY)) { ------------------ | | 330| 1.34k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) | | ------------------ | | | Branch (330:35): [True: 1.34k, False: 0] | | ------------------ ------------------ 3360| 1.34k| PFETCH(c); ------------------ | | 305| 1.34k|#define PFETCH(c) do { \ | | 306| 1.34k| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 366| 1.34k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 1.34k] | | ------------------ | | 307| 1.34k| pfetch_prev = p; \ | | 308| 1.34k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 1.34k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 361| 1.34k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 1.34k] | | | | ------------------ | | ------------------ | | 309| 1.34k|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 3361| 1.34k| tok->u.repeat.greedy = 0; 3362| 1.34k| tok->u.repeat.possessive = 0; 3363| 1.34k| } 3364| 39.0k| else { 3365| 39.0k| possessive_check: 3366| 39.0k| if (!PEND && PPEEK_IS('+') && ------------------ | | 299| 78.1k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 35.0k, False: 4.04k] | | ------------------ ------------------ if (!PEND && PPEEK_IS('+') && ------------------ | | 320| 74.1k|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 35.0k|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 366| 35.0k|#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: 35.0k, False: 0] | | | | ------------------ | | ------------------ | | | Branch (320:22): [True: 0, False: 35.0k] | | ------------------ ------------------ | Branch (3366:6): [True: 35.0k, False: 4.04k] ------------------ 3367| 39.0k| ((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)); \ | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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| 39.0k| else { 3376| 39.0k| tok->u.repeat.greedy = 1; 3377| 39.0k| tok->u.repeat.possessive = 0; 3378| 39.0k| } 3379| 39.0k| } 3380| 40.4k| break; 3381| | 3382| 40.4k| case '{': ------------------ | Branch (3382:5): [True: 0, False: 24.2k] ------------------ 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: 24.2k] ------------------ 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| 2.69k| case '(': ------------------ | Branch (3401:5): [True: 2.69k, False: 21.5k] ------------------ 3402| 2.69k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_LPAREN_SUBEXP)) break; ------------------ | | 330| 2.69k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3402:11): [True: 2.69k, False: 0] ------------------ 3403| 0| tok->type = TK_SUBEXP_OPEN; 3404| 0| break; 3405| | 3406| 1.34k| case ')': ------------------ | Branch (3406:5): [True: 1.34k, False: 22.9k] ------------------ 3407| 1.34k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_LPAREN_SUBEXP)) break; ------------------ | | 330| 1.34k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3407:11): [True: 1.34k, False: 0] ------------------ 3408| 0| tok->type = TK_SUBEXP_CLOSE; 3409| 0| break; 3410| | 3411| 0| case 'w': ------------------ | Branch (3411:5): [True: 0, False: 24.2k] ------------------ 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: 24.2k] ------------------ 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.34k| case 'b': ------------------ | Branch (3425:5): [True: 1.34k, False: 22.9k] ------------------ 3426| 1.34k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_B_WORD_BOUND)) break; ------------------ | | 330| 1.34k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3426:11): [True: 0, False: 1.34k] ------------------ 3427| 1.34k| tok->type = TK_ANCHOR; 3428| 1.34k| tok->u.anchor.subtype = ANCHOR_WORD_BOUND; ------------------ | | 541| 1.34k|#define ANCHOR_WORD_BOUND (1<<6) ------------------ 3429| 1.34k| tok->u.anchor.ascii_range = IS_ASCII_RANGE(env->option) ------------------ | | 400| 2.69k|#define IS_ASCII_RANGE(option) ((option) & ONIG_OPTION_ASCII_RANGE) | | ------------------ | | | | 467| 1.34k|#define ONIG_OPTION_ASCII_RANGE (ONIG_OPTION_NOTEOS << 1) | | | | ------------------ | | | | | | 465| 1.34k|#define ONIG_OPTION_NOTEOS (ONIG_OPTION_NOTBOS << 1) | | | | | | ------------------ | | | | | | | | 464| 1.34k|#define ONIG_OPTION_NOTBOS (ONIG_OPTION_NOTEOL << 1) | | | | | | | | ------------------ | | | | | | | | | | 463| 1.34k|#define ONIG_OPTION_NOTEOL (ONIG_OPTION_NOTBOL << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 462| 1.34k|#define ONIG_OPTION_NOTBOL (ONIG_OPTION_CAPTURE_GROUP << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 460| 1.34k|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 459| 1.34k|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 458| 1.34k|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | 457| 1.34k|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | 456| 1.34k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | 455| 1.34k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | 453| 1.34k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 452| 1.34k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 451| 1.34k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (400:35): [True: 1.34k, False: 0] | | ------------------ ------------------ 3430| 1.34k| && ! IS_WORD_BOUND_ALL_RANGE(env->option); ------------------ | | 402| 2.69k|#define IS_WORD_BOUND_ALL_RANGE(option) ((option) & ONIG_OPTION_WORD_BOUND_ALL_RANGE) | | ------------------ | | | | 469| 1.34k|#define ONIG_OPTION_WORD_BOUND_ALL_RANGE (ONIG_OPTION_POSIX_BRACKET_ALL_RANGE << 1) | | | | ------------------ | | | | | | 468| 1.34k|#define ONIG_OPTION_POSIX_BRACKET_ALL_RANGE (ONIG_OPTION_ASCII_RANGE << 1) | | | | | | ------------------ | | | | | | | | 467| 1.34k|#define ONIG_OPTION_ASCII_RANGE (ONIG_OPTION_NOTEOS << 1) | | | | | | | | ------------------ | | | | | | | | | | 465| 1.34k|#define ONIG_OPTION_NOTEOS (ONIG_OPTION_NOTBOS << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 464| 1.34k|#define ONIG_OPTION_NOTBOS (ONIG_OPTION_NOTEOL << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 463| 1.34k|#define ONIG_OPTION_NOTEOL (ONIG_OPTION_NOTBOL << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 462| 1.34k|#define ONIG_OPTION_NOTBOL (ONIG_OPTION_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 460| 1.34k|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | 459| 1.34k|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | 458| 1.34k|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | 457| 1.34k|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | 456| 1.34k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 455| 1.34k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 453| 1.34k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 452| 1.34k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 451| 1.34k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ | Branch (3430:6): [True: 0, False: 1.34k] ------------------ 3431| 1.34k| break; 3432| | 3433| 0| case 'B': ------------------ | Branch (3433:5): [True: 0, False: 24.2k] ------------------ 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; ------------------ | | 542| 0|#define ANCHOR_NOT_WORD_BOUND (1<<7) ------------------ 3437| 0| tok->u.anchor.ascii_range = IS_ASCII_RANGE(env->option) ------------------ | | 400| 0|#define IS_ASCII_RANGE(option) ((option) & ONIG_OPTION_ASCII_RANGE) | | ------------------ | | | | 467| 0|#define ONIG_OPTION_ASCII_RANGE (ONIG_OPTION_NOTEOS << 1) | | | | ------------------ | | | | | | 465| 0|#define ONIG_OPTION_NOTEOS (ONIG_OPTION_NOTBOS << 1) | | | | | | ------------------ | | | | | | | | 464| 0|#define ONIG_OPTION_NOTBOS (ONIG_OPTION_NOTEOL << 1) | | | | | | | | ------------------ | | | | | | | | | | 463| 0|#define ONIG_OPTION_NOTEOL (ONIG_OPTION_NOTBOL << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 462| 0|#define ONIG_OPTION_NOTBOL (ONIG_OPTION_CAPTURE_GROUP << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 460| 0|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 459| 0|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 458| 0|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | 457| 0|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | 456| 0|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | 455| 0|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | 453| 0|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 452| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 451| 0|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (400:35): [True: 0, False: 0] | | ------------------ ------------------ 3438| 0| && ! IS_WORD_BOUND_ALL_RANGE(env->option); ------------------ | | 402| 0|#define IS_WORD_BOUND_ALL_RANGE(option) ((option) & ONIG_OPTION_WORD_BOUND_ALL_RANGE) | | ------------------ | | | | 469| 0|#define ONIG_OPTION_WORD_BOUND_ALL_RANGE (ONIG_OPTION_POSIX_BRACKET_ALL_RANGE << 1) | | | | ------------------ | | | | | | 468| 0|#define ONIG_OPTION_POSIX_BRACKET_ALL_RANGE (ONIG_OPTION_ASCII_RANGE << 1) | | | | | | ------------------ | | | | | | | | 467| 0|#define ONIG_OPTION_ASCII_RANGE (ONIG_OPTION_NOTEOS << 1) | | | | | | | | ------------------ | | | | | | | | | | 465| 0|#define ONIG_OPTION_NOTEOS (ONIG_OPTION_NOTBOS << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 464| 0|#define ONIG_OPTION_NOTBOS (ONIG_OPTION_NOTEOL << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 463| 0|#define ONIG_OPTION_NOTEOL (ONIG_OPTION_NOTBOL << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 462| 0|#define ONIG_OPTION_NOTBOL (ONIG_OPTION_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 460| 0|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | 459| 0|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | 458| 0|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | 457| 0|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | 456| 0|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 455| 0|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 453| 0|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 452| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 451| 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: 24.2k] ------------------ 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; ------------------ | | 543| 0|#define ANCHOR_WORD_BEGIN (1<<8) ------------------ 3446| 0| tok->u.anchor.ascii_range = IS_ASCII_RANGE(env->option); ------------------ | | 400| 0|#define IS_ASCII_RANGE(option) ((option) & ONIG_OPTION_ASCII_RANGE) | | ------------------ | | | | 467| 0|#define ONIG_OPTION_ASCII_RANGE (ONIG_OPTION_NOTEOS << 1) | | | | ------------------ | | | | | | 465| 0|#define ONIG_OPTION_NOTEOS (ONIG_OPTION_NOTBOS << 1) | | | | | | ------------------ | | | | | | | | 464| 0|#define ONIG_OPTION_NOTBOS (ONIG_OPTION_NOTEOL << 1) | | | | | | | | ------------------ | | | | | | | | | | 463| 0|#define ONIG_OPTION_NOTEOL (ONIG_OPTION_NOTBOL << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 462| 0|#define ONIG_OPTION_NOTBOL (ONIG_OPTION_CAPTURE_GROUP << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 460| 0|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 459| 0|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 458| 0|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | 457| 0|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | 456| 0|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | 455| 0|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | 453| 0|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 452| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 451| 0|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 3447| 0| break; 3448| | 3449| 0| case '>': ------------------ | Branch (3449:5): [True: 0, False: 24.2k] ------------------ 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; ------------------ | | 544| 0|#define ANCHOR_WORD_END (1<<9) ------------------ 3453| 0| tok->u.anchor.ascii_range = IS_ASCII_RANGE(env->option); ------------------ | | 400| 0|#define IS_ASCII_RANGE(option) ((option) & ONIG_OPTION_ASCII_RANGE) | | ------------------ | | | | 467| 0|#define ONIG_OPTION_ASCII_RANGE (ONIG_OPTION_NOTEOS << 1) | | | | ------------------ | | | | | | 465| 0|#define ONIG_OPTION_NOTEOS (ONIG_OPTION_NOTBOS << 1) | | | | | | ------------------ | | | | | | | | 464| 0|#define ONIG_OPTION_NOTBOS (ONIG_OPTION_NOTEOL << 1) | | | | | | | | ------------------ | | | | | | | | | | 463| 0|#define ONIG_OPTION_NOTEOL (ONIG_OPTION_NOTBOL << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 462| 0|#define ONIG_OPTION_NOTBOL (ONIG_OPTION_CAPTURE_GROUP << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 460| 0|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 459| 0|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 458| 0|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | 457| 0|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | 456| 0|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | 455| 0|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | 453| 0|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 452| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 451| 0|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 3454| 0| break; 3455| 0|#endif 3456| | 3457| 6.74k| case 's': ------------------ | Branch (3457:5): [True: 6.74k, False: 17.5k] ------------------ 3458| 6.74k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_S_WHITE_SPACE)) break; ------------------ | | 330| 6.74k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3458:11): [True: 0, False: 6.74k] ------------------ 3459| 6.74k| tok->type = TK_CHAR_TYPE; 3460| 6.74k| tok->u.prop.ctype = ONIGENC_CTYPE_SPACE; ------------------ | | 303| 6.74k|#define ONIGENC_CTYPE_SPACE 9 ------------------ 3461| 6.74k| tok->u.prop.not = 0; 3462| 6.74k| break; 3463| | 3464| 0| case 'S': ------------------ | Branch (3464:5): [True: 0, False: 24.2k] ------------------ 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| 5.39k| case 'd': ------------------ | Branch (3471:5): [True: 5.39k, False: 18.8k] ------------------ 3472| 5.39k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_D_DIGIT)) break; ------------------ | | 330| 5.39k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3472:11): [True: 0, False: 5.39k] ------------------ 3473| 5.39k| tok->type = TK_CHAR_TYPE; 3474| 5.39k| tok->u.prop.ctype = ONIGENC_CTYPE_DIGIT; ------------------ | | 298| 5.39k|#define ONIGENC_CTYPE_DIGIT 4 ------------------ 3475| 5.39k| tok->u.prop.not = 0; 3476| 5.39k| break; 3477| | 3478| 0| case 'D': ------------------ | Branch (3478:5): [True: 0, False: 24.2k] ------------------ 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: 24.2k] ------------------ 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: 24.2k] ------------------ 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: 24.2k] ------------------ 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; ------------------ | | 534| 0|#define ANCHOR_BEGIN_BUF (1<<0) ------------------ 3504| 0| break; 3505| | 3506| 0| case 'Z': ------------------ | Branch (3506:5): [True: 0, False: 24.2k] ------------------ 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; ------------------ | | 538| 0|#define ANCHOR_SEMI_END_BUF (1<<4) ------------------ 3510| 0| break; 3511| | 3512| 0| case 'z': ------------------ | Branch (3512:5): [True: 0, False: 24.2k] ------------------ 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; ------------------ | | 537| 0|#define ANCHOR_END_BUF (1<<3) ------------------ 3517| 0| break; 3518| | 3519| 0| case 'G': ------------------ | Branch (3519:5): [True: 0, False: 24.2k] ------------------ 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; ------------------ | | 536| 0|#define ANCHOR_BEGIN_POSITION (1<<2) ------------------ 3523| 0| break; 3524| | 3525| 0| case '`': ------------------ | Branch (3525:5): [True: 0, False: 24.2k] ------------------ 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: 24.2k] ------------------ 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: 24.2k] ------------------ 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) | | | | ------------------ | | | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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; ------------------ | | 691| 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)) ------------------ | | 399| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_XDIGIT) | | ------------------ | | | | 372| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (372:48): [True: 0, False: 0] | | | | | Branch (372:69): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 3545| 0| return ONIGERR_TOO_LONG_WIDE_CHAR_VALUE; ------------------ | | 678| 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)) | | ------------------ | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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) | | | | ------------------ | | | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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; ------------------ | | 666| 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: 24.2k] ------------------ 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; ------------------ | | 677| 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; ------------------ | | 666| 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: 24.2k] ------------------ 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) | | | | ------------------ | | | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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; ------------------ | | 691| 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) | | ------------------ | | | | 366| 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') ------------------ | | 397| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_DIGIT) | | ------------------ | | | | 372| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (372:48): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ | Branch (3597:41): [True: 0, False: 0] ------------------ 3598| 0| return ONIGERR_TOO_LONG_WIDE_CHAR_VALUE; ------------------ | | 678| 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)) | | ------------------ | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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) | | | | ------------------ | | | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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: 24.2k] | Branch (3613:15): [True: 0, False: 24.2k] | Branch (3613:25): [True: 0, False: 24.2k] | Branch (3613:35): [True: 0, False: 24.2k] ------------------ 3614| 0| case '5': case '6': case '7': case '8': case '9': ------------------ | Branch (3614:5): [True: 0, False: 24.2k] | Branch (3614:15): [True: 0, False: 24.2k] | Branch (3614:25): [True: 0, False: 24.2k] | Branch (3614:35): [True: 0, False: 24.2k] | Branch (3614:45): [True: 0, False: 24.2k] ------------------ 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) { ------------------ | | 439| 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])) ------------------ | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 0] | | | Branch (305:49): [True: 0, False: 0] | | ------------------ ------------------ | Branch (3625:8): [True: 0, False: 0] ------------------ 3626| 0| return ONIGERR_INVALID_BACKREF; ------------------ | | 674| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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: 24.2k] ------------------ 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; ------------------ | | 666| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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: 24.2k] ------------------ 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)); \ | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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: 24.2k] ------------------ 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)); \ | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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)); \ | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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) | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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) | | | | ------------------ | | | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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: 24.2k] ------------------ 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: 24.2k] ------------------ 3743| 0| case 'P': ------------------ | Branch (3743:5): [True: 0, False: 24.2k] ------------------ 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) | | | | ------------------ | | | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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)); \ | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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: 24.2k] ------------------ 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: 24.2k] ------------------ 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: 24.2k] ------------------ 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| 6.74k| default: ------------------ | Branch (3782:5): [True: 6.74k, False: 17.5k] ------------------ 3783| 6.74k| { 3784| 6.74k| OnigCodePoint c2; 3785| | 3786| 6.74k| PUNFETCH; ------------------ | | 300| 6.74k|#define PUNFETCH p = pfetch_prev ------------------ 3787| 6.74k| num = fetch_escaped_value(&p, end, env, &c2); 3788| 6.74k| if (num < 0) return num; ------------------ | Branch (3788:6): [True: 0, False: 6.74k] ------------------ 3789| | /* set_raw: */ 3790| 6.74k| if ((OnigCodePoint )tok->u.c != c2) { ------------------ | Branch (3790:6): [True: 0, False: 6.74k] ------------------ 3791| 0| tok->type = TK_CODE_POINT; 3792| 0| tok->u.code = (OnigCodePoint )c2; 3793| 0| } 3794| 6.74k| else { /* string */ 3795| 6.74k| p = tok->backp + enclen(enc, tok->backp, end); ------------------ | | 93| 6.74k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | ------------------ | | | | 361| 6.74k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 6.74k] | | ------------------ ------------------ 3796| 6.74k| } 3797| 6.74k| } 3798| 0| break; 3799| 24.2k| } 3800| 24.2k| } 3801| 640k| else { 3802| 640k| tok->u.c = c; 3803| 640k| tok->escaped = 0; 3804| | 3805| 640k|#ifdef USE_VARIABLE_META_CHARS 3806| 640k| if ((c != ONIG_INEFFECTIVE_META_CHAR) && ------------------ | | 619| 640k|#define ONIG_INEFFECTIVE_META_CHAR 0 ------------------ | Branch (3806:9): [True: 640k, False: 0] ------------------ 3807| 640k| IS_SYNTAX_OP(syn, ONIG_SYN_OP_VARIABLE_META_CHARACTERS)) { ------------------ | | 330| 640k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) | | ------------------ | | | Branch (330:35): [True: 0, False: 640k] | | ------------------ ------------------ 3808| 0| if (c == MC_ANYCHAR(syn)) ------------------ | | 756| 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)) ------------------ | | 757| 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)) ------------------ | | 758| 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)) ------------------ | | 759| 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)) { ------------------ | | 760| 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| 640k|#endif 3822| | 3823| 640k| switch (c) { 3824| 13.4k| case '.': ------------------ | Branch (3824:5): [True: 13.4k, False: 626k] ------------------ 3825| 13.4k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_DOT_ANYCHAR)) break; ------------------ | | 330| 13.4k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3825:11): [True: 0, False: 13.4k] ------------------ 3826| 13.4k|#ifdef USE_VARIABLE_META_CHARS 3827| 13.4k| any_char: 3828| 13.4k|#endif 3829| 13.4k| tok->type = TK_ANYCHAR; 3830| 13.4k| break; 3831| | 3832| 14.8k| case '*': ------------------ | Branch (3832:5): [True: 14.8k, False: 625k] ------------------ 3833| 14.8k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ASTERISK_ZERO_INF)) break; ------------------ | | 330| 14.8k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3833:11): [True: 0, False: 14.8k] ------------------ 3834| 14.8k|#ifdef USE_VARIABLE_META_CHARS 3835| 14.8k| anytime: 3836| 14.8k|#endif 3837| 14.8k| tok->type = TK_OP_REPEAT; 3838| 14.8k| tok->u.repeat.lower = 0; 3839| 14.8k| tok->u.repeat.upper = REPEAT_INFINITE; ------------------ | | 415| 14.8k|#define REPEAT_INFINITE -1 ------------------ 3840| 14.8k| goto greedy_check; 3841| 0| break; 3842| | 3843| 24.2k| case '+': ------------------ | Branch (3843:5): [True: 24.2k, False: 616k] ------------------ 3844| 24.2k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_PLUS_ONE_INF)) break; ------------------ | | 330| 24.2k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3844:11): [True: 0, False: 24.2k] ------------------ 3845| 24.2k|#ifdef USE_VARIABLE_META_CHARS 3846| 24.2k| one_or_more_time: 3847| 24.2k|#endif 3848| 24.2k| tok->type = TK_OP_REPEAT; 3849| 24.2k| tok->u.repeat.lower = 1; 3850| 24.2k| tok->u.repeat.upper = REPEAT_INFINITE; ------------------ | | 415| 24.2k|#define REPEAT_INFINITE -1 ------------------ 3851| 24.2k| goto greedy_check; 3852| 0| break; 3853| | 3854| 1.34k| case '?': ------------------ | Branch (3854:5): [True: 1.34k, False: 638k] ------------------ 3855| 1.34k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_QMARK_ZERO_ONE)) break; ------------------ | | 330| 1.34k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3855:11): [True: 0, False: 1.34k] ------------------ 3856| 1.34k|#ifdef USE_VARIABLE_META_CHARS 3857| 1.34k| zero_or_one_time: 3858| 1.34k|#endif 3859| 1.34k| tok->type = TK_OP_REPEAT; 3860| 1.34k| tok->u.repeat.lower = 0; 3861| 1.34k| tok->u.repeat.upper = 1; 3862| 1.34k| goto greedy_check; 3863| 0| break; 3864| | 3865| 0| case '{': ------------------ | Branch (3865:5): [True: 0, False: 640k] ------------------ 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| 10.7k| case '|': ------------------ | Branch (3879:5): [True: 10.7k, False: 629k] ------------------ 3880| 10.7k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_VBAR_ALT)) break; ------------------ | | 330| 10.7k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (3880:11): [True: 0, False: 10.7k] ------------------ 3881| 10.7k| tok->type = TK_ALT; 3882| 10.7k| break; 3883| | 3884| 16.1k| case '(': ------------------ | Branch (3884:5): [True: 16.1k, False: 624k] ------------------ 3885| 16.1k| if (PPEEK_IS('?') && ------------------ | | 320| 32.3k|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 16.1k|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 366| 16.1k|#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: 16.1k, False: 0] | | | | ------------------ | | ------------------ | | | Branch (320:22): [True: 14.8k, False: 1.34k] | | ------------------ ------------------ 3886| 16.1k| IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_QMARK_GROUP_EFFECT)) { ------------------ | | 331| 14.8k|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 14.8k, False: 0] | | ------------------ ------------------ 3887| 14.8k| PINC; ------------------ | | 301| 14.8k|#define PINC do { \ | | 302| 14.8k| pfetch_prev = p; \ | | 303| 14.8k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 14.8k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 361| 14.8k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 14.8k] | | | | ------------------ | | ------------------ | | 304| 14.8k|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 3888| 14.8k| if (PPEEK_IS('#')) { ------------------ | | 320| 14.8k|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 14.8k|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 366| 14.8k|#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: 14.8k, False: 0] | | | | ------------------ | | ------------------ | | | Branch (320:22): [True: 0, False: 14.8k] | | ------------------ ------------------ 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)); \ | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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; ------------------ | | 659| 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)); \ | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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)) { ------------------ | | 755| 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)); \ | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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| 14.8k|#ifdef USE_PERL_SUBEXP_CALL 3903| | /* (?&name), (?n), (?R), (?0), (?+n), (?-n) */ 3904| 14.8k| c = PPEEK; ------------------ | | 319| 14.8k|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | ------------------ | | | | 366| 14.8k|#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: 14.8k, False: 0] | | ------------------ ------------------ 3905| 14.8k| if ((c == '&' || c == 'R' || ONIGENC_IS_CODE_DIGIT(enc, c)) && ------------------ | | 397| 14.8k| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_DIGIT) | | ------------------ | | | | 372| 14.8k|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (372:48): [True: 0, False: 14.8k] | | | | ------------------ | | ------------------ ------------------ | Branch (3905:7): [True: 0, False: 14.8k] | Branch (3905:19): [True: 0, False: 14.8k] ------------------ 3906| 14.8k| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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) | | | | ------------------ | | | | | | 366| 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; ------------------ | | 680| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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| 14.8k| else if ((c == '-' || c == '+') && ------------------ | Branch (3941:12): [True: 0, False: 14.8k] | Branch (3941:24): [True: 0, False: 14.8k] ------------------ 3942| 14.8k| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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) | | ------------------ | | | | 366| 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)) { ------------------ | | 397| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_DIGIT) | | ------------------ | | | | 372| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (372: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| 14.8k|#endif /* USE_PERL_SUBEXP_CALL */ 3967| 14.8k|#ifdef USE_CAPITAL_P_NAMED_GROUP 3968| 14.8k| if (PPEEK_IS('P') && ------------------ | | 320| 29.6k|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 14.8k|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 366| 14.8k|#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: 14.8k, False: 0] | | | | ------------------ | | ------------------ | | | Branch (320:22): [True: 0, False: 14.8k] | | ------------------ ------------------ 3969| 14.8k| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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; ------------------ | | 660| 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)); \ | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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| 14.8k|#endif /* USE_CAPITAL_P_NAMED_GROUP */ 3997| 14.8k| PUNFETCH; ------------------ | | 300| 14.8k|#define PUNFETCH p = pfetch_prev ------------------ 3998| 14.8k| } 3999| | 4000| 16.1k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_LPAREN_SUBEXP)) break; ------------------ | | 330| 16.1k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (4000:11): [True: 0, False: 16.1k] ------------------ 4001| 16.1k| tok->type = TK_SUBEXP_OPEN; 4002| 16.1k| break; 4003| | 4004| 16.1k| case ')': ------------------ | Branch (4004:5): [True: 16.1k, False: 624k] ------------------ 4005| 16.1k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_LPAREN_SUBEXP)) break; ------------------ | | 330| 16.1k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (4005:11): [True: 0, False: 16.1k] ------------------ 4006| 16.1k| tok->type = TK_SUBEXP_CLOSE; 4007| 16.1k| break; 4008| | 4009| 26.9k| case '^': ------------------ | Branch (4009:5): [True: 26.9k, False: 613k] ------------------ 4010| 26.9k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_LINE_ANCHOR)) break; ------------------ | | 330| 26.9k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (4010:11): [True: 0, False: 26.9k] ------------------ 4011| 26.9k| tok->type = TK_ANCHOR; 4012| 26.9k| tok->u.anchor.subtype = (IS_SINGLELINE(env->option) ------------------ | | 388| 26.9k|#define IS_SINGLELINE(option) ((option) & ONIG_OPTION_SINGLELINE) | | ------------------ | | | | 455| 26.9k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | ------------------ | | | | | | 453| 26.9k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | ------------------ | | | | | | | | 452| 26.9k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | ------------------ | | | | | | | | | | 451| 26.9k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (388:35): [True: 0, False: 26.9k] | | ------------------ ------------------ 4013| 26.9k| ? ANCHOR_BEGIN_BUF : ANCHOR_BEGIN_LINE); ------------------ | | 534| 0|#define ANCHOR_BEGIN_BUF (1<<0) ------------------ ? ANCHOR_BEGIN_BUF : ANCHOR_BEGIN_LINE); ------------------ | | 535| 26.9k|#define ANCHOR_BEGIN_LINE (1<<1) ------------------ 4014| 26.9k| break; 4015| | 4016| 10.7k| case '$': ------------------ | Branch (4016:5): [True: 10.7k, False: 629k] ------------------ 4017| 10.7k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_LINE_ANCHOR)) break; ------------------ | | 330| 10.7k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (4017:11): [True: 0, False: 10.7k] ------------------ 4018| 10.7k| tok->type = TK_ANCHOR; 4019| 10.7k| tok->u.anchor.subtype = (IS_SINGLELINE(env->option) ------------------ | | 388| 10.7k|#define IS_SINGLELINE(option) ((option) & ONIG_OPTION_SINGLELINE) | | ------------------ | | | | 455| 10.7k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | ------------------ | | | | | | 453| 10.7k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | ------------------ | | | | | | | | 452| 10.7k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | ------------------ | | | | | | | | | | 451| 10.7k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (388:35): [True: 0, False: 10.7k] | | ------------------ ------------------ 4020| 10.7k| ? ANCHOR_SEMI_END_BUF : ANCHOR_END_LINE); ------------------ | | 538| 0|#define ANCHOR_SEMI_END_BUF (1<<4) ------------------ ? ANCHOR_SEMI_END_BUF : ANCHOR_END_LINE); ------------------ | | 539| 10.7k|#define ANCHOR_END_LINE (1<<5) ------------------ 4021| 10.7k| break; 4022| | 4023| 20.2k| case '[': ------------------ | Branch (4023:5): [True: 20.2k, False: 620k] ------------------ 4024| 20.2k| if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_BRACKET_CC)) break; ------------------ | | 330| 20.2k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) ------------------ | Branch (4024:11): [True: 0, False: 20.2k] ------------------ 4025| 20.2k| tok->type = TK_CC_OPEN; 4026| 20.2k| break; 4027| | 4028| 0| case ']': ------------------ | Branch (4028:5): [True: 0, False: 640k] ------------------ 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: 640k] ------------------ 4034| 0| if (IS_EXTEND(env->option)) { ------------------ | | 391| 0|#define IS_EXTEND(option) ((option) & ONIG_OPTION_EXTEND) | | ------------------ | | | | 452| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | ------------------ | | | | | | 451| 0|#define ONIG_OPTION_IGNORECASE 1U | | | | ------------------ | | ------------------ | | | Branch (391: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)); \ | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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)) ------------------ | | 375| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_NEWLINE) | | ------------------ | | | | 372| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (372:48): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 4038| 0| break; 4039| 0| } 4040| 0| goto start; 4041| 0| break; 4042| 0| } 4043| 0| break; 4044| | 4045| 63.3k| case ' ': case '\t': case '\n': case '\r': case '\f': ------------------ | Branch (4045:5): [True: 63.3k, False: 576k] | Branch (4045:15): [True: 0, False: 640k] | Branch (4045:26): [True: 0, False: 640k] | Branch (4045:37): [True: 0, False: 640k] | Branch (4045:48): [True: 0, False: 640k] ------------------ 4046| 63.3k| if (IS_EXTEND(env->option)) ------------------ | | 391| 63.3k|#define IS_EXTEND(option) ((option) & ONIG_OPTION_EXTEND) | | ------------------ | | | | 452| 63.3k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | ------------------ | | | | | | 451| 63.3k|#define ONIG_OPTION_IGNORECASE 1U | | | | ------------------ | | ------------------ | | | Branch (391:35): [True: 0, False: 63.3k] | | ------------------ ------------------ 4047| 0| goto start; 4048| 63.3k| break; 4049| | 4050| 421k| default: ------------------ | Branch (4050:5): [True: 421k, False: 218k] ------------------ 4051| | /* string */ 4052| 421k| break; 4053| 640k| } 4054| 640k| } 4055| | 4056| 664k|#ifdef USE_VARIABLE_META_CHARS 4057| 664k| out: 4058| 664k|#endif 4059| 664k| *src = p; 4060| 664k| return tok->type; 4061| 664k|} regparse.c:get_name_end_code_point: 2495| 5.39k|{ 2496| 5.39k| switch (start) { 2497| 5.39k| case '<': return (OnigCodePoint )'>'; break; ------------------ | Branch (2497:3): [True: 5.39k, False: 0] ------------------ 2498| 0| case '\'': return (OnigCodePoint )'\''; break; ------------------ | Branch (2498:3): [True: 0, False: 5.39k] ------------------ 2499| 0| case '(': return (OnigCodePoint )')'; break; ------------------ | Branch (2499:3): [True: 0, False: 5.39k] ------------------ 2500| 0| case '{': return (OnigCodePoint )'}'; break; ------------------ | Branch (2500:3): [True: 0, False: 5.39k] ------------------ 2501| 0| default: ------------------ | Branch (2501:3): [True: 0, False: 5.39k] ------------------ 2502| 0| break; 2503| 5.39k| } 2504| | 2505| 0| return (OnigCodePoint )0; 2506| 5.39k|} regparse.c:fetch_name: 2644| 5.39k|{ 2645| 5.39k| int r, is_num, sign; 2646| 5.39k| OnigCodePoint end_code; 2647| 5.39k| OnigCodePoint c = 0; 2648| 5.39k| OnigEncoding enc = env->enc; 2649| 5.39k| UChar *name_end; ------------------ | | 76| 5.39k|# define UChar OnigUChar ------------------ 2650| 5.39k| UChar *pnum_head; ------------------ | | 76| 5.39k|# define UChar OnigUChar ------------------ 2651| 5.39k| UChar *p = *src; ------------------ | | 76| 5.39k|# define UChar OnigUChar ------------------ 2652| | 2653| 5.39k| *rback_num = 0; 2654| | 2655| 5.39k| end_code = get_name_end_code_point(start_code); 2656| | 2657| 5.39k| name_end = end; 2658| 5.39k| pnum_head = *src; 2659| 5.39k| r = 0; 2660| 5.39k| is_num = 0; 2661| 5.39k| sign = 1; 2662| 5.39k| if (PEND) { ------------------ | | 299| 5.39k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 5.39k] | | | Branch (299:23): [True: 5.39k, False: 0] | | ------------------ ------------------ 2663| 0| return ONIGERR_EMPTY_GROUP_NAME; ------------------ | | 679| 0|#define ONIGERR_EMPTY_GROUP_NAME -214 ------------------ 2664| 0| } 2665| 5.39k| else { 2666| 5.39k| PFETCH_S(c); ------------------ | | 314| 5.39k|#define PFETCH_S(c) do { \ | | 315| 5.39k| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 366| 5.39k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (315:8): [True: 0, False: 5.39k] | | ------------------ | | 316| 5.39k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 5.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)) | | | | ------------------ | | | | | | 361| 5.39k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 5.39k] | | | | ------------------ | | ------------------ | | 317| 5.39k|} while (0) | | ------------------ | | | Branch (317:10): [Folded - Ignored] | | ------------------ ------------------ 2667| 5.39k| if (c == end_code) ------------------ | Branch (2667:9): [True: 0, False: 5.39k] ------------------ 2668| 0| return ONIGERR_EMPTY_GROUP_NAME; ------------------ | | 679| 0|#define ONIGERR_EMPTY_GROUP_NAME -214 ------------------ 2669| | 2670| 5.39k| if (ONIGENC_IS_CODE_DIGIT(enc, c)) { ------------------ | | 397| 5.39k| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_DIGIT) | | ------------------ | | | | 372| 5.39k|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (372:48): [True: 0, False: 5.39k] | | | | ------------------ | | ------------------ ------------------ 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; ------------------ | | 680| 0|#define ONIGERR_INVALID_GROUP_NAME -215 ------------------ 2675| 0| is_num = 0; 2676| 0| } 2677| 0| } 2678| 5.39k| else if (c == '-') { ------------------ | Branch (2678:14): [True: 0, False: 5.39k] ------------------ 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; ------------------ | | 680| 0|#define ONIGERR_INVALID_GROUP_NAME -215 ------------------ 2686| 0| is_num = 0; 2687| 0| } 2688| 0| } 2689| 5.39k| else if (!ONIGENC_IS_CODE_NAME(enc, c)) { ------------------ | | 2512| 5.39k|# define ONIGENC_IS_CODE_NAME(enc, c) ONIGENC_IS_CODE_WORD(enc, c) | | ------------------ | | | | 401| 5.39k| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | | | ------------------ | | | | | | 372| 5.39k|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | ------------------ ------------------ | Branch (2689:14): [True: 0, False: 5.39k] ------------------ 2690| 0| r = ONIGERR_INVALID_CHAR_IN_GROUP_NAME; ------------------ | | 681| 0|#define ONIGERR_INVALID_CHAR_IN_GROUP_NAME -216 ------------------ 2691| 0| } 2692| 5.39k| } 2693| | 2694| 5.39k| if (r == 0) { ------------------ | Branch (2694:7): [True: 5.39k, False: 0] ------------------ 2695| 20.2k| while (!PEND) { ------------------ | | 299| 20.2k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 20.2k, False: 0] | | ------------------ ------------------ | Branch (2695:12): [True: 20.2k, False: 0] ------------------ 2696| 20.2k| name_end = p; 2697| 20.2k| PFETCH_S(c); ------------------ | | 314| 20.2k|#define PFETCH_S(c) do { \ | | 315| 20.2k| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 366| 20.2k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (315:8): [True: 0, False: 20.2k] | | ------------------ | | 316| 20.2k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 20.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)) | | | | ------------------ | | | | | | 361| 20.2k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 20.2k] | | | | ------------------ | | ------------------ | | 317| 20.2k|} while (0) | | ------------------ | | | Branch (317:10): [Folded - Ignored] | | ------------------ ------------------ 2698| 20.2k| if (c == end_code || c == ')') { ------------------ | Branch (2698:11): [True: 5.39k, False: 14.8k] | Branch (2698:28): [True: 0, False: 14.8k] ------------------ 2699| 5.39k| if (is_num == 2) { ------------------ | Branch (2699:6): [True: 0, False: 5.39k] ------------------ 2700| 0| r = ONIGERR_INVALID_GROUP_NAME; ------------------ | | 680| 0|#define ONIGERR_INVALID_GROUP_NAME -215 ------------------ 2701| 0| goto teardown; 2702| 0| } 2703| 5.39k| break; 2704| 5.39k| } 2705| | 2706| 14.8k| if (is_num != 0) { ------------------ | Branch (2706:11): [True: 0, False: 14.8k] ------------------ 2707| 0| if (ONIGENC_IS_CODE_DIGIT(enc, c)) { ------------------ | | 397| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_DIGIT) | | ------------------ | | | | 372| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (372:48): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 2708| 0| is_num = 1; 2709| 0| } 2710| 0| else { 2711| 0| if (!ONIGENC_IS_CODE_WORD(enc, c)) ------------------ | | 401| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | ------------------ | | | | 372| 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; ------------------ | | 681| 0|#define ONIGERR_INVALID_CHAR_IN_GROUP_NAME -216 ------------------ 2713| 0| else 2714| 0| r = ONIGERR_INVALID_GROUP_NAME; ------------------ | | 680| 0|#define ONIGERR_INVALID_GROUP_NAME -215 ------------------ 2715| 0| goto teardown; 2716| 0| } 2717| 0| } 2718| 14.8k| else { 2719| 14.8k| if (!ONIGENC_IS_CODE_NAME(enc, c)) { ------------------ | | 2512| 14.8k|# define ONIGENC_IS_CODE_NAME(enc, c) ONIGENC_IS_CODE_WORD(enc, c) | | ------------------ | | | | 401| 14.8k| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | | | ------------------ | | | | | | 372| 14.8k|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | ------------------ ------------------ | Branch (2719:6): [True: 0, False: 14.8k] ------------------ 2720| 0| r = ONIGERR_INVALID_CHAR_IN_GROUP_NAME; ------------------ | | 681| 0|#define ONIGERR_INVALID_CHAR_IN_GROUP_NAME -216 ------------------ 2721| 0| goto teardown; 2722| 0| } 2723| 14.8k| } 2724| 14.8k| } 2725| | 2726| 5.39k| if (c != end_code) { ------------------ | Branch (2726:9): [True: 0, False: 5.39k] ------------------ 2727| 0| r = ONIGERR_INVALID_GROUP_NAME; ------------------ | | 680| 0|#define ONIGERR_INVALID_GROUP_NAME -215 ------------------ 2728| 0| name_end = end; 2729| 0| goto err; 2730| 0| } 2731| | 2732| 5.39k| if (is_num != 0) { ------------------ | Branch (2732:9): [True: 0, False: 5.39k] ------------------ 2733| 0| *rback_num = onig_scan_unsigned_number(&pnum_head, name_end, enc); 2734| 0| if (*rback_num < 0) return ONIGERR_TOO_BIG_NUMBER; ------------------ | | 666| 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; ------------------ | | 680| 0|#define ONIGERR_INVALID_GROUP_NAME -215 ------------------ 2737| 0| goto err; 2738| 0| } 2739| | 2740| 0| *rback_num *= sign; 2741| 0| } 2742| | 2743| 5.39k| *rname_end = name_end; 2744| 5.39k| *src = p; 2745| 5.39k| return 0; 2746| 5.39k| } 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)); \ | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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| 5.39k|} regparse.c:fetch_escaped_value: 2422| 24.2k|{ 2423| 24.2k| int v; 2424| 24.2k| OnigCodePoint c; 2425| 24.2k| OnigEncoding enc = env->enc; 2426| 24.2k| UChar* p = *src; ------------------ | | 76| 24.2k|# define UChar OnigUChar ------------------ 2427| | 2428| 24.2k| if (PEND) return ONIGERR_END_PATTERN_AT_ESCAPE; ------------------ | | 299| 24.2k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 24.2k] | | | Branch (299:23): [True: 24.2k, False: 0] | | ------------------ ------------------ if (PEND) return ONIGERR_END_PATTERN_AT_ESCAPE; ------------------ | | 646| 0|#define ONIGERR_END_PATTERN_AT_ESCAPE -104 ------------------ 2429| | 2430| 24.2k| PFETCH_S(c); ------------------ | | 314| 24.2k|#define PFETCH_S(c) do { \ | | 315| 24.2k| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 366| 24.2k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (315:8): [True: 0, False: 24.2k] | | ------------------ | | 316| 24.2k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 24.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)) | | | | ------------------ | | | | | | 361| 24.2k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 24.2k] | | | | ------------------ | | ------------------ | | 317| 24.2k|} while (0) | | ------------------ | | | Branch (317:10): [Folded - Ignored] | | ------------------ ------------------ 2431| 24.2k| switch (c) { 2432| 0| case 'M': ------------------ | Branch (2432:3): [True: 0, False: 24.2k] ------------------ 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; ------------------ | | 647| 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)); \ | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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; ------------------ | | 649| 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; ------------------ | | 647| 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)); \ | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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)) { ------------------ | | 755| 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: 24.2k] ------------------ 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; ------------------ | | 648| 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)); \ | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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; ------------------ | | 650| 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: 24.2k] ------------------ 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; ------------------ | | 648| 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)); \ | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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)) { ------------------ | | 755| 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| 24.2k| default: ------------------ | Branch (2478:3): [True: 24.2k, False: 0] ------------------ 2479| 24.2k| { 2480| 24.2k| backslash: 2481| 24.2k| c = conv_backslash_value(c, env); 2482| 24.2k| } 2483| 24.2k| break; 2484| 24.2k| } 2485| | 2486| 24.2k| *src = p; 2487| 24.2k| *val = c; 2488| 24.2k| return 0; 2489| 24.2k|} regparse.c:conv_backslash_value: 2097| 24.2k|{ 2098| 24.2k| if (IS_SYNTAX_OP(env->syntax, ONIG_SYN_OP_ESC_CONTROL_CHARS)) { ------------------ | | 330| 24.2k|#define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0) | | ------------------ | | | Branch (330:35): [True: 24.2k, False: 0] | | ------------------ ------------------ 2099| 24.2k| switch (c) { 2100| 2.69k| case 'n': return '\n'; ------------------ | Branch (2100:5): [True: 2.69k, False: 21.5k] ------------------ 2101| 10.7k| case 't': return '\t'; ------------------ | Branch (2101:5): [True: 10.7k, False: 13.4k] ------------------ 2102| 2.69k| case 'r': return '\r'; ------------------ | Branch (2102:5): [True: 2.69k, False: 21.5k] ------------------ 2103| 0| case 'f': return '\f'; ------------------ | Branch (2103:5): [True: 0, False: 24.2k] ------------------ 2104| 0| case 'a': return '\007'; ------------------ | Branch (2104:5): [True: 0, False: 24.2k] ------------------ 2105| 0| case 'b': return '\010'; ------------------ | Branch (2105:5): [True: 0, False: 24.2k] ------------------ 2106| 0| case 'e': return '\033'; ------------------ | Branch (2106:5): [True: 0, False: 24.2k] ------------------ 2107| 0| case 'v': ------------------ | Branch (2107:5): [True: 0, False: 24.2k] ------------------ 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| 8.08k| default: ------------------ | Branch (2112:5): [True: 8.08k, False: 16.1k] ------------------ 2113| 8.08k| if (('a' <= c && c <= 'z') || ('A' <= c && c <= 'Z')) ------------------ | Branch (2113:12): [True: 0, False: 8.08k] | Branch (2113:24): [True: 0, False: 0] | Branch (2113:38): [True: 5.39k, False: 2.69k] | Branch (2113:50): [True: 0, False: 5.39k] ------------------ 2114| 0| UNKNOWN_ESC_WARN(env, c); 2115| 8.08k| break; 2116| 24.2k| } 2117| 24.2k| } 2118| 8.08k| return c; 2119| 24.2k|} regparse.c:parse_subexp: 6542| 47.1k|{ 6543| 47.1k| int r; 6544| 47.1k| Node *node, **headp; 6545| | 6546| 47.1k| *top = NULL; 6547| 47.1k| env->parse_depth++; 6548| 47.1k| if (env->parse_depth > ParseDepthLimit) ------------------ | Branch (6548:7): [True: 0, False: 47.1k] ------------------ 6549| 0| return ONIGERR_PARSE_DEPTH_LIMIT_OVER; ------------------ | | 636| 0|#define ONIGERR_PARSE_DEPTH_LIMIT_OVER -16 ------------------ 6550| 47.1k| r = parse_branch(&node, tok, term, src, end, env); 6551| 47.1k| if (r < 0) { ------------------ | Branch (6551:7): [True: 0, False: 47.1k] ------------------ 6552| 0| onig_node_free(node); 6553| 0| return r; 6554| 0| } 6555| | 6556| 47.1k| if (r == term) { ------------------ | Branch (6556:7): [True: 39.0k, False: 8.08k] ------------------ 6557| 39.0k| *top = node; 6558| 39.0k| } 6559| 8.08k| else if (r == TK_ALT) { ------------------ | Branch (6559:12): [True: 8.08k, False: 0] ------------------ 6560| 8.08k| *top = onig_node_new_alt(node, NULL); 6561| 8.08k| headp = &(NCDR(*top)); ------------------ | | 87| 8.08k|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 8.08k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 6562| 18.8k| while (r == TK_ALT) { ------------------ | Branch (6562:12): [True: 10.7k, False: 8.08k] ------------------ 6563| 10.7k| r = fetch_token(tok, src, end, env); 6564| 10.7k| if (r < 0) return r; ------------------ | Branch (6564:11): [True: 0, False: 10.7k] ------------------ 6565| 10.7k| r = parse_branch(&node, tok, term, src, end, env); 6566| 10.7k| if (r < 0) { ------------------ | Branch (6566:11): [True: 0, False: 10.7k] ------------------ 6567| 0| onig_node_free(node); 6568| 0| return r; 6569| 0| } 6570| | 6571| 10.7k| *headp = onig_node_new_alt(node, NULL); 6572| 10.7k| headp = &(NCDR(*headp)); ------------------ | | 87| 10.7k|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 10.7k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 6573| 10.7k| } 6574| | 6575| 8.08k| if (tok->type != (enum TokenSyms )term) ------------------ | Branch (6575:9): [True: 0, False: 8.08k] ------------------ 6576| 0| goto err; 6577| 8.08k| } 6578| 0| else { 6579| 0| onig_node_free(node); 6580| 0| err: 6581| 0| if (term == TK_SUBEXP_CLOSE) ------------------ | Branch (6581:9): [True: 0, False: 0] ------------------ 6582| 0| return ONIGERR_END_PATTERN_WITH_UNMATCHED_PARENTHESIS; ------------------ | | 658| 0|#define ONIGERR_END_PATTERN_WITH_UNMATCHED_PARENTHESIS -117 ------------------ 6583| 0| else 6584| 0| return ONIGERR_PARSER_BUG; ------------------ | | 631| 0|#define ONIGERR_PARSER_BUG -11 ------------------ 6585| 0| } 6586| | 6587| 47.1k| env->parse_depth--; 6588| 47.1k| return r; 6589| 47.1k|} regparse.c:parse_branch: 6499| 57.9k|{ 6500| 57.9k| int r; 6501| 57.9k| Node *node, **headp; 6502| | 6503| 57.9k| *top = NULL; 6504| 57.9k| r = parse_exp(&node, tok, term, src, end, env); 6505| 57.9k| if (r < 0) { ------------------ | Branch (6505:7): [True: 0, False: 57.9k] ------------------ 6506| 0| onig_node_free(node); 6507| 0| return r; 6508| 0| } 6509| | 6510| 57.9k| if (r == TK_EOT || r == term || r == TK_ALT) { ------------------ | Branch (6510:7): [True: 2.69k, False: 55.2k] | Branch (6510:22): [True: 13.4k, False: 41.7k] | Branch (6510:35): [True: 9.43k, False: 32.3k] ------------------ 6511| 25.6k| *top = node; 6512| 25.6k| } 6513| 32.3k| else { 6514| 32.3k| *top = node_new_list(node, NULL); 6515| 32.3k| headp = &(NCDR(*top)); ------------------ | | 87| 32.3k|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 32.3k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 6516| 133k| while (r != TK_EOT && r != term && r != TK_ALT) { ------------------ | Branch (6516:12): [True: 105k, False: 28.3k] | Branch (6516:27): [True: 102k, False: 2.69k] | Branch (6516:40): [True: 101k, False: 1.34k] ------------------ 6517| 101k| r = parse_exp(&node, tok, term, src, end, env); 6518| 101k| if (r < 0) { ------------------ | Branch (6518:11): [True: 0, False: 101k] ------------------ 6519| 0| onig_node_free(node); 6520| 0| return r; 6521| 0| } 6522| | 6523| 101k| if (NTYPE(node) == NT_LIST) { ------------------ | | 69| 101k|#define NTYPE(node) ((node)->u.base.type) ------------------ if (NTYPE(node) == NT_LIST) { ------------------ | | 46| 101k|#define NT_LIST 8 ------------------ | Branch (6523:11): [True: 0, False: 101k] ------------------ 6524| 0| *headp = node; 6525| 0| while (IS_NOT_NULL(NCDR(node))) node = NCDR(node); ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306: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)) | | ------------------ ------------------ 6526| 0| headp = &(NCDR(node)); ------------------ | | 87| 0|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 6527| 0| } 6528| 101k| else { 6529| 101k| *headp = node_new_list(node, NULL); 6530| 101k| headp = &(NCDR(*headp)); ------------------ | | 87| 101k|#define NCDR(node) (NCONS(node)->cdr) | | ------------------ | | | | 83| 101k|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 6531| 101k| } 6532| 101k| } 6533| 32.3k| } 6534| | 6535| 57.9k| return r; 6536| 57.9k|} regparse.c:parse_exp: 6121| 159k|{ 6122| 159k| int r, len, group = 0; 6123| 159k| Node* qn; 6124| 159k| Node** targetp; 6125| 159k| unsigned int parse_depth; 6126| | 6127| 159k| *np = NULL; 6128| 159k| if (tok->type == (enum TokenSyms )term) ------------------ | Branch (6128:7): [True: 1.34k, False: 157k] ------------------ 6129| 1.34k| goto end_of_token; 6130| | 6131| 157k| parse_depth = env->parse_depth; 6132| | 6133| 157k| switch (tok->type) { 6134| 0| case TK_ALT: ------------------ | Branch (6134:3): [True: 0, False: 157k] ------------------ 6135| 0| case TK_EOT: ------------------ | Branch (6135:3): [True: 0, False: 157k] ------------------ 6136| 1.34k| end_of_token: 6137| 1.34k| *np = node_new_empty(); 6138| 1.34k| return tok->type; 6139| 0| break; 6140| | 6141| 16.1k| case TK_SUBEXP_OPEN: ------------------ | Branch (6141:3): [True: 16.1k, False: 141k] ------------------ 6142| 16.1k| r = parse_enclose(np, tok, TK_SUBEXP_CLOSE, src, end, env); 6143| 16.1k| if (r < 0) return r; ------------------ | Branch (6143:9): [True: 0, False: 16.1k] ------------------ 6144| 16.1k| if (r == 1) group = 1; ------------------ | Branch (6144:9): [True: 8.08k, False: 8.08k] ------------------ 6145| 8.08k| else if (r == 2) { /* option only */ ------------------ | Branch (6145:14): [True: 0, False: 8.08k] ------------------ 6146| 0| Node* target; 6147| 0| OnigOptionType prev = env->option; 6148| | 6149| 0| env->option = NENCLOSE(*np)->option; ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 6150| 0| r = fetch_token(tok, src, end, env); 6151| 0| if (r < 0) { ------------------ | Branch (6151:11): [True: 0, False: 0] ------------------ 6152| 0| env->option = prev; 6153| 0| return r; 6154| 0| } 6155| 0| r = parse_subexp(&target, tok, term, src, end, env); 6156| 0| env->option = prev; 6157| 0| if (r < 0) { ------------------ | Branch (6157:11): [True: 0, False: 0] ------------------ 6158| 0| onig_node_free(target); 6159| 0| return r; 6160| 0| } 6161| 0| NENCLOSE(*np)->target = target; ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 6162| 0| return tok->type; 6163| 0| } 6164| 16.1k| break; 6165| | 6166| 16.1k| case TK_SUBEXP_CLOSE: ------------------ | Branch (6166:3): [True: 0, False: 157k] ------------------ 6167| 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 (6167:9): [True: 0, False: 0] ------------------ 6168| 0| return ONIGERR_UNMATCHED_CLOSE_PARENTHESIS; ------------------ | | 657| 0|#define ONIGERR_UNMATCHED_CLOSE_PARENTHESIS -116 ------------------ 6169| | 6170| 0| if (tok->escaped) goto tk_raw_byte; ------------------ | Branch (6170:9): [True: 0, False: 0] ------------------ 6171| 0| else goto tk_byte; 6172| 0| break; 6173| | 6174| 0| case TK_LINEBREAK: ------------------ | Branch (6174:3): [True: 0, False: 157k] ------------------ 6175| 0| r = node_linebreak(np, env); 6176| 0| if (r < 0) return r; ------------------ | Branch (6176:9): [True: 0, False: 0] ------------------ 6177| 0| break; 6178| | 6179| 0| case TK_EXTENDED_GRAPHEME_CLUSTER: ------------------ | Branch (6179:3): [True: 0, False: 157k] ------------------ 6180| 0| r = node_extended_grapheme_cluster(np, env); 6181| 0| if (r < 0) return r; ------------------ | Branch (6181:9): [True: 0, False: 0] ------------------ 6182| 0| break; 6183| | 6184| 0| case TK_KEEP: ------------------ | Branch (6184:3): [True: 0, False: 157k] ------------------ 6185| 0| *np = onig_node_new_anchor(ANCHOR_KEEP); ------------------ | | 553| 0|#define ANCHOR_KEEP (1<<16) ------------------ 6186| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 308| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6187| 0| break; 6188| | 6189| 56.6k| case TK_STRING: ------------------ | Branch (6189:3): [True: 56.6k, False: 101k] ------------------ 6190| 56.6k| tk_byte: 6191| 56.6k| { 6192| 56.6k| *np = node_new_str(tok->backp, *src); 6193| 56.6k| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 308| 56.6k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 56.6k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 56.6k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6194| | 6195| 56.6k| string_loop: 6196| 496k| while (1) { ------------------ | Branch (6196:14): [Folded - Ignored] ------------------ 6197| 496k| r = fetch_token(tok, src, end, env); 6198| 496k| if (r < 0) return r; ------------------ | Branch (6198:6): [True: 0, False: 496k] ------------------ 6199| 496k| if (r == TK_STRING) { ------------------ | Branch (6199:6): [True: 439k, False: 56.6k] ------------------ 6200| 439k| r = onig_node_str_cat(*np, tok->backp, *src); 6201| 439k| } 6202| 56.6k|#ifndef NUMBERED_CHAR_IS_NOT_CASE_AMBIG 6203| 56.6k| else if (r == TK_CODE_POINT) { ------------------ | Branch (6203:11): [True: 0, False: 56.6k] ------------------ 6204| 0| r = node_str_cat_codepoint(*np, env->enc, tok->u.code); 6205| 0| } 6206| 56.6k|#endif 6207| 56.6k| else { 6208| 56.6k| break; 6209| 56.6k| } 6210| 439k| if (r < 0) return r; ------------------ | Branch (6210:6): [True: 0, False: 439k] ------------------ 6211| 439k| } 6212| | 6213| 56.6k| string_end: 6214| 56.6k| targetp = np; 6215| 56.6k| goto repeat; 6216| 56.6k| } 6217| 0| break; 6218| | 6219| 0| case TK_RAW_BYTE: ------------------ | Branch (6219:3): [True: 0, False: 157k] ------------------ 6220| 0| tk_raw_byte: 6221| 0| { 6222| 0| *np = node_new_str_raw_char((UChar )tok->u.c); 6223| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 308| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6224| 0| len = 1; 6225| 0| while (1) { ------------------ | Branch (6225:14): [Folded - Ignored] ------------------ 6226| 0| if (len >= ONIGENC_MBC_MINLEN(env->enc)) { ------------------ | | 364| 0|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) ------------------ | Branch (6226:6): [True: 0, False: 0] ------------------ 6227| 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)) | | ------------------ | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 0] | | ------------------ ------------------ | Branch (6227:8): [True: 0, False: 0] ------------------ 6228| 0| r = fetch_token(tok, src, end, env); 6229| 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 */ | | ------------------ ------------------ 6230| 0| goto string_end; 6231| 0| } 6232| 0| } 6233| | 6234| 0| r = fetch_token(tok, src, end, env); 6235| 0| if (r < 0) return r; ------------------ | Branch (6235:6): [True: 0, False: 0] ------------------ 6236| 0| if (r != TK_RAW_BYTE) { ------------------ | Branch (6236:6): [True: 0, False: 0] ------------------ 6237| | /* Don't use this, it is wrong for little endian encodings. */ 6238| |#ifdef USE_PAD_TO_SHORT_BYTE_CHAR 6239| | int rem; 6240| | if (len < ONIGENC_MBC_MINLEN(env->enc)) { 6241| | rem = ONIGENC_MBC_MINLEN(env->enc) - len; 6242| | (void )node_str_head_pad(NSTR(*np), rem, (UChar )0); 6243| | if (len + rem == enclen(env->enc, NSTR(*np)->s)) { 6244| | NSTRING_CLEAR_RAW(*np); 6245| | goto string_end; 6246| | } 6247| | } 6248| |#endif 6249| 0| return ONIGERR_TOO_SHORT_MULTI_BYTE_STRING; ------------------ | | 672| 0|#define ONIGERR_TOO_SHORT_MULTI_BYTE_STRING -206 ------------------ 6250| 0| } 6251| | 6252| 0| r = node_str_cat_char(*np, (UChar )tok->u.c); 6253| 0| if (r < 0) return r; ------------------ | Branch (6253:6): [True: 0, False: 0] ------------------ 6254| | 6255| 0| len++; 6256| 0| } 6257| 0| } 6258| 0| break; 6259| | 6260| 0| case TK_CODE_POINT: ------------------ | Branch (6260:3): [True: 0, False: 157k] ------------------ 6261| 0| { 6262| 0| *np = node_new_empty(); 6263| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 308| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6264| 0| r = node_str_cat_codepoint(*np, env->enc, tok->u.code); 6265| 0| if (r != 0) return r; ------------------ | Branch (6265:11): [True: 0, False: 0] ------------------ 6266| |#ifdef NUMBERED_CHAR_IS_NOT_CASE_AMBIG 6267| | NSTRING_SET_RAW(*np); 6268| |#else 6269| 0| goto string_loop; 6270| 0|#endif 6271| 0| } 6272| 0| break; 6273| | 6274| 0| case TK_QUOTE_OPEN: ------------------ | Branch (6274:3): [True: 0, False: 157k] ------------------ 6275| 0| { 6276| 0| OnigCodePoint end_op[2]; 6277| 0| UChar *qstart, *qend, *nextp; ------------------ | | 76| 0|# define UChar OnigUChar ------------------ 6278| | 6279| 0| end_op[0] = (OnigCodePoint )MC_ESC(env->syntax); ------------------ | | 755| 0|#define MC_ESC(syn) (syn)->meta_char_table.esc ------------------ 6280| 0| end_op[1] = (OnigCodePoint )'E'; 6281| 0| qstart = *src; 6282| 0| qend = find_str_position(end_op, 2, qstart, end, &nextp, env->enc); 6283| 0| if (IS_NULL(qend)) { ------------------ | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 0] | | ------------------ ------------------ 6284| 0| nextp = qend = end; 6285| 0| } 6286| 0| *np = node_new_str(qstart, qend); 6287| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 308| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6288| 0| *src = nextp; 6289| 0| } 6290| 0| break; 6291| | 6292| 12.1k| case TK_CHAR_TYPE: ------------------ | Branch (6292:3): [True: 12.1k, False: 145k] ------------------ 6293| 12.1k| { 6294| 12.1k| switch (tok->u.prop.ctype) { 6295| 0| case ONIGENC_CTYPE_WORD: ------------------ | | 306| 0|#define ONIGENC_CTYPE_WORD 12 ------------------ | Branch (6295:7): [True: 0, False: 12.1k] ------------------ 6296| 0| *np = node_new_ctype(tok->u.prop.ctype, tok->u.prop.not, 6297| 0| IS_ASCII_RANGE(env->option)); ------------------ | | 400| 0|#define IS_ASCII_RANGE(option) ((option) & ONIG_OPTION_ASCII_RANGE) | | ------------------ | | | | 467| 0|#define ONIG_OPTION_ASCII_RANGE (ONIG_OPTION_NOTEOS << 1) | | | | ------------------ | | | | | | 465| 0|#define ONIG_OPTION_NOTEOS (ONIG_OPTION_NOTBOS << 1) | | | | | | ------------------ | | | | | | | | 464| 0|#define ONIG_OPTION_NOTBOS (ONIG_OPTION_NOTEOL << 1) | | | | | | | | ------------------ | | | | | | | | | | 463| 0|#define ONIG_OPTION_NOTEOL (ONIG_OPTION_NOTBOL << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 462| 0|#define ONIG_OPTION_NOTBOL (ONIG_OPTION_CAPTURE_GROUP << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 460| 0|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 459| 0|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 458| 0|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | 457| 0|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | 456| 0|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | 455| 0|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | 453| 0|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 452| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 451| 0|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 6298| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 308| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6299| 0| break; 6300| | 6301| 6.74k| case ONIGENC_CTYPE_SPACE: ------------------ | | 303| 6.74k|#define ONIGENC_CTYPE_SPACE 9 ------------------ | Branch (6301:7): [True: 6.74k, False: 5.39k] ------------------ 6302| 12.1k| case ONIGENC_CTYPE_DIGIT: ------------------ | | 298| 12.1k|#define ONIGENC_CTYPE_DIGIT 4 ------------------ | Branch (6302:7): [True: 5.39k, False: 6.74k] ------------------ 6303| 12.1k| case ONIGENC_CTYPE_XDIGIT: ------------------ | | 305| 12.1k|#define ONIGENC_CTYPE_XDIGIT 11 ------------------ | Branch (6303:7): [True: 0, False: 12.1k] ------------------ 6304| 12.1k| { 6305| 12.1k| CClassNode* cc; 6306| | 6307| 12.1k| *np = node_new_cclass(); 6308| 12.1k| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 308| 12.1k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 12.1k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 12.1k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6309| 12.1k| cc = NCCLASS(*np); ------------------ | | 77| 12.1k|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 6310| 12.1k| r = add_ctype_to_cc(cc, tok->u.prop.ctype, 0, 6311| 12.1k| IS_ASCII_RANGE(env->option), env); ------------------ | | 400| 12.1k|#define IS_ASCII_RANGE(option) ((option) & ONIG_OPTION_ASCII_RANGE) | | ------------------ | | | | 467| 12.1k|#define ONIG_OPTION_ASCII_RANGE (ONIG_OPTION_NOTEOS << 1) | | | | ------------------ | | | | | | 465| 12.1k|#define ONIG_OPTION_NOTEOS (ONIG_OPTION_NOTBOS << 1) | | | | | | ------------------ | | | | | | | | 464| 12.1k|#define ONIG_OPTION_NOTBOS (ONIG_OPTION_NOTEOL << 1) | | | | | | | | ------------------ | | | | | | | | | | 463| 12.1k|#define ONIG_OPTION_NOTEOL (ONIG_OPTION_NOTBOL << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 462| 12.1k|#define ONIG_OPTION_NOTBOL (ONIG_OPTION_CAPTURE_GROUP << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 460| 12.1k|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 459| 12.1k|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 458| 12.1k|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | 457| 12.1k|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | 456| 12.1k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | 455| 12.1k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | 453| 12.1k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 452| 12.1k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 451| 12.1k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 6312| 12.1k| if (r != 0) return r; ------------------ | Branch (6312:8): [True: 0, False: 12.1k] ------------------ 6313| 12.1k| if (tok->u.prop.not != 0) NCCLASS_SET_NOT(cc); ------------------ | | 801| 0|#define NCCLASS_SET_NOT(nd) NCCLASS_FLAG_SET(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 794| 0|#define NCCLASS_FLAG_SET(cc,flag) (NCCLASS_FLAGS(cc) |= (flag)) | | | | ------------------ | | | | | | 793| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ | Branch (6313:8): [True: 0, False: 12.1k] ------------------ 6314| 12.1k| } 6315| 0| break; 6316| | 6317| 0| default: ------------------ | Branch (6317:7): [True: 0, False: 12.1k] ------------------ 6318| 0| return ONIGERR_PARSER_BUG; ------------------ | | 631| 0|#define ONIGERR_PARSER_BUG -11 ------------------ 6319| 0| break; 6320| 12.1k| } 6321| 12.1k| } 6322| 12.1k| break; 6323| | 6324| 12.1k| case TK_CHAR_PROPERTY: ------------------ | Branch (6324:3): [True: 0, False: 157k] ------------------ 6325| 0| r = parse_char_property(np, tok, src, end, env); 6326| 0| if (r != 0) return r; ------------------ | Branch (6326:9): [True: 0, False: 0] ------------------ 6327| 0| break; 6328| | 6329| 20.2k| case TK_CC_OPEN: ------------------ | Branch (6329:3): [True: 20.2k, False: 137k] ------------------ 6330| 20.2k| { 6331| 20.2k| Node *asc_node; 6332| 20.2k| CClassNode* cc; 6333| 20.2k| OnigCodePoint code; 6334| | 6335| 20.2k| r = parse_char_class(np, &asc_node, tok, src, end, env); 6336| 20.2k| if (r != 0) { ------------------ | Branch (6336:11): [True: 0, False: 20.2k] ------------------ 6337| 0| onig_node_free(asc_node); 6338| 0| return r; 6339| 0| } 6340| | 6341| 20.2k| cc = NCCLASS(*np); ------------------ | | 77| 20.2k|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 6342| 20.2k| if (is_onechar_cclass(cc, &code)) { ------------------ | Branch (6342:11): [True: 0, False: 20.2k] ------------------ 6343| 0| onig_node_free(*np); 6344| 0| onig_node_free(asc_node); 6345| 0| *np = node_new_empty(); 6346| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 308| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6347| 0| r = node_str_cat_codepoint(*np, env->enc, code); 6348| 0| if (r != 0) return r; ------------------ | Branch (6348:6): [True: 0, False: 0] ------------------ 6349| 0| goto string_loop; 6350| 0| } 6351| 20.2k| if (IS_IGNORECASE(env->option)) { ------------------ | | 390| 20.2k|#define IS_IGNORECASE(option) ((option) & ONIG_OPTION_IGNORECASE) | | ------------------ | | | | 451| 20.2k|#define ONIG_OPTION_IGNORECASE 1U | | ------------------ | | | Branch (390:35): [True: 0, False: 20.2k] | | ------------------ ------------------ 6352| 0| r = cclass_case_fold(np, cc, NCCLASS(asc_node), env); ------------------ | | 77| 0|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 6353| 0| if (r != 0) { ------------------ | Branch (6353:6): [True: 0, False: 0] ------------------ 6354| 0| onig_node_free(asc_node); 6355| 0| return r; 6356| 0| } 6357| 0| } 6358| 20.2k| onig_node_free(asc_node); 6359| 20.2k| } 6360| 0| break; 6361| | 6362| 13.4k| case TK_ANYCHAR: ------------------ | Branch (6362:3): [True: 13.4k, False: 144k] ------------------ 6363| 13.4k| *np = node_new_anychar(); 6364| 13.4k| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 308| 13.4k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 13.4k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 13.4k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6365| 13.4k| break; 6366| | 6367| 13.4k| case TK_ANYCHAR_ANYTIME: ------------------ | Branch (6367:3): [True: 0, False: 157k] ------------------ 6368| 0| *np = node_new_anychar(); 6369| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 308| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6370| 0| qn = node_new_quantifier(0, REPEAT_INFINITE, 0); ------------------ | | 415| 0|#define REPEAT_INFINITE -1 ------------------ 6371| 0| CHECK_NULL_RETURN_MEMERR(qn); ------------------ | | 308| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6372| 0| NQTFR(qn)->target = *np; ------------------ | | 80| 0|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 6373| 0| *np = qn; 6374| 0| break; 6375| | 6376| 0| case TK_BACKREF: ------------------ | Branch (6376:3): [True: 0, False: 157k] ------------------ 6377| 0| len = tok->u.backref.num; 6378| 0| *np = node_new_backref(len, 6379| 0| (len > 1 ? tok->u.backref.refs : &(tok->u.backref.ref1)), ------------------ | Branch (6379:7): [True: 0, False: 0] ------------------ 6380| 0| tok->u.backref.by_name, 6381| 0|#ifdef USE_BACKREF_WITH_LEVEL 6382| 0| tok->u.backref.exist_level, 6383| 0| tok->u.backref.level, 6384| 0|#endif 6385| 0| env); 6386| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 308| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6387| 0| break; 6388| | 6389| 0|#ifdef USE_SUBEXP_CALL 6390| 0| case TK_CALL: ------------------ | Branch (6390:3): [True: 0, False: 157k] ------------------ 6391| 0| { 6392| 0| int gnum = tok->u.call.gnum; 6393| | 6394| 0| if (gnum < 0 || tok->u.call.rel != 0) { ------------------ | Branch (6394:11): [True: 0, False: 0] | Branch (6394:23): [True: 0, False: 0] ------------------ 6395| 0| if (gnum > 0) gnum--; ------------------ | Branch (6395:6): [True: 0, False: 0] ------------------ 6396| 0| gnum = BACKREF_REL_TO_ABS(gnum, env); ------------------ | | 158| 0| ((env)->num_mem + 1 + (rel_no)) ------------------ 6397| 0| if (gnum <= 0) ------------------ | Branch (6397:6): [True: 0, False: 0] ------------------ 6398| 0| return ONIGERR_INVALID_BACKREF; ------------------ | | 674| 0|#define ONIGERR_INVALID_BACKREF -208 ------------------ 6399| 0| } 6400| 0| *np = node_new_call(tok->u.call.name, tok->u.call.name_end, gnum); 6401| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 308| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6402| 0| env->num_call++; 6403| 0| } 6404| 0| break; 6405| 0|#endif 6406| | 6407| 39.0k| case TK_ANCHOR: ------------------ | Branch (6407:3): [True: 39.0k, False: 118k] ------------------ 6408| 39.0k| *np = onig_node_new_anchor(tok->u.anchor.subtype); 6409| 39.0k| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 308| 39.0k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 39.0k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 39.0k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6410| 39.0k| NANCHOR(*np)->ascii_range = tok->u.anchor.ascii_range; ------------------ | | 82| 39.0k|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 6411| 39.0k| break; 6412| | 6413| 0| case TK_OP_REPEAT: ------------------ | Branch (6413:3): [True: 0, False: 157k] ------------------ 6414| 0| case TK_INTERVAL: ------------------ | Branch (6414:3): [True: 0, False: 157k] ------------------ 6415| 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] | | ------------------ ------------------ 6416| 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] | | ------------------ ------------------ 6417| 0| return ONIGERR_TARGET_OF_REPEAT_OPERATOR_NOT_SPECIFIED; ------------------ | | 654| 0|#define ONIGERR_TARGET_OF_REPEAT_OPERATOR_NOT_SPECIFIED -113 ------------------ 6418| 0| else 6419| 0| *np = node_new_empty(); 6420| 0| } 6421| 0| else { 6422| 0| goto tk_byte; 6423| 0| } 6424| 0| break; 6425| | 6426| 0| default: ------------------ | Branch (6426:3): [True: 0, False: 157k] ------------------ 6427| 0| return ONIGERR_PARSER_BUG; ------------------ | | 631| 0|#define ONIGERR_PARSER_BUG -11 ------------------ 6428| 0| break; 6429| 157k| } 6430| | 6431| 101k| { 6432| 101k| targetp = np; 6433| | 6434| 141k| re_entry: 6435| 141k| r = fetch_token(tok, src, end, env); 6436| 141k| if (r < 0) return r; ------------------ | Branch (6436:9): [True: 0, False: 141k] ------------------ 6437| | 6438| 198k| repeat: 6439| 198k| if (r == TK_OP_REPEAT || r == TK_INTERVAL) { ------------------ | Branch (6439:9): [True: 40.4k, False: 157k] | Branch (6439:30): [True: 0, False: 157k] ------------------ 6440| 40.4k| if (is_invalid_quantifier_target(*targetp)) ------------------ | | 2122| 40.4k|# define is_invalid_quantifier_target(node) 0 | | ------------------ | | | Branch (2122:45): [Folded - Ignored] | | ------------------ ------------------ 6441| 0| return ONIGERR_TARGET_OF_REPEAT_OPERATOR_INVALID; ------------------ | | 655| 0|#define ONIGERR_TARGET_OF_REPEAT_OPERATOR_INVALID -114 ------------------ 6442| | 6443| 40.4k| parse_depth++; 6444| 40.4k| if (parse_depth > ParseDepthLimit) ------------------ | Branch (6444:11): [True: 0, False: 40.4k] ------------------ 6445| 0| return ONIGERR_PARSE_DEPTH_LIMIT_OVER; ------------------ | | 636| 0|#define ONIGERR_PARSE_DEPTH_LIMIT_OVER -16 ------------------ 6446| | 6447| 40.4k| qn = node_new_quantifier(tok->u.repeat.lower, tok->u.repeat.upper, 6448| 40.4k| (r == TK_INTERVAL ? 1 : 0)); ------------------ | Branch (6448:12): [True: 0, False: 40.4k] ------------------ 6449| 40.4k| CHECK_NULL_RETURN_MEMERR(qn); ------------------ | | 308| 40.4k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 40.4k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 40.4k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 6450| 40.4k| NQTFR(qn)->greedy = tok->u.repeat.greedy; ------------------ | | 80| 40.4k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 6451| 40.4k| r = set_quantifier(qn, *targetp, group, env); 6452| 40.4k| if (r < 0) { ------------------ | Branch (6452:11): [True: 0, False: 40.4k] ------------------ 6453| 0| onig_node_free(qn); 6454| 0| return r; 6455| 0| } 6456| | 6457| 40.4k| if (tok->u.repeat.possessive != 0) { ------------------ | Branch (6457:11): [True: 0, False: 40.4k] ------------------ 6458| 0| Node* en; 6459| 0| en = node_new_enclose(ENCLOSE_STOP_BACKTRACK); ------------------ | | 96| 0|#define ENCLOSE_STOP_BACKTRACK (1<<2) ------------------ 6460| 0| if (IS_NULL(en)) { ------------------ | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 0] | | ------------------ ------------------ 6461| 0| onig_node_free(qn); 6462| 0| return ONIGERR_MEMORY; ------------------ | | 629| 0|#define ONIGERR_MEMORY -5 ------------------ 6463| 0| } 6464| 0| NENCLOSE(en)->target = qn; ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 6465| 0| qn = en; 6466| 0| } 6467| | 6468| 40.4k| if (r == 0) { ------------------ | Branch (6468:11): [True: 40.4k, False: 0] ------------------ 6469| 40.4k| *targetp = qn; 6470| 40.4k| } 6471| 0| else if (r == 1) { ------------------ | Branch (6471:16): [True: 0, False: 0] ------------------ 6472| 0| onig_node_free(qn); 6473| 0| } 6474| 0| else if (r == 2) { /* split case: /abc+/ */ ------------------ | Branch (6474:16): [True: 0, False: 0] ------------------ 6475| 0| Node *tmp; 6476| | 6477| 0| *targetp = node_new_list(*targetp, NULL); 6478| 0| if (IS_NULL(*targetp)) { ------------------ | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 0] | | ------------------ ------------------ 6479| 0| onig_node_free(qn); 6480| 0| return ONIGERR_MEMORY; ------------------ | | 629| 0|#define ONIGERR_MEMORY -5 ------------------ 6481| 0| } 6482| 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)) | | ------------------ ------------------ 6483| 0| if (IS_NULL(tmp)) { ------------------ | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 0] | | ------------------ ------------------ 6484| 0| onig_node_free(qn); 6485| 0| return ONIGERR_MEMORY; ------------------ | | 629| 0|#define ONIGERR_MEMORY -5 ------------------ 6486| 0| } 6487| 0| targetp = &(NCAR(tmp)); ------------------ | | 86| 0|#define NCAR(node) (NCONS(node)->car) | | ------------------ | | | | 83| 0|#define NCONS(node) (&((node)->u.cons)) | | ------------------ ------------------ 6488| 0| } 6489| 40.4k| goto re_entry; 6490| 40.4k| } 6491| 198k| } 6492| | 6493| 157k| return r; 6494| 198k|} regparse.c:node_new_empty: 1497| 1.34k|{ 1498| 1.34k| return node_new_str(NULL, NULL); 1499| 1.34k|} regparse.c:parse_enclose: 4957| 16.1k|{ 4958| 16.1k| int r = 0, num; 4959| 16.1k| Node *target, *work1 = NULL, *work2 = NULL; 4960| 16.1k| OnigOptionType option; 4961| 16.1k| OnigCodePoint c; 4962| 16.1k| OnigEncoding enc = env->enc; 4963| | 4964| 16.1k|#ifdef USE_NAMED_GROUP 4965| 16.1k| int list_capture; 4966| 16.1k|#endif 4967| | 4968| 16.1k| UChar* p = *src; ------------------ | | 76| 16.1k|# define UChar OnigUChar ------------------ 4969| 16.1k| PFETCH_READY; ------------------ | | 295| 16.1k|# define PFETCH_READY UChar* pfetch_prev = NULL; (void)pfetch_prev | | ------------------ | | | | 76| 16.1k|# define UChar OnigUChar | | ------------------ ------------------ 4970| | 4971| 16.1k| *np = NULL; 4972| 16.1k| if (PEND) return ONIGERR_END_PATTERN_WITH_UNMATCHED_PARENTHESIS; ------------------ | | 299| 16.1k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 16.1k] | | | Branch (299:23): [True: 16.1k, False: 0] | | ------------------ ------------------ if (PEND) return ONIGERR_END_PATTERN_WITH_UNMATCHED_PARENTHESIS; ------------------ | | 658| 0|#define ONIGERR_END_PATTERN_WITH_UNMATCHED_PARENTHESIS -117 ------------------ 4973| | 4974| 16.1k| option = env->option; 4975| 16.1k| if (PPEEK_IS('?') && ------------------ | | 320| 32.3k|#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c) | | ------------------ | | | | 319| 16.1k|#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE) | | | | ------------------ | | | | | | 366| 16.1k|#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: 16.1k, False: 0] | | | | ------------------ | | ------------------ | | | Branch (320:22): [True: 14.8k, False: 1.34k] | | ------------------ ------------------ 4976| 16.1k| IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_GROUP_EFFECT)) { ------------------ | | 331| 14.8k|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 14.8k, False: 0] | | ------------------ ------------------ 4977| 14.8k| PINC; ------------------ | | 301| 14.8k|#define PINC do { \ | | 302| 14.8k| pfetch_prev = p; \ | | 303| 14.8k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 14.8k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 361| 14.8k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 14.8k] | | | | ------------------ | | ------------------ | | 304| 14.8k|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 4978| 14.8k| if (PEND) return ONIGERR_END_PATTERN_IN_GROUP; ------------------ | | 299| 14.8k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 14.8k] | | | Branch (299:23): [True: 14.8k, False: 0] | | ------------------ ------------------ if (PEND) return ONIGERR_END_PATTERN_IN_GROUP; ------------------ | | 659| 0|#define ONIGERR_END_PATTERN_IN_GROUP -118 ------------------ 4979| | 4980| 14.8k| PFETCH(c); ------------------ | | 305| 14.8k|#define PFETCH(c) do { \ | | 306| 14.8k| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 366| 14.8k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 14.8k] | | ------------------ | | 307| 14.8k| pfetch_prev = p; \ | | 308| 14.8k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 14.8k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 361| 14.8k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 14.8k] | | | | ------------------ | | ------------------ | | 309| 14.8k|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 4981| 14.8k| switch (c) { 4982| 8.08k| case ':': /* (?:...) grouping only */ ------------------ | Branch (4982:5): [True: 8.08k, False: 6.74k] ------------------ 4983| 8.08k| group: 4984| 8.08k| r = fetch_token(tok, &p, end, env); 4985| 8.08k| if (r < 0) return r; ------------------ | Branch (4985:11): [True: 0, False: 8.08k] ------------------ 4986| 8.08k| r = parse_subexp(np, tok, term, &p, end, env); 4987| 8.08k| if (r < 0) return r; ------------------ | Branch (4987:11): [True: 0, False: 8.08k] ------------------ 4988| 8.08k| *src = p; 4989| 8.08k| return 1; /* group */ 4990| 0| break; 4991| | 4992| 0| case '=': ------------------ | Branch (4992:5): [True: 0, False: 14.8k] ------------------ 4993| 0| *np = onig_node_new_anchor(ANCHOR_PREC_READ); ------------------ | | 545| 0|#define ANCHOR_PREC_READ (1<<10) ------------------ 4994| 0| break; 4995| 0| case '!': /* preceding read */ ------------------ | Branch (4995:5): [True: 0, False: 14.8k] ------------------ 4996| 0| *np = onig_node_new_anchor(ANCHOR_PREC_READ_NOT); ------------------ | | 546| 0|#define ANCHOR_PREC_READ_NOT (1<<11) ------------------ 4997| 0| break; 4998| 0| case '>': /* (?>...) stop backtrack */ ------------------ | Branch (4998:5): [True: 0, False: 14.8k] ------------------ 4999| 0| *np = node_new_enclose(ENCLOSE_STOP_BACKTRACK); ------------------ | | 96| 0|#define ENCLOSE_STOP_BACKTRACK (1<<2) ------------------ 5000| 0| break; 5001| 0| case '~': /* (?~...) absent operator */ ------------------ | Branch (5001:5): [True: 0, False: 14.8k] ------------------ 5002| 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] | | ------------------ ------------------ 5003| 0| *np = node_new_enclose(ENCLOSE_ABSENT); ------------------ | | 98| 0|#define ENCLOSE_ABSENT (1<<4) ------------------ 5004| 0| } 5005| 0| else { 5006| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 660| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5007| 0| } 5008| 0| break; 5009| | 5010| 0|#ifdef USE_NAMED_GROUP 5011| 0| case '\'': ------------------ | Branch (5011:5): [True: 0, False: 14.8k] ------------------ 5012| 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] | | ------------------ ------------------ 5013| 0| goto named_group1; 5014| 0| } 5015| 0| else 5016| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 660| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5017| 0| break; 5018| | 5019| 0|# ifdef USE_CAPITAL_P_NAMED_GROUP 5020| 0| case 'P': /* (?P...) */ ------------------ | Branch (5020:5): [True: 0, False: 14.8k] ------------------ 5021| 0| if (!PEND && ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ | Branch (5021:11): [True: 0, False: 0] ------------------ 5022| 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] | | ------------------ ------------------ 5023| 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)); \ | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 309| 0|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 5024| 0| if (c == '<') goto named_group1; ------------------ | Branch (5024:6): [True: 0, False: 0] ------------------ 5025| 0| } 5026| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 660| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5027| 0| break; 5028| 0|# endif 5029| 0|#endif 5030| | 5031| 5.39k| case '<': /* look behind (?<=...), (?max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 366| 5.39k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 5.39k] | | ------------------ | | 307| 5.39k| pfetch_prev = p; \ | | 308| 5.39k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 5.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)) | | | | ------------------ | | | | | | 361| 5.39k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 5.39k] | | | | ------------------ | | ------------------ | | 309| 5.39k|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 5034| 5.39k| if (c == '=') ------------------ | Branch (5034:11): [True: 0, False: 5.39k] ------------------ 5035| 0| *np = onig_node_new_anchor(ANCHOR_LOOK_BEHIND); ------------------ | | 547| 0|#define ANCHOR_LOOK_BEHIND (1<<12) ------------------ 5036| 5.39k| else if (c == '!') ------------------ | Branch (5036:16): [True: 0, False: 5.39k] ------------------ 5037| 0| *np = onig_node_new_anchor(ANCHOR_LOOK_BEHIND_NOT); ------------------ | | 548| 0|#define ANCHOR_LOOK_BEHIND_NOT (1<<13) ------------------ 5038| 5.39k|#ifdef USE_NAMED_GROUP 5039| 5.39k| else { /* (?...) */ 5040| 5.39k| if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_LT_NAMED_GROUP)) { ------------------ | | 331| 5.39k|#define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0) | | ------------------ | | | Branch (331:35): [True: 5.39k, False: 0] | | ------------------ ------------------ 5041| 5.39k| UChar *name; ------------------ | | 76| 5.39k|# define UChar OnigUChar ------------------ 5042| 5.39k| UChar *name_end; ------------------ | | 76| 5.39k|# define UChar OnigUChar ------------------ 5043| | 5044| 5.39k| PUNFETCH; ------------------ | | 300| 5.39k|#define PUNFETCH p = pfetch_prev ------------------ 5045| 5.39k| c = '<'; 5046| | 5047| 5.39k| named_group1: 5048| 5.39k| list_capture = 0; 5049| | 5050| 5.39k|# ifdef USE_CAPTURE_HISTORY 5051| 5.39k| named_group2: 5052| 5.39k|# endif 5053| 5.39k| name = p; 5054| 5.39k| r = fetch_name((OnigCodePoint )c, &p, end, &name_end, env, &num, 0); 5055| 5.39k| if (r < 0) return r; ------------------ | Branch (5055:8): [True: 0, False: 5.39k] ------------------ 5056| | 5057| 5.39k| num = scan_env_add_mem_entry(env); 5058| 5.39k| if (num < 0) return num; ------------------ | Branch (5058:8): [True: 0, False: 5.39k] ------------------ 5059| 5.39k| if (list_capture != 0 && num >= (int )BIT_STATUS_BITS_NUM) ------------------ | | 361| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) ------------------ | Branch (5059:8): [True: 0, False: 5.39k] | Branch (5059:29): [True: 0, False: 0] ------------------ 5060| 0| return ONIGERR_GROUP_NUMBER_OVER_FOR_CAPTURE_HISTORY; ------------------ | | 687| 0|#define ONIGERR_GROUP_NUMBER_OVER_FOR_CAPTURE_HISTORY -222 ------------------ 5061| | 5062| 5.39k| r = name_add(env->reg, name, name_end, num, env); 5063| 5.39k| if (r != 0) return r; ------------------ | Branch (5063:8): [True: 0, False: 5.39k] ------------------ 5064| 5.39k| *np = node_new_enclose_memory(env->option, 1); 5065| 5.39k| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 308| 5.39k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 5.39k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 5.39k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 5066| 5.39k| NENCLOSE(*np)->regnum = num; ------------------ | | 81| 5.39k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 5067| 5.39k| if (list_capture != 0) ------------------ | Branch (5067:8): [True: 0, False: 5.39k] ------------------ 5068| 0| BIT_STATUS_ON_AT_SIMPLE(env->capture_history, num); ------------------ | | 374| 0|#define BIT_STATUS_ON_AT_SIMPLE(stats,n) do {\ | | 375| 0| if ((n) < (int )BIT_STATUS_BITS_NUM)\ | | ------------------ | | | | 361| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (375:7): [True: 0, False: 0] | | ------------------ | | 376| 0| (stats) |= (1 << (n));\ | | 377| 0|} while (0) | | ------------------ | | | Branch (377:10): [Folded - Ignored] | | ------------------ ------------------ 5069| 5.39k| env->num_named++; 5070| 5.39k| } 5071| 0| else { 5072| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 660| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5073| 0| } 5074| 5.39k| } 5075| |#else 5076| | else { 5077| | return ONIGERR_UNDEFINED_GROUP_OPTION; 5078| | } 5079| |#endif 5080| 5.39k| break; 5081| | 5082| 5.39k|#ifdef USE_CAPTURE_HISTORY 5083| 5.39k| case '@': ------------------ | Branch (5083:5): [True: 0, False: 14.8k] ------------------ 5084| 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] | | ------------------ ------------------ 5085| 0|# ifdef USE_NAMED_GROUP 5086| 0| if (!PEND && ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ | Branch (5086:6): [True: 0, False: 0] ------------------ 5087| 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] | | ------------------ ------------------ 5088| 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)); \ | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 309| 0|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 5089| 0| if (c == '<' || c == '\'') { ------------------ | Branch (5089:8): [True: 0, False: 0] | Branch (5089:20): [True: 0, False: 0] ------------------ 5090| 0| list_capture = 1; 5091| 0| goto named_group2; /* (?@...) */ 5092| 0| } 5093| 0| PUNFETCH; ------------------ | | 300| 0|#define PUNFETCH p = pfetch_prev ------------------ 5094| 0| } 5095| 0|# endif 5096| 0| *np = node_new_enclose_memory(env->option, 0); 5097| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 308| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 5098| 0| num = scan_env_add_mem_entry(env); 5099| 0| if (num < 0) return num; ------------------ | Branch (5099:6): [True: 0, False: 0] ------------------ 5100| 0| if (num >= (int )BIT_STATUS_BITS_NUM) ------------------ | | 361| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) ------------------ | Branch (5100:6): [True: 0, False: 0] ------------------ 5101| 0| return ONIGERR_GROUP_NUMBER_OVER_FOR_CAPTURE_HISTORY; ------------------ | | 687| 0|#define ONIGERR_GROUP_NUMBER_OVER_FOR_CAPTURE_HISTORY -222 ------------------ 5102| | 5103| 0| NENCLOSE(*np)->regnum = num; ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 5104| 0| BIT_STATUS_ON_AT_SIMPLE(env->capture_history, num); ------------------ | | 374| 0|#define BIT_STATUS_ON_AT_SIMPLE(stats,n) do {\ | | 375| 0| if ((n) < (int )BIT_STATUS_BITS_NUM)\ | | ------------------ | | | | 361| 0|#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8) | | ------------------ | | | Branch (375:7): [True: 0, False: 0] | | ------------------ | | 376| 0| (stats) |= (1 << (n));\ | | 377| 0|} while (0) | | ------------------ | | | Branch (377:10): [Folded - Ignored] | | ------------------ ------------------ 5105| 0| } 5106| 0| else { 5107| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 660| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5108| 0| } 5109| 0| break; 5110| 0|#endif /* USE_CAPTURE_HISTORY */ 5111| | 5112| 0| case '(': /* conditional expression: (?(cond)yes), (?(cond)yes|no) */ ------------------ | Branch (5112:5): [True: 0, False: 14.8k] ------------------ 5113| 0| if (!PEND && ------------------ | | 299| 0|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:23): [True: 0, False: 0] | | ------------------ ------------------ | Branch (5113:11): [True: 0, False: 0] ------------------ 5114| 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] | | ------------------ ------------------ 5115| 0| UChar *name = NULL; ------------------ | | 76| 0|# define UChar OnigUChar ------------------ 5116| 0| UChar *name_end; ------------------ | | 76| 0|# define UChar OnigUChar ------------------ 5117| 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)); \ | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 309| 0|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 5118| 0| if (ONIGENC_IS_CODE_DIGIT(enc, c)) { /* (n) */ ------------------ | | 397| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_DIGIT) | | ------------------ | | | | 372| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (372:48): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 5119| 0| PUNFETCH; ------------------ | | 300| 0|#define PUNFETCH p = pfetch_prev ------------------ 5120| 0| r = fetch_name((OnigCodePoint )'(', &p, end, &name_end, env, &num, 1); 5121| 0| if (r < 0) return r; ------------------ | Branch (5121:8): [True: 0, False: 0] ------------------ 5122| |#if 0 5123| | /* Relative number is not currently supported. (same as Perl) */ 5124| | if (num < 0) { 5125| | num = BACKREF_REL_TO_ABS(num, env); 5126| | if (num <= 0) 5127| | return ONIGERR_INVALID_BACKREF; 5128| | } 5129| |#endif 5130| 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] | | ------------------ ------------------ 5131| 0| if (num > env->num_mem || ------------------ | Branch (5131:10): [True: 0, False: 0] ------------------ 5132| 0| IS_NULL(SCANENV_MEM_NODES(env)[num])) ------------------ | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 0] | | | Branch (305:49): [True: 0, False: 0] | | ------------------ ------------------ 5133| 0| return ONIGERR_INVALID_BACKREF; ------------------ | | 674| 0|#define ONIGERR_INVALID_BACKREF -208 ------------------ 5134| 0| } 5135| 0| } 5136| 0|#ifdef USE_NAMED_GROUP 5137| 0| else if (c == '<' || c == '\'') { /* (), ('name') */ ------------------ | Branch (5137:11): [True: 0, False: 0] | Branch (5137:23): [True: 0, False: 0] ------------------ 5138| 0| name = p; 5139| 0| r = fetch_named_backref_token(c, tok, &p, end, env); 5140| 0| if (r < 0) return r; ------------------ | Branch (5140:8): [True: 0, False: 0] ------------------ 5141| 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) | | | | ------------------ | | | | | | 366| 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; ------------------ | | 660| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ | Branch (5141:8): [True: 0, False: 0] ------------------ 5142| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 304| 0|} while (0) | | ------------------ | | | Branch (304:10): [Folded - Ignored] | | ------------------ ------------------ 5143| | 5144| 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] | | ------------------ ------------------ 5145| 0| num = tok->u.backref.ref1; 5146| 0| } 5147| 0| else { 5148| | /* FIXME: 5149| | * Use left most named group for now. This is the same as Perl. 5150| | * However this should use the same strategy as normal back- 5151| | * references on Ruby syntax; search right to left. */ 5152| 0| int len = tok->u.backref.num; 5153| 0| num = len > 1 ? tok->u.backref.refs[0] : tok->u.backref.ref1; ------------------ | Branch (5153:12): [True: 0, False: 0] ------------------ 5154| 0| } 5155| 0| } 5156| 0|#endif 5157| 0| else 5158| 0| return ONIGERR_INVALID_CONDITION_PATTERN; ------------------ | | 664| 0|#define ONIGERR_INVALID_CONDITION_PATTERN -124 ------------------ 5159| 0| *np = node_new_enclose(ENCLOSE_CONDITION); ------------------ | | 97| 0|#define ENCLOSE_CONDITION (1<<3) ------------------ 5160| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 308| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 5161| 0| NENCLOSE(*np)->regnum = num; ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 5162| 0| if (IS_NOT_NULL(name)) NENCLOSE(*np)->state |= NST_NAME_REF; ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306: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) ------------------ 5163| 0| } 5164| 0| else 5165| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 660| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5166| 0| break; 5167| | 5168| |#if 0 5169| | case '|': /* branch reset: (?|...) */ 5170| | if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_VBAR_BRANCH_RESET)) { 5171| | /* TODO */ 5172| | } 5173| | else 5174| | return ONIGERR_UNDEFINED_GROUP_OPTION; 5175| | break; 5176| |#endif 5177| | 5178| 0| case '^': /* loads default options */ ------------------ | Branch (5178:5): [True: 0, False: 14.8k] ------------------ 5179| 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 (5179:11): [True: 0, False: 0] ------------------ 5180| | /* d-imsx */ 5181| 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] | | ------------------ ------------------ 5182| 0| ONOFF(option, ONIG_OPTION_IGNORECASE, 1); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [Folded - Ignored] | | ------------------ ------------------ 5183| 0| ONOFF(option, ONIG_OPTION_SINGLELINE, 0); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [Folded - Ignored] | | ------------------ ------------------ 5184| 0| ONOFF(option, ONIG_OPTION_MULTILINE, 1); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [Folded - Ignored] | | ------------------ ------------------ 5185| 0| ONOFF(option, ONIG_OPTION_EXTEND, 1); ------------------ | | 160| 0|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [Folded - Ignored] | | ------------------ ------------------ 5186| 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)); \ | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 309| 0|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 5187| 0| } 5188| |#if 0 5189| | else if (!PEND && IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_RUBY)) { 5190| | /* d-imx */ 5191| | ONOFF(option, ONIG_OPTION_ASCII_RANGE, 0); 5192| | ONOFF(option, ONIG_OPTION_POSIX_BRACKET_ALL_RANGE, 0); 5193| | ONOFF(option, ONIG_OPTION_WORD_BOUND_ALL_RANGE, 0); 5194| | ONOFF(option, ONIG_OPTION_IGNORECASE, 1); 5195| | ONOFF(option, ONIG_OPTION_MULTILINE, 1); 5196| | ONOFF(option, ONIG_OPTION_EXTEND, 1); 5197| | PFETCH(c); 5198| | } 5199| |#endif 5200| 0| else { 5201| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 660| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5202| 0| } 5203| | /* fall through */ 5204| |#ifdef USE_POSIXLINE_OPTION 5205| | case 'p': 5206| |#endif 5207| 1.34k| case '-': case 'i': case 'm': case 's': case 'x': ------------------ | Branch (5207:5): [True: 0, False: 14.8k] | Branch (5207:15): [True: 0, False: 14.8k] | Branch (5207:25): [True: 0, False: 14.8k] | Branch (5207:35): [True: 0, False: 14.8k] | Branch (5207:45): [True: 1.34k, False: 13.4k] ------------------ 5208| 1.34k| case 'a': case 'd': case 'l': case 'u': ------------------ | Branch (5208:5): [True: 0, False: 14.8k] | Branch (5208:15): [True: 0, False: 14.8k] | Branch (5208:25): [True: 0, False: 14.8k] | Branch (5208:35): [True: 0, False: 14.8k] ------------------ 5209| 1.34k| { 5210| 1.34k| int neg = 0; 5211| | 5212| 2.69k| while (1) { ------------------ | Branch (5212:9): [Folded - Ignored] ------------------ 5213| 2.69k| switch (c) { 5214| 1.34k| case ':': ------------------ | Branch (5214:4): [True: 1.34k, False: 1.34k] ------------------ 5215| 1.34k| case ')': ------------------ | Branch (5215:4): [True: 0, False: 2.69k] ------------------ 5216| 1.34k| break; 5217| | 5218| 0| case '-': neg = 1; break; ------------------ | Branch (5218:4): [True: 0, False: 2.69k] ------------------ 5219| 1.34k| case 'x': ONOFF(option, ONIG_OPTION_EXTEND, neg); break; ------------------ | | 160| 1.34k|#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f)) | | ------------------ | | | Branch (160:32): [True: 0, False: 1.34k] | | ------------------ ------------------ | Branch (5219:4): [True: 1.34k, False: 1.34k] ------------------ 5220| 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 (5220:4): [True: 0, False: 2.69k] ------------------ 5221| 0| case 's': ------------------ | Branch (5221:4): [True: 0, False: 2.69k] ------------------ 5222| 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] | | ------------------ ------------------ 5223| 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] | | ------------------ ------------------ 5224| 0| } 5225| 0| else 5226| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 660| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5227| 0| break; 5228| | 5229| 0| case 'm': ------------------ | Branch (5229:4): [True: 0, False: 2.69k] ------------------ 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_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] | | ------------------ ------------------ 5232| 0| } 5233| 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] | | ------------------ ------------------ 5234| 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] | | ------------------ ------------------ 5235| 0| } 5236| 0| else 5237| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 660| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5238| 0| break; 5239| |#ifdef USE_POSIXLINE_OPTION 5240| | case 'p': 5241| | ONOFF(option, ONIG_OPTION_MULTILINE|ONIG_OPTION_SINGLELINE, neg); 5242| | break; 5243| |#endif 5244| | 5245| 0| case 'a': /* limits \d, \s, \w and POSIX brackets to ASCII range */ ------------------ | Branch (5245:4): [True: 0, False: 2.69k] ------------------ 5246| 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] | | ------------------ ------------------ 5247| 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] | | ------------------ ------------------ 5248| 0| (neg == 0)) { ------------------ | Branch (5248:3): [True: 0, False: 0] ------------------ 5249| 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] | | ------------------ ------------------ 5250| 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] | | ------------------ ------------------ 5251| 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] | | ------------------ ------------------ 5252| 0| } 5253| 0| else 5254| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 660| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5255| 0| break; 5256| | 5257| 0| case 'u': ------------------ | Branch (5257:4): [True: 0, False: 2.69k] ------------------ 5258| 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] | | ------------------ ------------------ 5259| 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] | | ------------------ ------------------ 5260| 0| (neg == 0)) { ------------------ | Branch (5260:3): [True: 0, False: 0] ------------------ 5261| 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] | | ------------------ ------------------ 5262| 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] | | ------------------ ------------------ 5263| 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] | | ------------------ ------------------ 5264| 0| } 5265| 0| else 5266| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 660| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5267| 0| break; 5268| | 5269| 0| case 'd': ------------------ | Branch (5269:4): [True: 0, False: 2.69k] ------------------ 5270| 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] | | ------------------ ------------------ 5271| 0| (neg == 0)) { ------------------ | Branch (5271:3): [True: 0, False: 0] ------------------ 5272| 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] | | ------------------ ------------------ 5273| 0| } 5274| 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] | | ------------------ ------------------ 5275| 0| (neg == 0)) { ------------------ | Branch (5275:3): [True: 0, False: 0] ------------------ 5276| 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] | | ------------------ ------------------ 5277| 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] | | ------------------ ------------------ 5278| 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] | | ------------------ ------------------ 5279| 0| } 5280| 0| else 5281| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 660| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5282| 0| break; 5283| | 5284| 0| case 'l': ------------------ | Branch (5284:4): [True: 0, False: 2.69k] ------------------ 5285| 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 (5285:66): [True: 0, False: 0] ------------------ 5286| 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] | | ------------------ ------------------ 5287| 0| } 5288| 0| else 5289| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 660| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5290| 0| break; 5291| | 5292| 0| default: ------------------ | Branch (5292:4): [True: 0, False: 2.69k] ------------------ 5293| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 660| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5294| 2.69k| } 5295| | 5296| 2.69k| if (c == ')') { ------------------ | Branch (5296:8): [True: 0, False: 2.69k] ------------------ 5297| 0| *np = node_new_option(option); 5298| 0| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 308| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 5299| 0| *src = p; 5300| 0| return 2; /* option only */ 5301| 0| } 5302| 2.69k| else if (c == ':') { ------------------ | Branch (5302:13): [True: 1.34k, False: 1.34k] ------------------ 5303| 1.34k| OnigOptionType prev = env->option; 5304| | 5305| 1.34k| env->option = option; 5306| 1.34k| r = fetch_token(tok, &p, end, env); 5307| 1.34k| if (r < 0) { ------------------ | Branch (5307:10): [True: 0, False: 1.34k] ------------------ 5308| 0| env->option = prev; 5309| 0| return r; 5310| 0| } 5311| 1.34k| r = parse_subexp(&target, tok, term, &p, end, env); 5312| 1.34k| env->option = prev; 5313| 1.34k| if (r < 0) return r; ------------------ | Branch (5313:10): [True: 0, False: 1.34k] ------------------ 5314| 1.34k| *np = node_new_option(option); 5315| 1.34k| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 308| 1.34k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 1.34k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 1.34k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 5316| 1.34k| NENCLOSE(*np)->target = target; ------------------ | | 81| 1.34k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 5317| 1.34k| *src = p; 5318| 1.34k| return 0; 5319| 1.34k| } 5320| | 5321| 1.34k| if (PEND) return ONIGERR_END_PATTERN_IN_GROUP; ------------------ | | 299| 1.34k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 1.34k] | | | Branch (299:23): [True: 1.34k, False: 0] | | ------------------ ------------------ if (PEND) return ONIGERR_END_PATTERN_IN_GROUP; ------------------ | | 659| 0|#define ONIGERR_END_PATTERN_IN_GROUP -118 ------------------ 5322| 1.34k| PFETCH(c); ------------------ | | 305| 1.34k|#define PFETCH(c) do { \ | | 306| 1.34k| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 366| 1.34k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 1.34k] | | ------------------ | | 307| 1.34k| pfetch_prev = p; \ | | 308| 1.34k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 1.34k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 361| 1.34k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 1.34k] | | | | ------------------ | | ------------------ | | 309| 1.34k|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 5323| 1.34k| } 5324| 1.34k| } 5325| 0| break; 5326| | 5327| 0| default: ------------------ | Branch (5327:5): [True: 0, False: 14.8k] ------------------ 5328| 0| return ONIGERR_UNDEFINED_GROUP_OPTION; ------------------ | | 660| 0|#define ONIGERR_UNDEFINED_GROUP_OPTION -119 ------------------ 5329| 14.8k| } 5330| 14.8k| } 5331| 1.34k| else { 5332| 1.34k| if (ONIG_IS_OPTION_ON(env->option, ONIG_OPTION_DONT_CAPTURE_GROUP)) ------------------ | | 476| 1.34k|#define ONIG_IS_OPTION_ON(options,option) ((options) & (option)) | | ------------------ | | | Branch (476:45): [True: 0, False: 1.34k] | | ------------------ ------------------ 5333| 0| goto group; 5334| | 5335| 1.34k| *np = node_new_enclose_memory(env->option, 0); 5336| 1.34k| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 308| 1.34k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 1.34k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 1.34k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 5337| 1.34k| num = scan_env_add_mem_entry(env); 5338| 1.34k| if (num < 0) return num; ------------------ | Branch (5338:9): [True: 0, False: 1.34k] ------------------ 5339| 1.34k| NENCLOSE(*np)->regnum = num; ------------------ | | 81| 1.34k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 5340| 1.34k| } 5341| | 5342| 6.74k| CHECK_NULL_RETURN_MEMERR(*np); ------------------ | | 308| 6.74k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 6.74k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 6.74k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 5343| 6.74k| r = fetch_token(tok, &p, end, env); 5344| 6.74k| if (r < 0) return r; ------------------ | Branch (5344:7): [True: 0, False: 6.74k] ------------------ 5345| 6.74k| r = parse_subexp(&target, tok, term, &p, end, env); 5346| 6.74k| if (r < 0) { ------------------ | Branch (5346:7): [True: 0, False: 6.74k] ------------------ 5347| 0| onig_node_free(target); 5348| 0| return r; 5349| 0| } 5350| | 5351| 6.74k| if (NTYPE(*np) == NT_ANCHOR) ------------------ | | 69| 6.74k|#define NTYPE(node) ((node)->u.base.type) ------------------ if (NTYPE(*np) == NT_ANCHOR) ------------------ | | 45| 6.74k|#define NT_ANCHOR 7 ------------------ | Branch (5351:7): [True: 0, False: 6.74k] ------------------ 5352| 0| NANCHOR(*np)->target = target; ------------------ | | 82| 0|#define NANCHOR(node) (&((node)->u.anchor)) ------------------ 5353| 6.74k| else { 5354| 6.74k| NENCLOSE(*np)->target = target; ------------------ | | 81| 6.74k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 5355| 6.74k| if (NENCLOSE(*np)->type == ENCLOSE_MEMORY) { ------------------ | | 81| 6.74k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ if (NENCLOSE(*np)->type == ENCLOSE_MEMORY) { ------------------ | | 94| 6.74k|#define ENCLOSE_MEMORY (1<<0) ------------------ | Branch (5355:9): [True: 6.74k, False: 0] ------------------ 5356| | /* Don't move this to previous of parse_subexp() */ 5357| 6.74k| r = scan_env_set_mem_node(env, NENCLOSE(*np)->regnum, *np); ------------------ | | 81| 6.74k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 5358| 6.74k| if (r != 0) return r; ------------------ | Branch (5358:11): [True: 0, False: 6.74k] ------------------ 5359| 6.74k| } 5360| 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 (5360:14): [True: 0, False: 0] ------------------ 5361| 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 (5361:11): [True: 0, False: 0] ------------------ 5362| | /* convert (?(cond)yes) to (?(cond)yes|empty) */ 5363| 0| work1 = node_new_empty(); 5364| 0| if (IS_NULL(work1)) goto err; ------------------ | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 0] | | ------------------ ------------------ 5365| 0| work2 = onig_node_new_alt(work1, NULL_NODE); ------------------ | | 283| 0|#define NULL_NODE ((Node* )0) ------------------ 5366| 0| if (IS_NULL(work2)) goto err; ------------------ | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 0] | | ------------------ ------------------ 5367| 0| work1 = onig_node_new_alt(target, work2); 5368| 0| if (IS_NULL(work1)) goto err; ------------------ | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 0] | | ------------------ ------------------ 5369| 0| NENCLOSE(*np)->target = work1; ------------------ | | 81| 0|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 5370| 0| } 5371| 0| } 5372| 6.74k| } 5373| | 5374| 6.74k| *src = p; 5375| 6.74k| return 0; 5376| | 5377| 0| err: 5378| 0| onig_node_free(work1); 5379| 0| onig_node_free(work2); 5380| 0| onig_node_free(*np); 5381| 0| *np = NULL; 5382| 0| return ONIGERR_MEMORY; ------------------ | | 629| 0|#define ONIGERR_MEMORY -5 ------------------ 5383| 6.74k|} regparse.c:scan_env_add_mem_entry: 1016| 6.74k|{ 1017| 6.74k| int i, need, alloc; 1018| 6.74k| Node** p; 1019| | 1020| 6.74k| need = env->num_mem + 1; 1021| 6.74k| if (need > ONIG_MAX_CAPTURE_GROUP_NUM) ------------------ | | 438| 6.74k|#define ONIG_MAX_CAPTURE_GROUP_NUM 32767 ------------------ | Branch (1021:7): [True: 0, False: 6.74k] ------------------ 1022| 0| return ONIGERR_TOO_MANY_CAPTURE_GROUPS; ------------------ | | 676| 0|#define ONIGERR_TOO_MANY_CAPTURE_GROUPS -210 ------------------ 1023| 6.74k| if (need >= SCANENV_MEMNODES_SIZE) { ------------------ | | 285| 6.74k|#define SCANENV_MEMNODES_SIZE 8 ------------------ | Branch (1023:7): [True: 0, False: 6.74k] ------------------ 1024| 0| if (env->mem_alloc <= need) { ------------------ | Branch (1024:9): [True: 0, False: 0] ------------------ 1025| 0| if (IS_NULL(env->mem_nodes_dynamic)) { ------------------ | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305: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); ------------------ | | 308| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 1029| 0| xmemcpy(p, env->mem_nodes_static, ------------------ | | 209| 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); ------------------ | | 308| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 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| 6.74k| env->num_mem++; 1047| 6.74k| return env->num_mem; 1048| 6.74k|} regparse.c:name_add: 773| 5.39k|{ 774| 5.39k| int alloc; 775| 5.39k| NameEntry* e; 776| 5.39k| NameTable* t = (NameTable* )reg->name_table; 777| | 778| 5.39k| if (name_end - name <= 0) ------------------ | Branch (778:7): [True: 0, False: 5.39k] ------------------ 779| 0| return ONIGERR_EMPTY_GROUP_NAME; ------------------ | | 679| 0|#define ONIGERR_EMPTY_GROUP_NAME -214 ------------------ 780| | 781| 5.39k| e = name_find(reg, name, name_end); 782| 5.39k| if (IS_NULL(e)) { ------------------ | | 305| 5.39k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 5.39k, False: 0] | | ------------------ ------------------ 783| 5.39k|# ifdef USE_ST_LIBRARY 784| 5.39k| if (IS_NULL(t)) { ------------------ | | 305| 5.39k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 1.34k, False: 4.04k] | | ------------------ ------------------ 785| 1.34k| t = onig_st_init_strend_table_with_size(5); 786| 1.34k| reg->name_table = (void* )t; 787| 1.34k| } 788| 5.39k| e = (NameEntry* )xmalloc(sizeof(NameEntry)); ------------------ | | 142| 5.39k|# define xmalloc malloc ------------------ 789| 5.39k| CHECK_NULL_RETURN_MEMERR(e); ------------------ | | 308| 5.39k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 5.39k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 5.39k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 790| | 791| 5.39k| e->name = strdup_with_null(reg->enc, name, name_end); 792| 5.39k| if (IS_NULL(e->name)) { ------------------ | | 305| 5.39k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 5.39k] | | ------------------ ------------------ 793| 0| xfree(e); ------------------ | | 145| 0|# define xfree free ------------------ 794| 0| return ONIGERR_MEMORY; ------------------ | | 629| 0|#define ONIGERR_MEMORY -5 ------------------ 795| 0| } 796| 5.39k| onig_st_insert_strend(t, e->name, (e->name + (name_end - name)), 797| 5.39k| (HashDataType )e); 798| | 799| 5.39k| e->name_len = name_end - name; 800| 5.39k| e->back_num = 0; 801| 5.39k| e->back_alloc = 0; 802| 5.39k| 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| 5.39k| } 849| | 850| 5.39k| if (e->back_num >= 1 && ------------------ | Branch (850:7): [True: 0, False: 5.39k] ------------------ 851| 5.39k| ! 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, ------------------ | | 684| 0|#define ONIGERR_MULTIPLEX_DEFINED_NAME -219 ------------------ 853| 0| name, name_end); 854| 0| return ONIGERR_MULTIPLEX_DEFINED_NAME; ------------------ | | 684| 0|#define ONIGERR_MULTIPLEX_DEFINED_NAME -219 ------------------ 855| 0| } 856| | 857| 5.39k| e->back_num++; 858| 5.39k| if (e->back_num == 1) { ------------------ | Branch (858:7): [True: 5.39k, False: 0] ------------------ 859| 5.39k| e->back_ref1 = backref; 860| 5.39k| } 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); ------------------ | | 308| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 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); ------------------ | | 308| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 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| 5.39k| return 0; 884| 5.39k|} regparse.c:strdup_with_null: 271| 5.39k|{ 272| 5.39k| ptrdiff_t slen; 273| 5.39k| int term_len, i; 274| 5.39k| UChar *r; ------------------ | | 76| 5.39k|# define UChar OnigUChar ------------------ 275| | 276| 5.39k| slen = end - s; 277| 5.39k| term_len = ONIGENC_MBC_MINLEN(enc); ------------------ | | 364| 5.39k|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) ------------------ 278| | 279| 5.39k| r = (UChar* )xmalloc(slen + term_len); ------------------ | | 142| 5.39k|# define xmalloc malloc ------------------ 280| 5.39k| CHECK_NULL_RETURN(r); ------------------ | | 307| 5.39k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 305| 5.39k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 5.39k] | | | | ------------------ | | ------------------ ------------------ 281| 5.39k| xmemcpy(r, s, slen); ------------------ | | 209| 5.39k|#define xmemcpy memcpy ------------------ 282| | 283| 10.7k| for (i = 0; i < term_len; i++) ------------------ | Branch (283:15): [True: 5.39k, False: 5.39k] ------------------ 284| 5.39k| r[slen + i] = (UChar )0; 285| | 286| 5.39k| return r; 287| 5.39k|} regparse.c:node_new_option: 1368| 1.34k|{ 1369| 1.34k| Node* node = node_new_enclose(ENCLOSE_OPTION); ------------------ | | 95| 1.34k|#define ENCLOSE_OPTION (1<<1) ------------------ 1370| 1.34k| CHECK_NULL_RETURN(node); ------------------ | | 307| 1.34k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 305| 1.34k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 1.34k] | | | | ------------------ | | ------------------ ------------------ 1371| 1.34k| NENCLOSE(node)->option = option; ------------------ | | 81| 1.34k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1372| 1.34k| return node; 1373| 1.34k|} regparse.c:add_code_range_to_buf0: 1672| 409k|{ 1673| 409k| int r, inc_n, pos; 1674| 409k| OnigCodePoint low, high, bound, x; 1675| 409k| OnigCodePoint n, *data; 1676| 409k| BBuf* bbuf; 1677| | 1678| 409k| if (from > to) { ------------------ | Branch (1678:7): [True: 0, False: 409k] ------------------ 1679| 0| n = from; from = to; to = n; 1680| 0| } 1681| | 1682| 409k| if (IS_NULL(*pbuf)) { ------------------ | | 305| 409k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 17.5k, False: 392k] | | ------------------ ------------------ 1683| 17.5k| r = new_code_range(pbuf); 1684| 17.5k| if (r) return r; ------------------ | Branch (1684:9): [True: 0, False: 17.5k] ------------------ 1685| 17.5k| bbuf = *pbuf; 1686| 17.5k| n = 0; 1687| 17.5k| } 1688| 392k| else { 1689| 392k| bbuf = *pbuf; 1690| 392k| GET_CODE_POINT(n, bbuf->p); ------------------ | | 704| 392k|#define GET_CODE_POINT(code,p) code = *((OnigCodePoint* )(p)) ------------------ 1691| 392k| } 1692| 409k| data = (OnigCodePoint* )(bbuf->p); 1693| 409k| data++; 1694| | 1695| 409k| bound = (from == 0) ? 0 : n; ------------------ | Branch (1695:11): [True: 0, False: 409k] ------------------ 1696| 1.82M| for (low = 0; low < bound; ) { ------------------ | Branch (1696:17): [True: 1.41M, False: 409k] ------------------ 1697| 1.41M| x = (low + bound) >> 1; 1698| 1.41M| if (from - 1 > data[x*2 + 1]) ------------------ | Branch (1698:9): [True: 1.41M, False: 0] ------------------ 1699| 1.41M| low = x + 1; 1700| 0| else 1701| 0| bound = x; 1702| 1.41M| } 1703| | 1704| 409k| high = (to == ONIG_LAST_CODE_POINT) ? n : low; ------------------ | | 311| 409k|#define ONIG_LAST_CODE_POINT (~((OnigCodePoint )0)) ------------------ | Branch (1704:10): [True: 0, False: 409k] ------------------ 1705| 409k| for (bound = n; high < bound; ) { ------------------ | Branch (1705:19): [True: 0, False: 409k] ------------------ 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| 409k| inc_n = low + 1 - high; 1717| 409k| if (n + inc_n > ONIG_MAX_MULTI_BYTE_RANGES_NUM) ------------------ | | 441| 409k|#define ONIG_MAX_MULTI_BYTE_RANGES_NUM 10000 ------------------ | Branch (1717:7): [True: 0, False: 409k] ------------------ 1718| 0| return ONIGERR_TOO_MANY_MULTI_BYTE_RANGES; ------------------ | | 671| 0|#define ONIGERR_TOO_MANY_MULTI_BYTE_RANGES -205 ------------------ 1719| | 1720| 409k| if (inc_n != 1) { ------------------ | Branch (1720:7): [True: 0, False: 409k] ------------------ 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| 409k| if (inc_n != 0) { ------------------ | Branch (1730:7): [True: 409k, False: 0] ------------------ 1731| 409k| int from_pos = SIZE_CODE_POINT * (1 + high * 2); ------------------ | | 690| 409k|#define SIZE_CODE_POINT (int )sizeof(OnigCodePoint) ------------------ 1732| 409k| int to_pos = SIZE_CODE_POINT * (1 + (low + 1) * 2); ------------------ | | 690| 409k|#define SIZE_CODE_POINT (int )sizeof(OnigCodePoint) ------------------ 1733| | 1734| 409k| if (inc_n > 0) { ------------------ | Branch (1734:9): [True: 409k, False: 0] ------------------ 1735| 409k| if (high < n) { ------------------ | Branch (1735:11): [True: 0, False: 409k] ------------------ 1736| 0| int size = (n - high) * 2 * SIZE_CODE_POINT; ------------------ | | 690| 0|#define SIZE_CODE_POINT (int )sizeof(OnigCodePoint) ------------------ 1737| 0| BBUF_MOVE_RIGHT(bbuf, from_pos, to_pos, size); ------------------ | | 504| 0|#define BBUF_MOVE_RIGHT(buf,from,to,n) do {\ | | 505| 0| if ((unsigned int )((to)+(n)) > (buf)->alloc) BBUF_EXPAND((buf),(to) + (n));\ | | ------------------ | | | | 464| 0|#define BBUF_EXPAND(buf,low) do{\ | | | | 465| 0| UChar *tmp;\ | | | | ------------------ | | | | | | 76| 0|# define UChar OnigUChar | | | | ------------------ | | | | 466| 0| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | ------------------ | | | | | Branch (466:36): [True: 0, False: 0] | | | | ------------------ | | | | 467| 0| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | ------------------ | | | | | | 143| 0|# define xrealloc realloc | | | | ------------------ | | | | 468| 0| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | ------------------ | | | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | ------------------ | | | | | | | Branch (305:39): [True: 0, False: 0] | | | | | | ------------------ | | | | ------------------ | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | ------------------ | | | | | | 629| 0|#define ONIGERR_MEMORY -5 | | | | ------------------ | | | | 469| 0| (buf)->p = tmp;\ | | | | 470| 0|} while (0) | | | | ------------------ | | | | | Branch (470:10): [Folded - Ignored] | | | | ------------------ | | ------------------ | | | Branch (505:7): [True: 0, False: 0] | | ------------------ | | 506| 0| xmemmove((buf)->p + (to), (buf)->p + (from), (n));\ | | ------------------ | | | | 210| 0|#define xmemmove memmove | | ------------------ | | 507| 0| if ((unsigned int )((to)+(n)) > (buf)->used) (buf)->used = (to) + (n);\ | | ------------------ | | | Branch (507:7): [True: 0, False: 0] | | ------------------ | | 508| 0|} while (0) | | ------------------ | | | Branch (508:10): [Folded - Ignored] | | ------------------ ------------------ 1738| 0| } 1739| 409k| } 1740| 0| else { 1741| 0| BBUF_MOVE_LEFT_REDUCE(bbuf, from_pos, to_pos); ------------------ | | 516| 0|#define BBUF_MOVE_LEFT_REDUCE(buf,from,to) do {\ | | 517| 0| xmemmove((buf)->p + (to), (buf)->p + (from), (buf)->used - (from));\ | | ------------------ | | | | 210| 0|#define xmemmove memmove | | ------------------ | | 518| 0| (buf)->used -= (from - to);\ | | 519| 0|} while (0) | | ------------------ | | | Branch (519:10): [Folded - Ignored] | | ------------------ ------------------ 1742| 0| } 1743| 409k| } 1744| | 1745| 409k| pos = SIZE_CODE_POINT * (1 + low * 2); ------------------ | | 690| 409k|#define SIZE_CODE_POINT (int )sizeof(OnigCodePoint) ------------------ 1746| 409k| BBUF_ENSURE_SIZE(bbuf, pos + SIZE_CODE_POINT * 2); ------------------ | | 472| 409k|#define BBUF_ENSURE_SIZE(buf,size) do{\ | | 473| 409k| unsigned int new_alloc = (buf)->alloc;\ | | 474| 461k| while (new_alloc < (unsigned int )(size)) { new_alloc *= 2; }\ | | ------------------ | | | Branch (474:10): [True: 51.2k, False: 409k] | | ------------------ | | 475| 409k| if ((buf)->alloc != new_alloc) {\ | | ------------------ | | | Branch (475:7): [True: 51.2k, False: 358k] | | ------------------ | | 476| 51.2k| UChar *tmp;\ | | ------------------ | | | | 76| 51.2k|# define UChar OnigUChar | | ------------------ | | 477| 51.2k| tmp = (UChar* )xrealloc((buf)->p, new_alloc);\ | | ------------------ | | | | 143| 51.2k|# define xrealloc realloc | | ------------------ | | 478| 51.2k| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | ------------------ | | | | 305| 51.2k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 51.2k] | | | | ------------------ | | ------------------ | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ | | 479| 51.2k| (buf)->p = tmp;\ | | 480| 51.2k| (buf)->alloc = new_alloc;\ | | 481| 51.2k| }\ | | 482| 409k|} while (0) | | ------------------ | | | Branch (482:10): [Folded - Ignored] | | ------------------ ------------------ 1747| 409k| BBUF_WRITE_CODE_POINT(bbuf, pos, from); ------------------ | | 1645| 409k| BBUF_WRITE(bbuf, pos, &(code), SIZE_CODE_POINT) | | ------------------ | | | | 484| 409k|#define BBUF_WRITE(buf,pos,bytes,n) do{\ | | | | 485| 409k| int used = (pos) + (int )(n);\ | | | | 486| 409k| if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ | | | | ------------------ | | | | | | 464| 0|#define BBUF_EXPAND(buf,low) do{\ | | | | | | 465| 0| UChar *tmp;\ | | | | | | ------------------ | | | | | | | | 76| 0|# define UChar OnigUChar | | | | | | ------------------ | | | | | | 466| 0| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | | | ------------------ | | | | | | | Branch (466:36): [True: 0, False: 0] | | | | | | ------------------ | | | | | | 467| 0| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | | | ------------------ | | | | | | | | 143| 0|# define xrealloc realloc | | | | | | ------------------ | | | | | | 468| 0| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | | | ------------------ | | | | | | | | | Branch (305:39): [True: 0, False: 0] | | | | | | | | ------------------ | | | | | | ------------------ | | | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 629| 0|#define ONIGERR_MEMORY -5 | | | | | | ------------------ | | | | | | 469| 0| (buf)->p = tmp;\ | | | | | | 470| 0|} while (0) | | | | | | ------------------ | | | | | | | Branch (470:10): [Folded - Ignored] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (486:7): [True: 0, False: 409k] | | | | ------------------ | | | | 487| 409k| xmemcpy((buf)->p + (pos), (bytes), (n));\ | | | | ------------------ | | | | | | 209| 409k|#define xmemcpy memcpy | | | | ------------------ | | | | 488| 409k| if ((buf)->used < (unsigned int )used) (buf)->used = used;\ | | | | ------------------ | | | | | Branch (488:7): [True: 409k, False: 0] | | | | ------------------ | | | | 489| 409k|} while (0) | | | | ------------------ | | | | | Branch (489:10): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 1748| 409k| BBUF_WRITE_CODE_POINT(bbuf, pos + SIZE_CODE_POINT, to); ------------------ | | 1645| 409k| BBUF_WRITE(bbuf, pos, &(code), SIZE_CODE_POINT) | | ------------------ | | | | 484| 409k|#define BBUF_WRITE(buf,pos,bytes,n) do{\ | | | | 485| 409k| int used = (pos) + (int )(n);\ | | | | 486| 409k| if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ | | | | ------------------ | | | | | | 464| 0|#define BBUF_EXPAND(buf,low) do{\ | | | | | | 465| 0| UChar *tmp;\ | | | | | | ------------------ | | | | | | | | 76| 0|# define UChar OnigUChar | | | | | | ------------------ | | | | | | 466| 0| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | | | ------------------ | | | | | | | Branch (466:36): [True: 0, False: 0] | | | | | | ------------------ | | | | | | 467| 0| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | | | ------------------ | | | | | | | | 143| 0|# define xrealloc realloc | | | | | | ------------------ | | | | | | 468| 0| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | | | ------------------ | | | | | | | | | Branch (305:39): [True: 0, False: 0] | | | | | | | | ------------------ | | | | | | ------------------ | | | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 629| 0|#define ONIGERR_MEMORY -5 | | | | | | ------------------ | | | | | | 469| 0| (buf)->p = tmp;\ | | | | | | 470| 0|} while (0) | | | | | | ------------------ | | | | | | | Branch (470:10): [Folded - Ignored] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (486:7): [True: 0, False: 409k] | | | | ------------------ | | | | 487| 409k| xmemcpy((buf)->p + (pos), (bytes), (n));\ | | | | ------------------ | | | | | | 209| 409k|#define xmemcpy memcpy | | | | ------------------ | | | | 488| 409k| if ((buf)->used < (unsigned int )used) (buf)->used = used;\ | | | | ------------------ | | | | | Branch (488:7): [True: 409k, False: 0] | | | | ------------------ | | | | 489| 409k|} while (0) | | | | ------------------ | | | | | Branch (489:10): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 1749| 409k| n += inc_n; 1750| 409k| BBUF_WRITE_CODE_POINT(bbuf, 0, n); ------------------ | | 1645| 409k| BBUF_WRITE(bbuf, pos, &(code), SIZE_CODE_POINT) | | ------------------ | | | | 484| 409k|#define BBUF_WRITE(buf,pos,bytes,n) do{\ | | | | 485| 409k| int used = (pos) + (int )(n);\ | | | | 486| 409k| if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ | | | | ------------------ | | | | | | 464| 0|#define BBUF_EXPAND(buf,low) do{\ | | | | | | 465| 0| UChar *tmp;\ | | | | | | ------------------ | | | | | | | | 76| 0|# define UChar OnigUChar | | | | | | ------------------ | | | | | | 466| 0| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | | | ------------------ | | | | | | | Branch (466:36): [True: 0, False: 0] | | | | | | ------------------ | | | | | | 467| 0| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | | | ------------------ | | | | | | | | 143| 0|# define xrealloc realloc | | | | | | ------------------ | | | | | | 468| 0| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | | | ------------------ | | | | | | | | | Branch (305:39): [True: 0, False: 0] | | | | | | | | ------------------ | | | | | | ------------------ | | | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 629| 0|#define ONIGERR_MEMORY -5 | | | | | | ------------------ | | | | | | 469| 0| (buf)->p = tmp;\ | | | | | | 470| 0|} while (0) | | | | | | ------------------ | | | | | | | Branch (470:10): [Folded - Ignored] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (486:7): [True: 0, False: 409k] | | | | ------------------ | | | | 487| 409k| xmemcpy((buf)->p + (pos), (bytes), (n));\ | | | | ------------------ | | | | | | 209| 409k|#define xmemcpy memcpy | | | | ------------------ | | | | 488| 409k| if ((buf)->used < (unsigned int )used) (buf)->used = used;\ | | | | ------------------ | | | | | Branch (488:7): [True: 0, False: 409k] | | | | ------------------ | | | | 489| 409k|} while (0) | | | | ------------------ | | | | | Branch (489:10): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 1751| | 1752| 409k| return 0; 1753| 409k|} regparse.c:new_code_range: 1653| 17.5k|{ 1654| 17.5k|#define INIT_MULTI_BYTE_RANGE_SIZE (SIZE_CODE_POINT * 5) 1655| 17.5k| int r; 1656| 17.5k| OnigCodePoint n; 1657| 17.5k| BBuf* bbuf; 1658| | 1659| 17.5k| bbuf = *pbuf = (BBuf* )xmalloc(sizeof(BBuf)); ------------------ | | 142| 17.5k|# define xmalloc malloc ------------------ 1660| 17.5k| CHECK_NULL_RETURN_MEMERR(*pbuf); ------------------ | | 308| 17.5k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 17.5k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 17.5k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 1661| 17.5k| r = BBUF_INIT(*pbuf, INIT_MULTI_BYTE_RANGE_SIZE); ------------------ | | 454| 17.5k|#define BBUF_INIT(buf,size) onig_bbuf_init((BBuf* )(buf), (size)) ------------------ 1662| 17.5k| if (r) return r; ------------------ | Branch (1662:7): [True: 0, False: 17.5k] ------------------ 1663| | 1664| 17.5k| n = 0; 1665| 17.5k| BBUF_WRITE_CODE_POINT(bbuf, 0, n); ------------------ | | 1645| 17.5k| BBUF_WRITE(bbuf, pos, &(code), SIZE_CODE_POINT) | | ------------------ | | | | 484| 17.5k|#define BBUF_WRITE(buf,pos,bytes,n) do{\ | | | | 485| 17.5k| int used = (pos) + (int )(n);\ | | | | 486| 17.5k| if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\ | | | | ------------------ | | | | | | 464| 0|#define BBUF_EXPAND(buf,low) do{\ | | | | | | 465| 0| UChar *tmp;\ | | | | | | ------------------ | | | | | | | | 76| 0|# define UChar OnigUChar | | | | | | ------------------ | | | | | | 466| 0| do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\ | | | | | | ------------------ | | | | | | | Branch (466:36): [True: 0, False: 0] | | | | | | ------------------ | | | | | | 467| 0| tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\ | | | | | | ------------------ | | | | | | | | 143| 0|# define xrealloc realloc | | | | | | ------------------ | | | | | | 468| 0| if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | | | | | ------------------ | | | | | | | | | Branch (305:39): [True: 0, False: 0] | | | | | | | | ------------------ | | | | | | ------------------ | | | | | | if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\ | | | | | | ------------------ | | | | | | | | 629| 0|#define ONIGERR_MEMORY -5 | | | | | | ------------------ | | | | | | 469| 0| (buf)->p = tmp;\ | | | | | | 470| 0|} while (0) | | | | | | ------------------ | | | | | | | Branch (470:10): [Folded - Ignored] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (486:7): [True: 0, False: 17.5k] | | | | ------------------ | | | | 487| 17.5k| xmemcpy((buf)->p + (pos), (bytes), (n));\ | | | | ------------------ | | | | | | 209| 17.5k|#define xmemcpy memcpy | | | | ------------------ | | | | 488| 17.5k| if ((buf)->used < (unsigned int )used) (buf)->used = used;\ | | | | ------------------ | | | | | Branch (488:7): [True: 17.5k, False: 0] | | | | ------------------ | | | | 489| 17.5k|} while (0) | | | | ------------------ | | | | | Branch (489:10): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 1666| 17.5k| return 0; 1667| 17.5k|} regparse.c:bitset_set_range: 193| 17.5k|{ 194| 17.5k| int i; 195| 2.26M| for (i = from; i <= to && i < SINGLE_BYTE_SIZE; i++) { ------------------ | | 420| 2.24M|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 419| 2.24M|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (195:18): [True: 2.24M, False: 17.5k] | Branch (195:29): [True: 2.24M, False: 0] ------------------ 196| 2.24M| BITSET_SET_BIT_CHKDUP(bs, i); ------------------ | | 176| 2.24M|#define BITSET_SET_BIT_CHKDUP(bs, pos) do { \ | | 177| 2.24M| if (BITSET_AT(bs, pos)) CC_DUP_WARN(env, pos, pos); \ | | ------------------ | | | | 442| 2.24M|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 439| 2.24M|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 421| 2.24M|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 2.24M|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 440| 2.24M|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 421| 2.24M|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 2.24M|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (442:36): [True: 0, False: 2.24M] | | | | ------------------ | | ------------------ | | 178| 2.24M| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 439| 2.24M|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 2.24M|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 2.24M|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 440| 2.24M|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 2.24M|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 2.24M|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | 179| 2.24M|} while (0) | | ------------------ | | | Branch (179:10): [Folded - Ignored] | | ------------------ ------------------ 197| 2.24M| } 198| 17.5k|} regparse.c:add_code_range_to_buf: 1757| 409k|{ 1758| 409k| return add_code_range_to_buf0(pbuf, env, from, to, 1); 1759| 409k|} regparse.c:node_new_cclass: 1141| 32.3k|{ 1142| 32.3k| Node* node = node_new(); 1143| 32.3k| CHECK_NULL_RETURN(node); ------------------ | | 307| 32.3k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 305| 32.3k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 32.3k] | | | | ------------------ | | ------------------ ------------------ 1144| | 1145| 32.3k| SET_NTYPE(node, NT_CCLASS); ------------------ | | 71| 32.3k| do { \ | | 72| 32.3k| int value = ntype; \ | | 73| 32.3k| memcpy(&((node)->u.base.type), &value, sizeof(int)); \ | | 74| 32.3k| } while (0) | | ------------------ | | | Branch (74:14): [Folded - Ignored] | | ------------------ ------------------ 1146| 32.3k| initialize_cclass(NCCLASS(node)); ------------------ | | 77| 32.3k|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 1147| 32.3k| return node; 1148| 32.3k|} regparse.c:initialize_cclass: 1132| 67.4k|{ 1133| 67.4k| BITSET_CLEAR(cc->bs); ------------------ | | 434| 67.4k|#define BITSET_CLEAR(bs) do {\ | | 435| 67.4k| int i;\ | | 436| 606k| for (i = 0; i < BITSET_SIZE; i++) { (bs)[i] = 0; } \ | | ------------------ | | | | 422| 606k|#define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM) | | | | ------------------ | | | | | | 420| 606k|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 606k|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM) | | | | ------------------ | | | | | | 421| 606k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 606k|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (436:15): [True: 539k, False: 67.4k] | | ------------------ | | 437| 67.4k|} while (0) | | ------------------ | | | Branch (437:10): [Folded - Ignored] | | ------------------ ------------------ 1134| | /* cc->base.flags = 0; */ 1135| 67.4k| cc->flags = 0; 1136| 67.4k| cc->mbuf = NULL; 1137| 67.4k|} regparse.c:add_ctype_to_cc: 4138| 17.5k|{ 4139| 17.5k| int maxcode; 4140| 17.5k| int c, r; 4141| 17.5k| const OnigCodePoint *ranges; 4142| 17.5k| OnigCodePoint sb_out; 4143| 17.5k| OnigEncoding enc = env->enc; 4144| | 4145| 17.5k| r = ONIGENC_GET_CTYPE_CODE_RANGE(enc, ctype, &sb_out, &ranges); ------------------ | | 404| 17.5k| (enc)->get_ctype_code_range(ctype,sbout,ranges,enc) ------------------ 4146| 17.5k| if (r == 0) { ------------------ | Branch (4146:7): [True: 17.5k, False: 0] ------------------ 4147| 17.5k| if (ascii_range) { ------------------ | Branch (4147:9): [True: 17.5k, False: 0] ------------------ 4148| 17.5k| CClassNode ccwork; 4149| 17.5k| initialize_cclass(&ccwork); 4150| 17.5k| r = add_ctype_to_cc_by_range(&ccwork, ctype, not, env, sb_out, 4151| 17.5k| ranges); 4152| 17.5k| if (r == 0) { ------------------ | Branch (4152:11): [True: 17.5k, False: 0] ------------------ 4153| 17.5k| if (not) { ------------------ | Branch (4153:6): [True: 0, False: 17.5k] ------------------ 4154| 0| r = add_code_range_to_buf0(&(ccwork.mbuf), env, 0x80, ONIG_LAST_CODE_POINT, FALSE); ------------------ | | 311| 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| 17.5k| else { 4157| 17.5k| CClassNode ccascii; 4158| 17.5k| initialize_cclass(&ccascii); 4159| 17.5k| if (ONIGENC_MBC_MINLEN(env->enc) > 1) { ------------------ | | 364| 17.5k|#define ONIGENC_MBC_MINLEN(enc) ((enc)->min_enc_len) ------------------ | Branch (4159:8): [True: 0, False: 17.5k] ------------------ 4160| 0| r = add_code_range(&(ccascii.mbuf), env, 0x00, 0x7F); 4161| 0| } 4162| 17.5k| else { 4163| 17.5k| bitset_set_range(env, ccascii.bs, 0x00, 0x7F); 4164| 17.5k| r = 0; 4165| 17.5k| } 4166| 17.5k| if (r == 0) { ------------------ | Branch (4166:8): [True: 17.5k, False: 0] ------------------ 4167| 17.5k| r = and_cclass(&ccwork, &ccascii, env); 4168| 17.5k| } 4169| 17.5k| if (IS_NOT_NULL(ccascii.mbuf)) bbuf_free(ccascii.mbuf); ------------------ | | 306| 17.5k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 17.5k] | | ------------------ ------------------ 4170| 17.5k| } 4171| 17.5k| if (r == 0) { ------------------ | Branch (4171:6): [True: 17.5k, False: 0] ------------------ 4172| 17.5k| r = or_cclass(cc, &ccwork, env); 4173| 17.5k| } 4174| 17.5k| if (IS_NOT_NULL(ccwork.mbuf)) bbuf_free(ccwork.mbuf); ------------------ | | 306| 17.5k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 17.5k] | | ------------------ ------------------ 4175| 17.5k| } 4176| 17.5k| } 4177| 0| else { 4178| 0| r = add_ctype_to_cc_by_range(cc, ctype, not, env, sb_out, ranges); 4179| 0| } 4180| 17.5k| return r; 4181| 17.5k| } 4182| 0| else if (r != ONIG_NO_SUPPORT_CONFIG) { ------------------ | | 626| 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; ------------------ | | 420| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 419| 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++) { ------------------ | | 420| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 419| 0|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (4201:19): [True: 0, False: 0] ------------------ 4202| 0| if (! ONIGENC_IS_CODE_CTYPE(enc, (OnigCodePoint )c, ctype)) ------------------ | | 372| 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); \ | | ------------------ | | | | 442| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (442:36): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 178| 0| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 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) | | | | ------------------ | | | | | | 362| 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) | | | | | | ------------------ | | | | | | | | 364| 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) | | | | ------------------ | | | | | | 311| 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++) { ------------------ | | 420| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 419| 0|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (4208:19): [True: 0, False: 0] ------------------ 4209| 0| if (ONIGENC_IS_CODE_CTYPE(enc, (OnigCodePoint )c, ctype)) ------------------ | | 372| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | ------------------ | | | Branch (372: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); \ | | ------------------ | | | | 442| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (442:36): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 178| 0| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 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++) { ------------------ | | 420| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 419| 0|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (4218:19): [True: 0, False: 0] ------------------ 4219| 0| if (! ONIGENC_IS_CODE_CTYPE(enc, (OnigCodePoint )c, ctype) ------------------ | | 372| 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); \ | | ------------------ | | | | 442| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (442:36): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 178| 0| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 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) | | | | ------------------ | | | | | | 362| 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) | | | | | | ------------------ | | | | | | | | 364| 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) | | | | ------------------ | | | | | | 311| 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)) ------------------ | | 372| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | ------------------ | | | Branch (372: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); \ | | ------------------ | | | | 442| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (442:36): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 178| 0| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 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) | | | | ------------------ | | | | | | 362| 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) | | | | | | ------------------ | | | | | | | | 364| 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) | | | | ------------------ | | | | | | 311| 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); ------------------ | | 401| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | ------------------ | | | | 372| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (372: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); \ | | ------------------ | | | | 442| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (442:36): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 178| 0| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 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) | | | | ------------------ | | | | | | 362| 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) | | | | | | ------------------ | | | | | | | | 364| 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) | | | | ------------------ | | | | | | 311| 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++) { ------------------ | | 420| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 419| 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 */ ------------------ | | 367| 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)) ------------------ | | 401| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_WORD) | | ------------------ | | | | 372| 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); \ | | ------------------ | | | | 442| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (442:36): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 178| 0| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 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) | | | | ------------------ | | | | | | 362| 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) | | | | | | ------------------ | | | | | | | | 364| 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) | | | | ------------------ | | | | | | 311| 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; ------------------ | | 631| 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| 17.5k|{ 4068| 17.5k| int i, r; 4069| 17.5k| OnigCodePoint j; 4070| | 4071| 17.5k| int n = ONIGENC_CODE_RANGE_NUM(mbr); ------------------ | | 139| 17.5k|#define ONIGENC_CODE_RANGE_NUM(range) ((int )range[0]) ------------------ 4072| | 4073| 17.5k| if (not == 0) { ------------------ | Branch (4073:7): [True: 17.5k, False: 0] ------------------ 4074| 47.1k| for (i = 0; i < n; i++) { ------------------ | Branch (4074:17): [True: 47.1k, False: 0] ------------------ 4075| 47.1k| for (j = ONIGENC_CODE_RANGE_FROM(mbr, i); ------------------ | | 140| 47.1k|#define ONIGENC_CODE_RANGE_FROM(range,i) range[((i)*2) + 1] ------------------ 4076| 173k| j <= ONIGENC_CODE_RANGE_TO(mbr, i); j++) { ------------------ | | 141| 173k|#define ONIGENC_CODE_RANGE_TO(range,i) range[((i)*2) + 2] ------------------ | Branch (4076:4): [True: 144k, False: 29.6k] ------------------ 4077| 144k| if (j >= sb_out) { ------------------ | Branch (4077:6): [True: 17.5k, False: 126k] ------------------ 4078| 17.5k| if (j > ONIGENC_CODE_RANGE_FROM(mbr, i)) { ------------------ | | 140| 17.5k|#define ONIGENC_CODE_RANGE_FROM(range,i) range[((i)*2) + 1] ------------------ | Branch (4078:8): [True: 0, False: 17.5k] ------------------ 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| 17.5k| goto sb_end; 4086| 17.5k| } 4087| 126k| BITSET_SET_BIT_CHKDUP(cc->bs, j); ------------------ | | 176| 126k|#define BITSET_SET_BIT_CHKDUP(bs, pos) do { \ | | 177| 126k| if (BITSET_AT(bs, pos)) CC_DUP_WARN(env, pos, pos); \ | | ------------------ | | | | 442| 126k|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 439| 126k|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 421| 126k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 126k|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 440| 126k|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 421| 126k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 126k|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (442:36): [True: 0, False: 126k] | | | | ------------------ | | ------------------ | | 178| 126k| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 439| 126k|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 126k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 126k|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 440| 126k|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 126k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 126k|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | 179| 126k|} while (0) | | ------------------ | | | Branch (179:10): [Folded - Ignored] | | ------------------ ------------------ 4088| 126k| } 4089| 47.1k| } 4090| | 4091| 17.5k| sb_end: 4092| 427k| for ( ; i < n; i++) { ------------------ | Branch (4092:13): [True: 409k, False: 17.5k] ------------------ 4093| 409k| r = add_code_range_to_buf(&(cc->mbuf), env, 4094| 409k| ONIGENC_CODE_RANGE_FROM(mbr, i), ------------------ | | 140| 409k|#define ONIGENC_CODE_RANGE_FROM(range,i) range[((i)*2) + 1] ------------------ 4095| 409k| ONIGENC_CODE_RANGE_TO(mbr, i)); ------------------ | | 141| 409k|#define ONIGENC_CODE_RANGE_TO(range,i) range[((i)*2) + 2] ------------------ 4096| 409k| if (r != 0) return r; ------------------ | Branch (4096:11): [True: 0, False: 409k] ------------------ 4097| 409k| } 4098| 17.5k| } 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); \ | | ------------------ | | | | 442| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (442:36): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 178| 0| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 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); \ | | ------------------ | | | | 442| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (442:36): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 178| 0| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 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| 17.5k| return 0; 4134| 17.5k|} regparse.c:and_cclass: 1978| 17.5k|{ 1979| 17.5k| OnigEncoding enc = env->enc; 1980| 17.5k| int r, not1, not2; 1981| 17.5k| BBuf *buf1, *buf2, *pbuf = 0; 1982| 17.5k| BitSetRef bsr1, bsr2; 1983| 17.5k| BitSet bs1, bs2; 1984| | 1985| 17.5k| not1 = IS_NCCLASS_NOT(dest); ------------------ | | 803| 17.5k|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 796| 17.5k|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 793| 17.5k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ 1986| 17.5k| bsr1 = dest->bs; 1987| 17.5k| buf1 = dest->mbuf; 1988| 17.5k| not2 = IS_NCCLASS_NOT(cc); ------------------ | | 803| 17.5k|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 796| 17.5k|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 793| 17.5k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ 1989| 17.5k| bsr2 = cc->bs; 1990| 17.5k| buf2 = cc->mbuf; 1991| | 1992| 17.5k| if (not1 != 0) { ------------------ | Branch (1992:7): [True: 0, False: 17.5k] ------------------ 1993| 0| bitset_invert_to(bsr1, bs1); 1994| 0| bsr1 = bs1; 1995| 0| } 1996| 17.5k| if (not2 != 0) { ------------------ | Branch (1996:7): [True: 0, False: 17.5k] ------------------ 1997| 0| bitset_invert_to(bsr2, bs2); 1998| 0| bsr2 = bs2; 1999| 0| } 2000| 17.5k| bitset_and(bsr1, bsr2); 2001| 17.5k| if (bsr1 != dest->bs) { ------------------ | Branch (2001:7): [True: 0, False: 17.5k] ------------------ 2002| 0| bitset_copy(dest->bs, bsr1); 2003| 0| bsr1 = dest->bs; 2004| 0| } 2005| 17.5k| if (not1 != 0) { ------------------ | Branch (2005:7): [True: 0, False: 17.5k] ------------------ 2006| 0| bitset_invert(dest->bs); 2007| 0| } 2008| | 2009| 17.5k| if (! ONIGENC_IS_SINGLEBYTE(enc)) { ------------------ | | 318| 17.5k|#define ONIGENC_IS_SINGLEBYTE(enc) (ONIGENC_MBC_MAXLEN(enc) == 1) | | ------------------ | | | | 362| 17.5k|#define ONIGENC_MBC_MAXLEN(enc) ((enc)->max_enc_len) | | ------------------ ------------------ | Branch (2009:7): [True: 17.5k, False: 0] ------------------ 2010| 17.5k| if (not1 != 0 && not2 != 0) { ------------------ | Branch (2010:9): [True: 0, False: 17.5k] | Branch (2010:22): [True: 0, False: 0] ------------------ 2011| 0| r = or_code_range_buf(enc, buf1, 0, buf2, 0, &pbuf, env); 2012| 0| } 2013| 17.5k| else { 2014| 17.5k| r = and_code_range_buf(buf1, not1, buf2, not2, &pbuf, env); 2015| 17.5k| if (r == 0 && not1 != 0) { ------------------ | Branch (2015:11): [True: 17.5k, False: 0] | Branch (2015:21): [True: 0, False: 17.5k] ------------------ 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| 17.5k| } 2022| 17.5k| if (r != 0) { ------------------ | Branch (2022:9): [True: 0, False: 17.5k] ------------------ 2023| 0| bbuf_free(pbuf); 2024| 0| return r; 2025| 0| } 2026| | 2027| 17.5k| dest->mbuf = pbuf; 2028| 17.5k| bbuf_free(buf1); 2029| 17.5k| return r; 2030| 17.5k| } 2031| 0| return 0; 2032| 17.5k|} regparse.c:bitset_and: 225| 17.5k|{ 226| 17.5k| int i; 227| 157k| for (i = 0; i < BITSET_SIZE; i++) { dest[i] &= bs[i]; } ------------------ | | 422| 157k|#define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM) | | ------------------ | | | | 420| 157k|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | | | ------------------ | | | | | | 419| 157k|#define BITS_PER_BYTE 8 | | | | ------------------ | | ------------------ | | #define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM) | | ------------------ | | | | 421| 157k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | ------------------ | | | | | | 419| 157k|#define BITS_PER_BYTE 8 | | | | ------------------ | | ------------------ ------------------ | Branch (227:15): [True: 140k, False: 17.5k] ------------------ 228| 17.5k|} regparse.c:or_code_range_buf: 1825| 17.5k|{ 1826| 17.5k| int r; 1827| 17.5k| OnigCodePoint i, n1, *data1; 1828| 17.5k| OnigCodePoint from, to; 1829| | 1830| 17.5k| *pbuf = (BBuf* )NULL; 1831| 17.5k| if (IS_NULL(bbuf1) && IS_NULL(bbuf2)) { ------------------ | | 305| 35.0k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 17.5k, False: 0] | | ------------------ ------------------ if (IS_NULL(bbuf1) && IS_NULL(bbuf2)) { ------------------ | | 305| 17.5k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 17.5k, False: 0] | | ------------------ ------------------ 1832| 17.5k| if (not1 != 0 || not2 != 0) ------------------ | Branch (1832:9): [True: 0, False: 17.5k] | Branch (1832:22): [True: 0, False: 17.5k] ------------------ 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) | | | | ------------------ | | | | | | 364| 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) | | ------------------ | | | | 311| 0|#define ONIG_LAST_CODE_POINT (~((OnigCodePoint )0)) | | ------------------ ------------------ 1834| 17.5k| return 0; 1835| 17.5k| } 1836| | 1837| 0| r = 0; 1838| 0| if (IS_NULL(bbuf2)) ------------------ | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305: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)) { ------------------ | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305: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) | | | | ------------------ | | | | | | 364| 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) | | ------------------ | | | | 311| 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); ------------------ | | 704| 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| 17.5k|{ 1922| 17.5k| int r; 1923| 17.5k| OnigCodePoint i, j, n1, n2, *data1, *data2; 1924| 17.5k| OnigCodePoint from, to, from1, to1, from2, to2; 1925| | 1926| 17.5k| *pbuf = (BBuf* )NULL; 1927| 17.5k| if (IS_NULL(bbuf1)) { ------------------ | | 305| 17.5k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 17.5k] | | ------------------ ------------------ 1928| 0| if (not1 != 0 && IS_NOT_NULL(bbuf2)) /* not1 != 0 -> not2 == 0 */ ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306: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| 17.5k| else if (IS_NULL(bbuf2)) { ------------------ | | 305| 17.5k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 17.5k, False: 0] | | ------------------ ------------------ 1933| 17.5k| if (not2 != 0) ------------------ | Branch (1933:9): [True: 0, False: 17.5k] ------------------ 1934| 0| return bbuf_clone(pbuf, bbuf1); 1935| 17.5k| return 0; 1936| 17.5k| } 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); ------------------ | | 704| 0|#define GET_CODE_POINT(code,p) code = *((OnigCodePoint* )(p)) ------------------ 1944| 0| GET_CODE_POINT(n2, data2); ------------------ | | 704| 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); ------------------ | | 303| 0|#define MAX(a,b) (((a)<(b))?(b):(a)) | | ------------------ | | | Branch (303:19): [True: 0, False: 0] | | ------------------ ------------------ 1958| 0| to = MIN(to1, to2); ------------------ | | 302| 0|#define MIN(a,b) (((a)>(b))?(b):(a)) | | ------------------ | | | Branch (302: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| 17.5k|{ 2037| 17.5k| OnigEncoding enc = env->enc; 2038| 17.5k| int r, not1, not2; 2039| 17.5k| BBuf *buf1, *buf2, *pbuf = 0; 2040| 17.5k| BitSetRef bsr1, bsr2; 2041| 17.5k| BitSet bs1, bs2; 2042| | 2043| 17.5k| not1 = IS_NCCLASS_NOT(dest); ------------------ | | 803| 17.5k|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 796| 17.5k|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 793| 17.5k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ 2044| 17.5k| bsr1 = dest->bs; 2045| 17.5k| buf1 = dest->mbuf; 2046| 17.5k| not2 = IS_NCCLASS_NOT(cc); ------------------ | | 803| 17.5k|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 796| 17.5k|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 793| 17.5k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ 2047| 17.5k| bsr2 = cc->bs; 2048| 17.5k| buf2 = cc->mbuf; 2049| | 2050| 17.5k| if (not1 != 0) { ------------------ | Branch (2050:7): [True: 0, False: 17.5k] ------------------ 2051| 0| bitset_invert_to(bsr1, bs1); 2052| 0| bsr1 = bs1; 2053| 0| } 2054| 17.5k| if (not2 != 0) { ------------------ | Branch (2054:7): [True: 0, False: 17.5k] ------------------ 2055| 0| bitset_invert_to(bsr2, bs2); 2056| 0| bsr2 = bs2; 2057| 0| } 2058| 17.5k| bitset_or(bsr1, bsr2); 2059| 17.5k| if (bsr1 != dest->bs) { ------------------ | Branch (2059:7): [True: 0, False: 17.5k] ------------------ 2060| 0| bitset_copy(dest->bs, bsr1); 2061| 0| bsr1 = dest->bs; 2062| 0| } 2063| 17.5k| if (not1 != 0) { ------------------ | Branch (2063:7): [True: 0, False: 17.5k] ------------------ 2064| 0| bitset_invert(dest->bs); 2065| 0| } 2066| | 2067| 17.5k| if (! ONIGENC_IS_SINGLEBYTE(enc)) { ------------------ | | 318| 17.5k|#define ONIGENC_IS_SINGLEBYTE(enc) (ONIGENC_MBC_MAXLEN(enc) == 1) | | ------------------ | | | | 362| 17.5k|#define ONIGENC_MBC_MAXLEN(enc) ((enc)->max_enc_len) | | ------------------ ------------------ | Branch (2067:7): [True: 17.5k, False: 0] ------------------ 2068| 17.5k| if (not1 != 0 && not2 != 0) { ------------------ | Branch (2068:9): [True: 0, False: 17.5k] | Branch (2068:22): [True: 0, False: 0] ------------------ 2069| 0| r = and_code_range_buf(buf1, 0, buf2, 0, &pbuf, env); 2070| 0| } 2071| 17.5k| else { 2072| 17.5k| r = or_code_range_buf(enc, buf1, not1, buf2, not2, &pbuf, env); 2073| 17.5k| if (r == 0 && not1 != 0) { ------------------ | Branch (2073:11): [True: 17.5k, False: 0] | Branch (2073:21): [True: 0, False: 17.5k] ------------------ 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| 17.5k| } 2080| 17.5k| if (r != 0) { ------------------ | Branch (2080:9): [True: 0, False: 17.5k] ------------------ 2081| 0| bbuf_free(pbuf); 2082| 0| return r; 2083| 0| } 2084| | 2085| 17.5k| dest->mbuf = pbuf; 2086| 17.5k| bbuf_free(buf1); 2087| 17.5k| return r; 2088| 17.5k| } 2089| 0| else 2090| 0| return 0; 2091| 17.5k|} regparse.c:bitset_or: 232| 17.5k|{ 233| 17.5k| int i; 234| 157k| for (i = 0; i < BITSET_SIZE; i++) { dest[i] |= bs[i]; } ------------------ | | 422| 157k|#define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM) | | ------------------ | | | | 420| 157k|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | | | ------------------ | | | | | | 419| 157k|#define BITS_PER_BYTE 8 | | | | ------------------ | | ------------------ | | #define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM) | | ------------------ | | | | 421| 157k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | ------------------ | | | | | | 419| 157k|#define BITS_PER_BYTE 8 | | | | ------------------ | | ------------------ ------------------ | Branch (234:15): [True: 140k, False: 17.5k] ------------------ 235| 17.5k|} regparse.c:parse_char_class: 4562| 20.2k|{ 4563| 20.2k| int r, neg, len, fetched, and_start; 4564| 20.2k| OnigCodePoint v, vs; 4565| 20.2k| UChar *p; ------------------ | | 76| 20.2k|# define UChar OnigUChar ------------------ 4566| 20.2k| Node* node; 4567| 20.2k| Node* asc_node; 4568| 20.2k| CClassNode *cc, *prev_cc; 4569| 20.2k| CClassNode *asc_cc, *asc_prev_cc; 4570| 20.2k| CClassNode work_cc, asc_work_cc; 4571| | 4572| 20.2k| enum CCSTATE state; 4573| 20.2k| enum CCVALTYPE val_type, in_type; 4574| 20.2k| int val_israw, in_israw; 4575| | 4576| 20.2k| *np = *asc_np = NULL_NODE; ------------------ | | 283| 20.2k|#define NULL_NODE ((Node* )0) ------------------ 4577| 20.2k| env->parse_depth++; 4578| 20.2k| if (env->parse_depth > ParseDepthLimit) ------------------ | Branch (4578:7): [True: 0, False: 20.2k] ------------------ 4579| 0| return ONIGERR_PARSE_DEPTH_LIMIT_OVER; ------------------ | | 636| 0|#define ONIGERR_PARSE_DEPTH_LIMIT_OVER -16 ------------------ 4580| 20.2k| prev_cc = asc_prev_cc = (CClassNode* )NULL; 4581| 20.2k| r = fetch_token_in_cc(tok, src, end, env); 4582| 20.2k| if (r == TK_CHAR && tok->u.c == '^' && tok->escaped == 0) { ------------------ | Branch (4582:7): [True: 9.43k, False: 10.7k] | Branch (4582:23): [True: 8.08k, False: 1.34k] | Branch (4582:42): [True: 8.08k, False: 0] ------------------ 4583| 8.08k| neg = 1; 4584| 8.08k| r = fetch_token_in_cc(tok, src, end, env); 4585| 8.08k| } 4586| 12.1k| else { 4587| 12.1k| neg = 0; 4588| 12.1k| } 4589| | 4590| 20.2k| if (r < 0) return r; ------------------ | Branch (4590:7): [True: 0, False: 20.2k] ------------------ 4591| 20.2k| if (r == TK_CC_CLOSE) { ------------------ | Branch (4591:7): [True: 0, False: 20.2k] ------------------ 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; ------------------ | | 644| 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| 20.2k| *np = node = node_new_cclass(); 4601| 20.2k| CHECK_NULL_RETURN_MEMERR(node); ------------------ | | 308| 20.2k|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 20.2k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 20.2k] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 4602| 20.2k| cc = NCCLASS(node); ------------------ | | 77| 20.2k|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 4603| | 4604| 20.2k| if (IS_IGNORECASE(env->option)) { ------------------ | | 390| 20.2k|#define IS_IGNORECASE(option) ((option) & ONIG_OPTION_IGNORECASE) | | ------------------ | | | | 451| 20.2k|#define ONIG_OPTION_IGNORECASE 1U | | ------------------ | | | Branch (390:35): [True: 0, False: 20.2k] | | ------------------ ------------------ 4605| 0| *asc_np = asc_node = node_new_cclass(); 4606| 0| CHECK_NULL_RETURN_MEMERR(asc_node); ------------------ | | 308| 0|#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | #define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY | | ------------------ | | | | 629| 0|#define ONIGERR_MEMORY -5 | | ------------------ ------------------ 4607| 0| asc_cc = NCCLASS(asc_node); ------------------ | | 77| 0|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 4608| 0| } 4609| 20.2k| else { 4610| 20.2k| asc_node = NULL_NODE; ------------------ | | 283| 20.2k|#define NULL_NODE ((Node* )0) ------------------ 4611| 20.2k| asc_cc = NULL; 4612| 20.2k| } 4613| | 4614| 20.2k| and_start = 0; 4615| 20.2k| state = CCS_START; 4616| 20.2k| p = *src; 4617| 74.1k| while (r != TK_CC_CLOSE) { ------------------ | Branch (4617:10): [True: 53.9k, False: 20.2k] ------------------ 4618| 53.9k| fetched = 0; 4619| 53.9k| switch (r) { 4620| 32.3k| case TK_CHAR: ------------------ | Branch (4620:5): [True: 32.3k, False: 21.5k] ------------------ 4621| 32.3k| if ((tok->u.code >= SINGLE_BYTE_SIZE) || ------------------ | | 420| 32.3k|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 419| 32.3k|#define BITS_PER_BYTE 8 | | ------------------ ------------------ | Branch (4621:11): [True: 0, False: 32.3k] ------------------ 4622| 32.3k| (len = ONIGENC_CODE_TO_MBCLEN(env->enc, tok->u.c)) > 1) { ------------------ | | 367| 32.3k|#define ONIGENC_CODE_TO_MBCLEN(enc,code) (enc)->code_to_mbclen(code,enc) ------------------ | Branch (4622:4): [True: 0, False: 32.3k] ------------------ 4623| 0| in_type = CCV_CODE_POINT; 4624| 0| } 4625| 32.3k| else if (len < 0) { ------------------ | Branch (4625:16): [True: 0, False: 32.3k] ------------------ 4626| 0| r = len; 4627| 0| goto err; 4628| 0| } 4629| 32.3k| else { 4630| 32.3k| sb_char: 4631| 32.3k| in_type = CCV_SB; 4632| 32.3k| } 4633| 32.3k| v = (OnigCodePoint )tok->u.c; 4634| 32.3k| in_israw = 0; 4635| 32.3k| goto val_entry2; 4636| 0| break; 4637| | 4638| 0| case TK_RAW_BYTE: ------------------ | Branch (4638:5): [True: 0, False: 53.9k] ------------------ 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) | | ------------------ | | | | 362| 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++) { ------------------ | | 362| 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)) { ------------------ | | 364| 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; ------------------ | | 672| 0|#define ONIGERR_TOO_SHORT_MULTI_BYTE_STRING -206 ------------------ 4659| 0| goto err; 4660| 0| } 4661| | 4662| 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)) | | ------------------ | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | ------------------ | | | Branch (93:26): [True: 0, False: 0] | | ------------------ ------------------ 4663| 0| if (i < len) { ------------------ | Branch (4663:6): [True: 0, False: 0] ------------------ 4664| 0| r = ONIGERR_TOO_SHORT_MULTI_BYTE_STRING; ------------------ | | 672| 0|#define ONIGERR_TOO_SHORT_MULTI_BYTE_STRING -206 ------------------ 4665| 0| goto err; 4666| 0| } 4667| 0| else if (i > len) { /* fetch back */ ------------------ | Branch (4667:11): [True: 0, False: 0] ------------------ 4668| 0| p = psave; 4669| 0| for (i = 1; i < len; i++) { ------------------ | Branch (4669:16): [True: 0, False: 0] ------------------ 4670| 0| (void)fetch_token_in_cc(tok, &p, end, env); 4671| | /* no need to check the retun value (already checked above) */ 4672| 0| } 4673| 0| fetched = 0; 4674| 0| } 4675| | 4676| 0| if (i == 1) { ------------------ | Branch (4676:6): [True: 0, False: 0] ------------------ 4677| 0| v = (OnigCodePoint )buf[0]; 4678| 0| goto raw_single; 4679| 0| } 4680| 0| else { 4681| 0| v = ONIGENC_MBC_TO_CODE(env->enc, buf, bufe); ------------------ | | 366| 0|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) ------------------ 4682| 0| in_type = CCV_CODE_POINT; 4683| 0| } 4684| 0| } 4685| 0| else { 4686| 0| v = (OnigCodePoint )tok->u.c; 4687| 0| raw_single: 4688| 0| in_type = CCV_SB; 4689| 0| } 4690| 0| in_israw = 1; 4691| 0| goto val_entry2; 4692| 0| break; 4693| | 4694| 16.1k| case TK_CODE_POINT: ------------------ | Branch (4694:5): [True: 16.1k, False: 37.7k] ------------------ 4695| 16.1k| v = tok->u.code; 4696| 16.1k| in_israw = 1; 4697| 16.1k| val_entry: 4698| 16.1k| len = ONIGENC_CODE_TO_MBCLEN(env->enc, v); ------------------ | | 367| 16.1k|#define ONIGENC_CODE_TO_MBCLEN(enc,code) (enc)->code_to_mbclen(code,enc) ------------------ 4699| 16.1k| if (len < 0) { ------------------ | Branch (4699:11): [True: 0, False: 16.1k] ------------------ 4700| 0| r = len; 4701| 0| goto err; 4702| 0| } 4703| 16.1k| in_type = (len == 1 ? CCV_SB : CCV_CODE_POINT); ------------------ | Branch (4703:18): [True: 16.1k, False: 0] ------------------ 4704| 48.5k| val_entry2: 4705| 48.5k| r = next_state_val(cc, asc_cc, &vs, v, &val_israw, in_israw, in_type, &val_type, 4706| 48.5k| &state, env); 4707| 48.5k| if (r != 0) goto err; ------------------ | Branch (4707:11): [True: 0, False: 48.5k] ------------------ 4708| 48.5k| break; 4709| | 4710| 48.5k| case TK_POSIX_BRACKET_OPEN: ------------------ | Branch (4710:5): [True: 0, False: 53.9k] ------------------ 4711| 0| r = parse_posix_bracket(cc, asc_cc, &p, end, env); 4712| 0| if (r < 0) goto err; ------------------ | Branch (4712:11): [True: 0, False: 0] ------------------ 4713| 0| if (r == 1) { /* is not POSIX bracket */ ------------------ | Branch (4713:11): [True: 0, False: 0] ------------------ 4714| 0| CC_ESC_WARN(env, (UChar* )"["); 4715| 0| p = tok->backp; 4716| 0| v = (OnigCodePoint )tok->u.c; 4717| 0| in_israw = 0; 4718| 0| goto val_entry; 4719| 0| } 4720| 0| goto next_class; 4721| 0| break; 4722| | 4723| 5.39k| case TK_CHAR_TYPE: ------------------ | Branch (4723:5): [True: 5.39k, False: 48.5k] ------------------ 4724| 5.39k| r = add_ctype_to_cc(cc, tok->u.prop.ctype, tok->u.prop.not, 4725| 5.39k| IS_ASCII_RANGE(env->option), env); ------------------ | | 400| 5.39k|#define IS_ASCII_RANGE(option) ((option) & ONIG_OPTION_ASCII_RANGE) | | ------------------ | | | | 467| 5.39k|#define ONIG_OPTION_ASCII_RANGE (ONIG_OPTION_NOTEOS << 1) | | | | ------------------ | | | | | | 465| 5.39k|#define ONIG_OPTION_NOTEOS (ONIG_OPTION_NOTBOS << 1) | | | | | | ------------------ | | | | | | | | 464| 5.39k|#define ONIG_OPTION_NOTBOS (ONIG_OPTION_NOTEOL << 1) | | | | | | | | ------------------ | | | | | | | | | | 463| 5.39k|#define ONIG_OPTION_NOTEOL (ONIG_OPTION_NOTBOL << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 462| 5.39k|#define ONIG_OPTION_NOTBOL (ONIG_OPTION_CAPTURE_GROUP << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 460| 5.39k|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 459| 5.39k|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 458| 5.39k|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | 457| 5.39k|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | 456| 5.39k|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | 455| 5.39k|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | 453| 5.39k|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 452| 5.39k|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 451| 5.39k|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 4726| 5.39k| if (r != 0) return r; ------------------ | Branch (4726:11): [True: 0, False: 5.39k] ------------------ 4727| 5.39k| if (IS_NOT_NULL(asc_cc)) { ------------------ | | 306| 5.39k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 5.39k] | | ------------------ ------------------ 4728| 0| if (tok->u.prop.ctype != ONIGENC_CTYPE_WORD) ------------------ | | 306| 0|#define ONIGENC_CTYPE_WORD 12 ------------------ | Branch (4728:6): [True: 0, False: 0] ------------------ 4729| 0| r = add_ctype_to_cc(asc_cc, tok->u.prop.ctype, tok->u.prop.not, 4730| 0| IS_ASCII_RANGE(env->option), env); ------------------ | | 400| 0|#define IS_ASCII_RANGE(option) ((option) & ONIG_OPTION_ASCII_RANGE) | | ------------------ | | | | 467| 0|#define ONIG_OPTION_ASCII_RANGE (ONIG_OPTION_NOTEOS << 1) | | | | ------------------ | | | | | | 465| 0|#define ONIG_OPTION_NOTEOS (ONIG_OPTION_NOTBOS << 1) | | | | | | ------------------ | | | | | | | | 464| 0|#define ONIG_OPTION_NOTBOS (ONIG_OPTION_NOTEOL << 1) | | | | | | | | ------------------ | | | | | | | | | | 463| 0|#define ONIG_OPTION_NOTEOL (ONIG_OPTION_NOTBOL << 1) | | | | | | | | | | ------------------ | | | | | | | | | | | | 462| 0|#define ONIG_OPTION_NOTBOL (ONIG_OPTION_CAPTURE_GROUP << 1) | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | 460| 0|#define ONIG_OPTION_CAPTURE_GROUP (ONIG_OPTION_DONT_CAPTURE_GROUP << 1) | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | 459| 0|#define ONIG_OPTION_DONT_CAPTURE_GROUP (ONIG_OPTION_NEGATE_SINGLELINE << 1) | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | 458| 0|#define ONIG_OPTION_NEGATE_SINGLELINE (ONIG_OPTION_FIND_NOT_EMPTY << 1) | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | 457| 0|#define ONIG_OPTION_FIND_NOT_EMPTY (ONIG_OPTION_FIND_LONGEST << 1) | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | 456| 0|#define ONIG_OPTION_FIND_LONGEST (ONIG_OPTION_SINGLELINE << 1) | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | 455| 0|#define ONIG_OPTION_SINGLELINE (ONIG_OPTION_MULTILINE << 1) | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | 453| 0|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 452| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 451| 0|#define ONIG_OPTION_IGNORECASE 1U | | | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | | | ------------------ | | | | | | | | | | | | ------------------ | | | | | | | | | | ------------------ | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 4731| 0| if (r != 0) return r; ------------------ | Branch (4731:6): [True: 0, False: 0] ------------------ 4732| 0| } 4733| | 4734| 5.39k| next_class: 4735| 5.39k| r = next_state_class(cc, asc_cc, &vs, &val_type, &state, env); 4736| 5.39k| if (r != 0) goto err; ------------------ | Branch (4736:11): [True: 0, False: 5.39k] ------------------ 4737| 5.39k| break; 4738| | 4739| 5.39k| case TK_CHAR_PROPERTY: ------------------ | Branch (4739:5): [True: 0, False: 53.9k] ------------------ 4740| 0| { 4741| 0| int ctype; 4742| | 4743| 0| ctype = fetch_char_property_to_ctype(&p, end, env); 4744| 0| if (ctype < 0) return ctype; ------------------ | Branch (4744:6): [True: 0, False: 0] ------------------ 4745| 0| r = add_ctype_to_cc(cc, ctype, tok->u.prop.not, 0, env); 4746| 0| if (r != 0) return r; ------------------ | Branch (4746:6): [True: 0, False: 0] ------------------ 4747| 0| if (IS_NOT_NULL(asc_cc)) { ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 0] | | ------------------ ------------------ 4748| 0| if (ctype != ONIGENC_CTYPE_ASCII) ------------------ | | 308| 0|#define ONIGENC_CTYPE_ASCII 14 ------------------ | Branch (4748:8): [True: 0, False: 0] ------------------ 4749| 0| r = add_ctype_to_cc(asc_cc, ctype, tok->u.prop.not, 0, env); 4750| 0| if (r != 0) return r; ------------------ | Branch (4750:8): [True: 0, False: 0] ------------------ 4751| 0| } 4752| 0| goto next_class; 4753| 0| } 4754| 0| break; 4755| | 4756| 0| case TK_CC_RANGE: ------------------ | Branch (4756:5): [True: 0, False: 53.9k] ------------------ 4757| 0| if (state == CCS_VALUE) { ------------------ | Branch (4757:11): [True: 0, False: 0] ------------------ 4758| 0| r = fetch_token_in_cc(tok, &p, end, env); 4759| 0| if (r < 0) goto err; ------------------ | Branch (4759:6): [True: 0, False: 0] ------------------ 4760| 0| fetched = 1; 4761| 0| if (r == TK_CC_CLOSE) { /* allow [x-] */ ------------------ | Branch (4761:6): [True: 0, False: 0] ------------------ 4762| 0| range_end_val: 4763| 0| v = (OnigCodePoint )'-'; 4764| 0| in_israw = 0; 4765| 0| goto val_entry; 4766| 0| } 4767| 0| else if (r == TK_CC_AND) { ------------------ | Branch (4767:11): [True: 0, False: 0] ------------------ 4768| 0| CC_ESC_WARN(env, (UChar* )"-"); 4769| 0| goto range_end_val; 4770| 0| } 4771| | 4772| 0| if (val_type == CCV_CLASS) { ------------------ | Branch (4772:6): [True: 0, False: 0] ------------------ 4773| 0| r = ONIGERR_UNMATCHED_RANGE_SPECIFIER_IN_CHAR_CLASS; ------------------ | | 653| 0|#define ONIGERR_UNMATCHED_RANGE_SPECIFIER_IN_CHAR_CLASS -112 ------------------ 4774| 0| goto err; 4775| 0| } 4776| | 4777| 0| state = CCS_RANGE; 4778| 0| } 4779| 0| else if (state == CCS_START) { ------------------ | Branch (4779:16): [True: 0, False: 0] ------------------ 4780| | /* [-xa] is allowed */ 4781| 0| v = (OnigCodePoint )tok->u.c; 4782| 0| in_israw = 0; 4783| | 4784| 0| r = fetch_token_in_cc(tok, &p, end, env); 4785| 0| if (r < 0) goto err; ------------------ | Branch (4785:6): [True: 0, False: 0] ------------------ 4786| 0| fetched = 1; 4787| | /* [--x] or [a&&-x] is warned. */ 4788| 0| if (r == TK_CC_RANGE || and_start != 0) ------------------ | Branch (4788:6): [True: 0, False: 0] | Branch (4788:26): [True: 0, False: 0] ------------------ 4789| 0| CC_ESC_WARN(env, (UChar* )"-"); 4790| | 4791| 0| goto val_entry; 4792| 0| } 4793| 0| else if (state == CCS_RANGE) { ------------------ | Branch (4793:16): [True: 0, False: 0] ------------------ 4794| 0| CC_ESC_WARN(env, (UChar* )"-"); 4795| 0| goto sb_char; /* [!--x] is allowed */ 4796| 0| } 4797| 0| else { /* CCS_COMPLETE */ 4798| 0| r = fetch_token_in_cc(tok, &p, end, env); 4799| 0| if (r < 0) goto err; ------------------ | Branch (4799:6): [True: 0, False: 0] ------------------ 4800| 0| fetched = 1; 4801| 0| if (r == TK_CC_CLOSE) goto range_end_val; /* allow [a-b-] */ ------------------ | Branch (4801:6): [True: 0, False: 0] ------------------ 4802| 0| else if (r == TK_CC_AND) { ------------------ | Branch (4802:11): [True: 0, False: 0] ------------------ 4803| 0| CC_ESC_WARN(env, (UChar* )"-"); 4804| 0| goto range_end_val; 4805| 0| } 4806| | 4807| 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] | | ------------------ ------------------ 4808| 0| CC_ESC_WARN(env, (UChar* )"-"); 4809| 0| goto range_end_val; /* [0-9-a] is allowed as [0-9\-a] */ 4810| 0| } 4811| 0| r = ONIGERR_UNMATCHED_RANGE_SPECIFIER_IN_CHAR_CLASS; ------------------ | | 653| 0|#define ONIGERR_UNMATCHED_RANGE_SPECIFIER_IN_CHAR_CLASS -112 ------------------ 4812| 0| goto err; 4813| 0| } 4814| 0| break; 4815| | 4816| 0| case TK_CC_CC_OPEN: /* [ */ ------------------ | Branch (4816:5): [True: 0, False: 53.9k] ------------------ 4817| 0| { 4818| 0| Node *anode, *aasc_node; 4819| 0| CClassNode* acc; 4820| | 4821| 0| r = parse_char_class(&anode, &aasc_node, tok, &p, end, env); 4822| 0| if (r == 0) { ------------------ | Branch (4822:6): [True: 0, False: 0] ------------------ 4823| 0| acc = NCCLASS(anode); ------------------ | | 77| 0|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 4824| 0| r = or_cclass(cc, acc, env); 4825| 0| } 4826| 0| if (r == 0 && IS_NOT_NULL(aasc_node)) { ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 0] | | ------------------ ------------------ | Branch (4826:6): [True: 0, False: 0] ------------------ 4827| 0| acc = NCCLASS(aasc_node); ------------------ | | 77| 0|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ 4828| 0| r = or_cclass(asc_cc, acc, env); 4829| 0| } 4830| 0| onig_node_free(anode); 4831| 0| onig_node_free(aasc_node); 4832| 0| if (r != 0) goto err; ------------------ | Branch (4832:6): [True: 0, False: 0] ------------------ 4833| 0| } 4834| 0| break; 4835| | 4836| 0| case TK_CC_AND: /* && */ ------------------ | Branch (4836:5): [True: 0, False: 53.9k] ------------------ 4837| 0| { 4838| 0| if (state == CCS_VALUE) { ------------------ | Branch (4838:6): [True: 0, False: 0] ------------------ 4839| 0| r = next_state_val(cc, asc_cc, &vs, 0, &val_israw, 0, val_type, 4840| 0| &val_type, &state, env); 4841| 0| if (r != 0) goto err; ------------------ | Branch (4841:8): [True: 0, False: 0] ------------------ 4842| 0| } 4843| | /* initialize local variables */ 4844| 0| and_start = 1; 4845| 0| state = CCS_START; 4846| | 4847| 0| if (IS_NOT_NULL(prev_cc)) { ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 0] | | ------------------ ------------------ 4848| 0| r = and_cclass(prev_cc, cc, env); 4849| 0| if (r != 0) goto err; ------------------ | Branch (4849:8): [True: 0, False: 0] ------------------ 4850| 0| bbuf_free(cc->mbuf); 4851| 0| if (IS_NOT_NULL(asc_cc)) { ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 0] | | ------------------ ------------------ 4852| 0| r = and_cclass(asc_prev_cc, asc_cc, env); 4853| 0| if (r != 0) goto err; ------------------ | Branch (4853:10): [True: 0, False: 0] ------------------ 4854| 0| bbuf_free(asc_cc->mbuf); 4855| 0| } 4856| 0| } 4857| 0| else { 4858| 0| prev_cc = cc; 4859| 0| cc = &work_cc; 4860| 0| if (IS_NOT_NULL(asc_cc)) { ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 0] | | ------------------ ------------------ 4861| 0| asc_prev_cc = asc_cc; 4862| 0| asc_cc = &asc_work_cc; 4863| 0| } 4864| 0| } 4865| 0| initialize_cclass(cc); 4866| 0| if (IS_NOT_NULL(asc_cc)) ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 0] | | ------------------ ------------------ 4867| 0| initialize_cclass(asc_cc); 4868| 0| } 4869| 0| break; 4870| | 4871| 0| case TK_EOT: ------------------ | Branch (4871:5): [True: 0, False: 53.9k] ------------------ 4872| 0| r = ONIGERR_PREMATURE_END_OF_CHAR_CLASS; ------------------ | | 645| 0|#define ONIGERR_PREMATURE_END_OF_CHAR_CLASS -103 ------------------ 4873| 0| goto err; 4874| 0| break; 4875| 0| default: ------------------ | Branch (4875:5): [True: 0, False: 53.9k] ------------------ 4876| 0| r = ONIGERR_PARSER_BUG; ------------------ | | 631| 0|#define ONIGERR_PARSER_BUG -11 ------------------ 4877| 0| goto err; 4878| 0| break; 4879| 53.9k| } 4880| | 4881| 53.9k| if (fetched) ------------------ | Branch (4881:9): [True: 0, False: 53.9k] ------------------ 4882| 0| r = tok->type; 4883| 53.9k| else { 4884| 53.9k| r = fetch_token_in_cc(tok, &p, end, env); 4885| 53.9k| if (r < 0) goto err; ------------------ | Branch (4885:11): [True: 0, False: 53.9k] ------------------ 4886| 53.9k| } 4887| 53.9k| } 4888| | 4889| 20.2k| if (state == CCS_VALUE) { ------------------ | Branch (4889:7): [True: 20.2k, False: 0] ------------------ 4890| 20.2k| r = next_state_val(cc, asc_cc, &vs, 0, &val_israw, 0, val_type, 4891| 20.2k| &val_type, &state, env); 4892| 20.2k| if (r != 0) goto err; ------------------ | Branch (4892:9): [True: 0, False: 20.2k] ------------------ 4893| 20.2k| } 4894| | 4895| 20.2k| if (IS_NOT_NULL(prev_cc)) { ------------------ | | 306| 20.2k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 20.2k] | | ------------------ ------------------ 4896| 0| r = and_cclass(prev_cc, cc, env); 4897| 0| if (r != 0) goto err; ------------------ | Branch (4897:9): [True: 0, False: 0] ------------------ 4898| 0| bbuf_free(cc->mbuf); 4899| 0| cc = prev_cc; 4900| 0| if (IS_NOT_NULL(asc_cc)) { ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 0] | | ------------------ ------------------ 4901| 0| r = and_cclass(asc_prev_cc, asc_cc, env); 4902| 0| if (r != 0) goto err; ------------------ | Branch (4902:11): [True: 0, False: 0] ------------------ 4903| 0| bbuf_free(asc_cc->mbuf); 4904| 0| asc_cc = asc_prev_cc; 4905| 0| } 4906| 0| } 4907| | 4908| 20.2k| if (neg != 0) { ------------------ | Branch (4908:7): [True: 8.08k, False: 12.1k] ------------------ 4909| 8.08k| NCCLASS_SET_NOT(cc); ------------------ | | 801| 8.08k|#define NCCLASS_SET_NOT(nd) NCCLASS_FLAG_SET(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 794| 8.08k|#define NCCLASS_FLAG_SET(cc,flag) (NCCLASS_FLAGS(cc) |= (flag)) | | | | ------------------ | | | | | | 793| 8.08k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ 4910| 8.08k| if (IS_NOT_NULL(asc_cc)) ------------------ | | 306| 8.08k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 8.08k] | | ------------------ ------------------ 4911| 8.08k| NCCLASS_SET_NOT(asc_cc); ------------------ | | 801| 0|#define NCCLASS_SET_NOT(nd) NCCLASS_FLAG_SET(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 794| 0|#define NCCLASS_FLAG_SET(cc,flag) (NCCLASS_FLAGS(cc) |= (flag)) | | | | ------------------ | | | | | | 793| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ 4912| 8.08k| } 4913| 12.1k| else { 4914| 12.1k| NCCLASS_CLEAR_NOT(cc); ------------------ | | 802| 12.1k|#define NCCLASS_CLEAR_NOT(nd) NCCLASS_FLAG_CLEAR(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 795| 12.1k|#define NCCLASS_FLAG_CLEAR(cc,flag) (NCCLASS_FLAGS(cc) &= ~(flag)) | | | | ------------------ | | | | | | 793| 12.1k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ 4915| 12.1k| if (IS_NOT_NULL(asc_cc)) ------------------ | | 306| 12.1k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 12.1k] | | ------------------ ------------------ 4916| 12.1k| NCCLASS_CLEAR_NOT(asc_cc); ------------------ | | 802| 0|#define NCCLASS_CLEAR_NOT(nd) NCCLASS_FLAG_CLEAR(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 795| 0|#define NCCLASS_FLAG_CLEAR(cc,flag) (NCCLASS_FLAGS(cc) &= ~(flag)) | | | | ------------------ | | | | | | 793| 0|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | ------------------ ------------------ 4917| 12.1k| } 4918| 20.2k| if (IS_NCCLASS_NOT(cc) && ------------------ | | 803| 20.2k|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 796| 40.4k|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 793| 20.2k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | | | | Branch (796:37): [True: 8.08k, False: 12.1k] | | | | ------------------ | | ------------------ ------------------ 4919| 20.2k| IS_SYNTAX_BV(env->syntax, ONIG_SYN_NOT_NEWLINE_IN_NEGATIVE_CC)) { ------------------ | | 332| 8.08k|#define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0) | | ------------------ | | | Branch (332:35): [True: 0, False: 8.08k] | | ------------------ ------------------ 4920| 0| int is_empty; 4921| | 4922| 0| is_empty = (IS_NULL(cc->mbuf) ? 1 : 0); ------------------ | | 305| 0|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | ------------------ | | | Branch (305:39): [True: 0, False: 0] | | ------------------ ------------------ 4923| 0| if (is_empty != 0) ------------------ | Branch (4923:9): [True: 0, False: 0] ------------------ 4924| 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++) {\ | | ------------------ | | | | 422| 0|#define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM) | | | | ------------------ | | | | | | 420| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM) | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 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] | | ------------------ ------------------ 4925| | 4926| 0| if (is_empty == 0) { ------------------ | Branch (4926:9): [True: 0, False: 0] ------------------ 4927| 0|#define NEWLINE_CODE 0x0a 4928| | 4929| 0| if (ONIGENC_IS_CODE_NEWLINE(env->enc, NEWLINE_CODE)) { ------------------ | | 375| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_NEWLINE) | | ------------------ | | | | 372| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (372:48): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 4930| 0| if (ONIGENC_CODE_TO_MBCLEN(env->enc, NEWLINE_CODE) == 1) ------------------ | | 367| 0|#define ONIGENC_CODE_TO_MBCLEN(enc,code) (enc)->code_to_mbclen(code,enc) ------------------ | Branch (4930:6): [True: 0, False: 0] ------------------ 4931| 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); \ | | ------------------ | | | | 442| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (442:36): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 178| 0| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | 179| 0|} while (0) | | ------------------ | | | Branch (179:10): [Folded - Ignored] | | ------------------ ------------------ 4932| 0| else { 4933| 0| r = add_code_range(&(cc->mbuf), env, NEWLINE_CODE, NEWLINE_CODE); ------------------ | | 4927| 0|#define NEWLINE_CODE 0x0a ------------------ r = add_code_range(&(cc->mbuf), env, NEWLINE_CODE, NEWLINE_CODE); ------------------ | | 4927| 0|#define NEWLINE_CODE 0x0a ------------------ 4934| 0| if (r < 0) goto err; ------------------ | Branch (4934:8): [True: 0, False: 0] ------------------ 4935| 0| } 4936| 0| } 4937| 0| } 4938| 0| } 4939| 20.2k| *src = p; 4940| 20.2k| env->parse_depth--; 4941| 20.2k| return 0; 4942| | 4943| 0| err: 4944| 0| if (cc != NCCLASS(*np)) ------------------ | | 77| 0|#define NCCLASS(node) (&((node)->u.cclass)) ------------------ | Branch (4944:7): [True: 0, False: 0] ------------------ 4945| 0| bbuf_free(cc->mbuf); 4946| 0| if (IS_NOT_NULL(asc_cc) && (asc_cc != NCCLASS(*asc_np))) ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306: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 (4946:30): [True: 0, False: 0] ------------------ 4947| 0| bbuf_free(asc_cc->mbuf); 4948| 0| return r; 4949| 20.2k|} regparse.c:fetch_token_in_cc: 2980| 82.2k|{ 2981| 82.2k| int num; 2982| 82.2k| OnigCodePoint c, c2; 2983| 82.2k| const OnigSyntaxType* syn = env->syntax; 2984| 82.2k| OnigEncoding enc = env->enc; 2985| 82.2k| UChar* prev; ------------------ | | 76| 82.2k|# define UChar OnigUChar ------------------ 2986| 82.2k| UChar* p = *src; ------------------ | | 76| 82.2k|# define UChar OnigUChar ------------------ 2987| 82.2k| PFETCH_READY; ------------------ | | 295| 82.2k|# define PFETCH_READY UChar* pfetch_prev = NULL; (void)pfetch_prev | | ------------------ | | | | 76| 82.2k|# define UChar OnigUChar | | ------------------ ------------------ 2988| | 2989| 82.2k| if (PEND) { ------------------ | | 299| 82.2k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 82.2k] | | | Branch (299:23): [True: 82.2k, False: 0] | | ------------------ ------------------ 2990| 0| tok->type = TK_EOT; 2991| 0| return tok->type; 2992| 0| } 2993| | 2994| 82.2k| PFETCH(c); ------------------ | | 305| 82.2k|#define PFETCH(c) do { \ | | 306| 82.2k| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 366| 82.2k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 82.2k] | | ------------------ | | 307| 82.2k| pfetch_prev = p; \ | | 308| 82.2k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 82.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)) | | | | ------------------ | | | | | | 361| 82.2k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 82.2k] | | | | ------------------ | | ------------------ | | 309| 82.2k|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 2995| 82.2k| tok->type = TK_CHAR; 2996| 82.2k| tok->base = 0; 2997| 82.2k| tok->u.c = c; 2998| 82.2k| tok->escaped = 0; 2999| | 3000| 82.2k| if (c == ']') { ------------------ | Branch (3000:7): [True: 20.2k, False: 62.0k] ------------------ 3001| 20.2k| tok->type = TK_CC_CLOSE; 3002| 20.2k| } 3003| 62.0k| else if (c == '-') { ------------------ | Branch (3003:12): [True: 0, False: 62.0k] ------------------ 3004| 0| tok->type = TK_CC_RANGE; 3005| 0| } 3006| 62.0k| else if (c == MC_ESC(syn)) { ------------------ | | 755| 62.0k|#define MC_ESC(syn) (syn)->meta_char_table.esc ------------------ | Branch (3006:12): [True: 22.9k, False: 39.0k] ------------------ 3007| 22.9k| if (! IS_SYNTAX_BV(syn, ONIG_SYN_BACKSLASH_ESCAPE_IN_CC)) ------------------ | | 332| 22.9k|#define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0) ------------------ | Branch (3007:9): [True: 0, False: 22.9k] ------------------ 3008| 0| goto end; 3009| | 3010| 22.9k| if (PEND) return ONIGERR_END_PATTERN_AT_ESCAPE; ------------------ | | 299| 22.9k|#define PEND (p < end ? 0 : 1) | | ------------------ | | | Branch (299:22): [True: 0, False: 22.9k] | | | Branch (299:23): [True: 22.9k, False: 0] | | ------------------ ------------------ if (PEND) return ONIGERR_END_PATTERN_AT_ESCAPE; ------------------ | | 646| 0|#define ONIGERR_END_PATTERN_AT_ESCAPE -104 ------------------ 3011| | 3012| 22.9k| PFETCH(c); ------------------ | | 305| 22.9k|#define PFETCH(c) do { \ | | 306| 22.9k| c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \ | | ------------------ | | | | 366| 22.9k|#define ONIGENC_MBC_TO_CODE(enc,p,end) (enc)->mbc_to_code((p),(end),enc) | | ------------------ | | | Branch (306:8): [True: 0, False: 22.9k] | | ------------------ | | 307| 22.9k| pfetch_prev = p; \ | | 308| 22.9k| p += enclen(enc, p, end); \ | | ------------------ | | | | 93| 22.9k|#define enclen(enc,p,e) ((enc->max_enc_len == enc->min_enc_len) ? enc->min_enc_len : ONIGENC_MBC_ENC_LEN(enc,p,e)) | | | | ------------------ | | | | | | 361| 22.9k|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(p,e,enc) | | | | ------------------ | | | | | Branch (93:26): [True: 0, False: 22.9k] | | | | ------------------ | | ------------------ | | 309| 22.9k|} while (0) | | ------------------ | | | Branch (309:10): [Folded - Ignored] | | ------------------ ------------------ 3013| 22.9k| tok->escaped = 1; 3014| 22.9k| tok->u.c = c; 3015| 22.9k| switch (c) { 3016| 0| case 'w': ------------------ | Branch (3016:5): [True: 0, False: 22.9k] ------------------ 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: 22.9k] ------------------ 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: 22.9k] ------------------ 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: 22.9k] ------------------ 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| 5.39k| case 's': ------------------ | Branch (3036:5): [True: 5.39k, False: 17.5k] ------------------ 3037| 5.39k| tok->type = TK_CHAR_TYPE; 3038| 5.39k| tok->u.prop.ctype = ONIGENC_CTYPE_SPACE; ------------------ | | 303| 5.39k|#define ONIGENC_CTYPE_SPACE 9 ------------------ 3039| 5.39k| tok->u.prop.not = 0; 3040| 5.39k| break; 3041| 0| case 'S': ------------------ | Branch (3041:5): [True: 0, False: 22.9k] ------------------ 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: 22.9k] ------------------ 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: 22.9k] ------------------ 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: 22.9k] ------------------ 3060| 0| case 'P': ------------------ | Branch (3060:5): [True: 0, False: 22.9k] ------------------ 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) | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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)); \ | | ------------------ | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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: 22.9k] ------------------ 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) | | | | ------------------ | | | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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; ------------------ | | 691| 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) | | ------------------ | | | | 366| 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)) ------------------ | | 399| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_XDIGIT) | | ------------------ | | | | 372| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (372:48): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ 3095| 0| return ONIGERR_TOO_LONG_WIDE_CHAR_VALUE; ------------------ | | 678| 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)) | | ------------------ | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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) | | | | ------------------ | | | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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; ------------------ | | 666| 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: 22.9k] ------------------ 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; ------------------ | | 677| 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; ------------------ | | 666| 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: 22.9k] ------------------ 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) | | | | ------------------ | | | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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; ------------------ | | 691| 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) | | ------------------ | | | | 366| 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') ------------------ | | 397| 0| ONIGENC_IS_CODE_CTYPE(enc,code,ONIGENC_CTYPE_DIGIT) | | ------------------ | | | | 372| 0|#define ONIGENC_IS_CODE_CTYPE(enc,code,ctype) (enc)->is_code_ctype(code,ctype,enc) | | | | ------------------ | | | | | Branch (372:48): [True: 0, False: 0] | | | | ------------------ | | ------------------ ------------------ | Branch (3148:42): [True: 0, False: 0] ------------------ 3149| 0| return ONIGERR_TOO_LONG_WIDE_CHAR_VALUE; ------------------ | | 678| 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)) | | ------------------ | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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) | | | | ------------------ | | | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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: 22.9k] ------------------ 3166| 0| case '1': case '2': case '3': case '4': case '5': case '6': case '7': ------------------ | Branch (3166:5): [True: 0, False: 22.9k] | Branch (3166:15): [True: 0, False: 22.9k] | Branch (3166:25): [True: 0, False: 22.9k] | Branch (3166:35): [True: 0, False: 22.9k] | Branch (3166:45): [True: 0, False: 22.9k] | Branch (3166:55): [True: 0, False: 22.9k] | Branch (3166:65): [True: 0, False: 22.9k] ------------------ 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; ------------------ | | 666| 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| 17.5k| default: ------------------ | Branch (3181:5): [True: 17.5k, False: 5.39k] ------------------ 3182| 17.5k| PUNFETCH; ------------------ | | 300| 17.5k|#define PUNFETCH p = pfetch_prev ------------------ 3183| 17.5k| num = fetch_escaped_value(&p, end, env, &c2); 3184| 17.5k| if (num < 0) return num; ------------------ | Branch (3184:11): [True: 0, False: 17.5k] ------------------ 3185| 17.5k| if ((OnigCodePoint )tok->u.c != c2) { ------------------ | Branch (3185:11): [True: 16.1k, False: 1.34k] ------------------ 3186| 16.1k| tok->u.code = (OnigCodePoint )c2; 3187| 16.1k| tok->type = TK_CODE_POINT; 3188| 16.1k| } 3189| 17.5k| break; 3190| 22.9k| } 3191| 22.9k| } 3192| 39.0k| else if (c == '[') { ------------------ | Branch (3192:12): [True: 0, False: 39.0k] ------------------ 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) | | | | ------------------ | | | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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| 39.0k| else if (c == '&') { ------------------ | Branch (3216:12): [True: 0, False: 39.0k] ------------------ 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) | | | | ------------------ | | | | | | 366| 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)) | | | | ------------------ | | | | | | 361| 0|#define ONIGENC_MBC_ENC_LEN(enc,p,e) onigenc_mbclen_approximate(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| 82.2k| end: 3225| 82.2k| *src = p; 3226| 82.2k| return tok->type; 3227| 82.2k|} regparse.c:next_state_val: 4456| 68.7k|{ 4457| 68.7k| int r; 4458| | 4459| 68.7k| switch (*state) { 4460| 53.9k| case CCS_VALUE: ------------------ | Branch (4460:3): [True: 53.9k, False: 14.8k] ------------------ 4461| 53.9k| if (*type == CCV_SB) { ------------------ | Branch (4461:9): [True: 48.5k, False: 5.39k] ------------------ 4462| 48.5k| BITSET_SET_BIT_CHKDUP(cc->bs, (int )(*from)); ------------------ | | 176| 48.5k|#define BITSET_SET_BIT_CHKDUP(bs, pos) do { \ | | 177| 48.5k| if (BITSET_AT(bs, pos)) CC_DUP_WARN(env, pos, pos); \ | | ------------------ | | | | 442| 48.5k|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 439| 48.5k|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 421| 48.5k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 48.5k|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 440| 48.5k|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 421| 48.5k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 48.5k|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (442:36): [True: 0, False: 48.5k] | | | | ------------------ | | ------------------ | | 178| 48.5k| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 439| 48.5k|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 48.5k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 48.5k|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 440| 48.5k|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 48.5k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 48.5k|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | 179| 48.5k|} while (0) | | ------------------ | | | Branch (179:10): [Folded - Ignored] | | ------------------ ------------------ 4463| 48.5k| if (IS_NOT_NULL(asc_cc)) ------------------ | | 306| 48.5k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 48.5k] | | ------------------ ------------------ 4464| 48.5k| BITSET_SET_BIT(asc_cc->bs, (int )(*from)); ------------------ | | 443| 0|#define BITSET_SET_BIT(bs, pos) BS_ROOM(bs,pos) |= BS_BIT(pos) | | ------------------ | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | #define BITSET_SET_BIT(bs, pos) BS_ROOM(bs,pos) |= BS_BIT(pos) | | ------------------ | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ ------------------ 4465| 48.5k| } 4466| 5.39k| else if (*type == CCV_CODE_POINT) { ------------------ | Branch (4466:14): [True: 0, False: 5.39k] ------------------ 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)) { ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306: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| 53.9k| break; 4475| | 4476| 53.9k| case CCS_RANGE: ------------------ | Branch (4476:3): [True: 0, False: 68.7k] ------------------ 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; ------------------ | | 689| 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; ------------------ | | 669| 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)) ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306: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)) { ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306: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; ------------------ | | 669| 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)) { ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306: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: 68.7k] ------------------ 4522| 14.8k| case CCS_START: ------------------ | Branch (4522:3): [True: 14.8k, False: 53.9k] ------------------ 4523| 14.8k| *state = CCS_VALUE; 4524| 14.8k| break; 4525| | 4526| 0| default: ------------------ | Branch (4526:3): [True: 0, False: 68.7k] ------------------ 4527| 0| break; 4528| 68.7k| } 4529| | 4530| 68.7k| *from_israw = to_israw; 4531| 68.7k| *from = to; 4532| 68.7k| *type = intype; 4533| 68.7k| return 0; 4534| 68.7k|} regparse.c:next_state_class: 4423| 5.39k|{ 4424| 5.39k| int r; 4425| | 4426| 5.39k| if (*state == CCS_RANGE) ------------------ | Branch (4426:7): [True: 0, False: 5.39k] ------------------ 4427| 0| return ONIGERR_CHAR_CLASS_VALUE_AT_END_OF_RANGE; ------------------ | | 651| 0|#define ONIGERR_CHAR_CLASS_VALUE_AT_END_OF_RANGE -110 ------------------ 4428| | 4429| 5.39k| if (*state == CCS_VALUE && *type != CCV_CLASS) { ------------------ | Branch (4429:7): [True: 0, False: 5.39k] | 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); \ | | ------------------ | | | | 442| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | | | ------------------ | | | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | | | ------------------ | | | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | | | ------------------ | | | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | | | ------------------ | | | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | | | ------------------ | | | | | | ------------------ | | | | ------------------ | | | | | Branch (442:36): [True: 0, False: 0] | | | | ------------------ | | ------------------ | | 178| 0| BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | BS_ROOM(bs, pos) |= BS_BIT(pos); \ | | ------------------ | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | 179| 0|} while (0) | | ------------------ | | | Branch (179:10): [Folded - Ignored] | | ------------------ ------------------ 4432| 0| if (IS_NOT_NULL(asc_cc)) ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 0] | | ------------------ ------------------ 4433| 0| BITSET_SET_BIT(asc_cc->bs, (int )(*vs)); ------------------ | | 443| 0|#define BITSET_SET_BIT(bs, pos) BS_ROOM(bs,pos) |= BS_BIT(pos) | | ------------------ | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | #define BITSET_SET_BIT(bs, pos) BS_ROOM(bs,pos) |= BS_BIT(pos) | | ------------------ | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 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)) { ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306: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| 5.39k| *state = CCS_VALUE; 4446| 5.39k| *type = CCV_CLASS; 4447| 5.39k| return 0; 4448| 5.39k|} regparse.c:is_onechar_cclass: 6070| 20.2k|{ 6071| 20.2k| const OnigCodePoint not_found = ONIG_LAST_CODE_POINT; ------------------ | | 311| 20.2k|#define ONIG_LAST_CODE_POINT (~((OnigCodePoint )0)) ------------------ 6072| 20.2k| OnigCodePoint c = not_found; 6073| 20.2k| int i; 6074| 20.2k| BBuf *bbuf = cc->mbuf; 6075| | 6076| 20.2k| if (IS_NCCLASS_NOT(cc)) return 0; ------------------ | | 803| 20.2k|#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT) | | ------------------ | | | | 796| 20.2k|#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0) | | | | ------------------ | | | | | | 793| 20.2k|#define NCCLASS_FLAGS(cc) ((cc)->flags) | | | | ------------------ | | | | | Branch (796:37): [True: 8.08k, False: 12.1k] | | | | ------------------ | | ------------------ ------------------ 6077| | 6078| | /* check bbuf */ 6079| 12.1k| if (IS_NOT_NULL(bbuf)) { ------------------ | | 306| 12.1k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 12.1k] | | ------------------ ------------------ 6080| 0| OnigCodePoint n, *data; 6081| 0| GET_CODE_POINT(n, bbuf->p); ------------------ | | 704| 0|#define GET_CODE_POINT(code,p) code = *((OnigCodePoint* )(p)) ------------------ 6082| 0| data = (OnigCodePoint* )(bbuf->p) + 1; 6083| 0| if ((n == 1) && (data[0] == data[1])) { ------------------ | Branch (6083:9): [True: 0, False: 0] | Branch (6083:21): [True: 0, False: 0] ------------------ 6084| | /* only one char found in the bbuf, save the code point. */ 6085| 0| c = data[0]; 6086| 0| if (((c < SINGLE_BYTE_SIZE) && BITSET_AT(cc->bs, c))) { ------------------ | | 420| 0|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | ------------------ | | | | 419| 0|#define BITS_PER_BYTE 8 | | ------------------ ------------------ if (((c < SINGLE_BYTE_SIZE) && BITSET_AT(cc->bs, c))) { ------------------ | | 442| 0|#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 439| 0|#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM] | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | #define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos)) | | ------------------ | | | | 440| 0|#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM)) | | | | ------------------ | | | | | | 421| 0|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | | | ------------------ | | | | | | | | 419| 0|#define BITS_PER_BYTE 8 | | | | | | ------------------ | | | | ------------------ | | ------------------ | | | Branch (442:36): [True: 0, False: 0] | | ------------------ ------------------ | Branch (6086:12): [True: 0, False: 0] ------------------ 6087| | /* skip if c is included in the bitset */ 6088| 0| c = not_found; 6089| 0| } 6090| 0| } 6091| 0| else { 6092| 0| return 0; /* the bbuf contains multiple chars */ 6093| 0| } 6094| 0| } 6095| | 6096| | /* check bitset */ 6097| 21.5k| for (i = 0; i < BITSET_SIZE; i++) { ------------------ | | 422| 21.5k|#define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM) | | ------------------ | | | | 420| 21.5k|#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) | | | | ------------------ | | | | | | 419| 21.5k|#define BITS_PER_BYTE 8 | | | | ------------------ | | ------------------ | | #define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM) | | ------------------ | | | | 421| 21.5k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | | | ------------------ | | | | | | 419| 21.5k|#define BITS_PER_BYTE 8 | | | | ------------------ | | ------------------ ------------------ | Branch (6097:15): [True: 21.5k, False: 0] ------------------ 6098| 21.5k| Bits b1 = cc->bs[i]; 6099| 21.5k| if (b1 != 0) { ------------------ | Branch (6099:9): [True: 21.5k, False: 0] ------------------ 6100| 21.5k| if (((b1 & (b1 - 1)) == 0) && (c == not_found)) { ------------------ | Branch (6100:11): [True: 18.8k, False: 2.69k] | Branch (6100:37): [True: 9.43k, False: 9.43k] ------------------ 6101| 9.43k| c = BITS_IN_ROOM * i + countbits(b1 - 1); ------------------ | | 421| 9.43k|#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE) | | ------------------ | | | | 419| 9.43k|#define BITS_PER_BYTE 8 | | ------------------ ------------------ 6102| 12.1k| } else { 6103| 12.1k| return 0; /* the character class contains multiple chars */ 6104| 12.1k| } 6105| 21.5k| } 6106| 21.5k| } 6107| | 6108| 0| if (c != not_found) { ------------------ | Branch (6108:7): [True: 0, False: 0] ------------------ 6109| 0| *code = c; 6110| 0| return 1; 6111| 0| } 6112| | 6113| | /* the character class contains no char. */ 6114| 0| return 0; 6115| 0|} regparse.c:countbits: 6060| 9.43k|{ 6061| 9.43k| bits = (bits & 0x55555555) + ((bits >> 1) & 0x55555555); 6062| 9.43k| bits = (bits & 0x33333333) + ((bits >> 2) & 0x33333333); 6063| 9.43k| bits = (bits & 0x0f0f0f0f) + ((bits >> 4) & 0x0f0f0f0f); 6064| 9.43k| bits = (bits & 0x00ff00ff) + ((bits >> 8) & 0x00ff00ff); 6065| 9.43k| return (bits & 0x0000ffff) + ((bits >>16) & 0x0000ffff); 6066| 9.43k|} regparse.c:node_new_anychar: 1165| 13.4k|{ 1166| 13.4k| Node* node = node_new(); 1167| 13.4k| CHECK_NULL_RETURN(node); ------------------ | | 307| 13.4k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 305| 13.4k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 13.4k] | | | | ------------------ | | ------------------ ------------------ 1168| | 1169| 13.4k| SET_NTYPE(node, NT_CANY); ------------------ | | 71| 13.4k| do { \ | | 72| 13.4k| int value = ntype; \ | | 73| 13.4k| memcpy(&((node)->u.base.type), &value, sizeof(int)); \ | | 74| 13.4k| } while (0) | | ------------------ | | | Branch (74:14): [Folded - Ignored] | | ------------------ ------------------ 1170| 13.4k| return node; 1171| 13.4k|} regparse.c:node_new_quantifier: 1305| 40.4k|{ 1306| 40.4k| Node* node = node_new(); 1307| 40.4k| CHECK_NULL_RETURN(node); ------------------ | | 307| 40.4k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 305| 40.4k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 40.4k] | | | | ------------------ | | ------------------ ------------------ 1308| | 1309| 40.4k| SET_NTYPE(node, NT_QTFR); ------------------ | | 71| 40.4k| do { \ | | 72| 40.4k| int value = ntype; \ | | 73| 40.4k| memcpy(&((node)->u.base.type), &value, sizeof(int)); \ | | 74| 40.4k| } while (0) | | ------------------ | | | Branch (74:14): [Folded - Ignored] | | ------------------ ------------------ 1310| 40.4k| NQTFR(node)->state = 0; ------------------ | | 80| 40.4k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1311| 40.4k| NQTFR(node)->target = NULL; ------------------ | | 80| 40.4k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1312| 40.4k| NQTFR(node)->lower = lower; ------------------ | | 80| 40.4k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1313| 40.4k| NQTFR(node)->upper = upper; ------------------ | | 80| 40.4k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1314| 40.4k| NQTFR(node)->greedy = 1; ------------------ | | 80| 40.4k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1315| 40.4k| NQTFR(node)->target_empty_info = NQ_TARGET_ISNOT_EMPTY; ------------------ | | 80| 40.4k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ NQTFR(node)->target_empty_info = NQ_TARGET_ISNOT_EMPTY; ------------------ | | 122| 40.4k|#define NQ_TARGET_ISNOT_EMPTY 0 ------------------ 1316| 40.4k| NQTFR(node)->head_exact = NULL_NODE; ------------------ | | 80| 40.4k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ NQTFR(node)->head_exact = NULL_NODE; ------------------ | | 283| 40.4k|#define NULL_NODE ((Node* )0) ------------------ 1317| 40.4k| NQTFR(node)->next_head_exact = NULL_NODE; ------------------ | | 80| 40.4k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ NQTFR(node)->next_head_exact = NULL_NODE; ------------------ | | 283| 40.4k|#define NULL_NODE ((Node* )0) ------------------ 1318| 40.4k| NQTFR(node)->is_referred = 0; ------------------ | | 80| 40.4k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 1319| 40.4k| if (by_number != 0) ------------------ | Branch (1319:7): [True: 0, False: 40.4k] ------------------ 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| 40.4k| return node; 1327| 40.4k|} regparse.c:set_quantifier: 5395| 40.4k|{ 5396| 40.4k| QtfrNode* qn; 5397| | 5398| 40.4k| qn = NQTFR(qnode); ------------------ | | 80| 40.4k|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 5399| 40.4k| if (qn->lower == 1 && qn->upper == 1) { ------------------ | Branch (5399:7): [True: 24.2k, False: 16.1k] | Branch (5399:25): [True: 0, False: 24.2k] ------------------ 5400| 0| return 1; 5401| 0| } 5402| | 5403| 40.4k| switch (NTYPE(target)) { ------------------ | | 69| 40.4k|#define NTYPE(node) ((node)->u.base.type) ------------------ 5404| 1.34k| case NT_STR: ------------------ | | 38| 1.34k|#define NT_STR 0 ------------------ | Branch (5404:3): [True: 1.34k, False: 39.0k] ------------------ 5405| 1.34k| if (! group) { ------------------ | Branch (5405:9): [True: 0, False: 1.34k] ------------------ 5406| 0| StrNode* sn = NSTR(target); ------------------ | | 76| 0|#define NSTR(node) (&((node)->u.str)) ------------------ 5407| 0| if (str_node_can_be_split(sn, env->enc)) { ------------------ | Branch (5407:11): [True: 0, False: 0] ------------------ 5408| 0| Node* n = str_node_split_last_char(sn, env->enc); 5409| 0| if (IS_NOT_NULL(n)) { ------------------ | | 306| 0|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | ------------------ | | | Branch (306:39): [True: 0, False: 0] | | ------------------ ------------------ 5410| 0| qn->target = n; 5411| 0| return 2; 5412| 0| } 5413| 0| } 5414| 0| } 5415| 1.34k| break; 5416| | 5417| 1.34k| case NT_QTFR: ------------------ | | 43| 0|#define NT_QTFR 5 ------------------ | Branch (5417:3): [True: 0, False: 40.4k] ------------------ 5418| 0| { /* check redundant double repeat. */ 5419| | /* verbose warn (?:.?)? etc... but not warn (.?)? etc... */ 5420| 0| QtfrNode* qnt = NQTFR(target); ------------------ | | 80| 0|#define NQTFR(node) (&((node)->u.qtfr)) ------------------ 5421| 0| int nestq_num = popular_quantifier_num(qn); 5422| 0| int targetq_num = popular_quantifier_num(qnt); 5423| | 5424| 0|#ifdef USE_WARNING_REDUNDANT_NESTED_REPEAT_OPERATOR 5425| 0| if (nestq_num >= 0 && targetq_num >= 0 && ------------------ | Branch (5425:11): [True: 0, False: 0] | Branch (5425:29): [True: 0, False: 0] ------------------ 5426| 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] | | ------------------ ------------------ 5427| 0| switch (ReduceTypeTable[targetq_num][nestq_num]) { 5428| 0| case RQ_ASIS: ------------------ | Branch (5428:2): [True: 0, False: 0] ------------------ 5429| 0| break; 5430| | 5431| 0| case RQ_DEL: ------------------ | Branch (5431:2): [True: 0, False: 0] ------------------ 5432| 0| if (onig_warn != onig_null_warn) { ------------------ | Branch (5432:8): [True: 0, False: 0] ------------------ 5433| 0| onig_syntax_warn(env, "regular expression has redundant nested repeat operator '%s'", 5434| 0| PopularQStr[targetq_num]); 5435| 0| } 5436| 0| goto warn_exit; 5437| 0| break; 5438| | 5439| 0| default: ------------------ | 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, "nested repeat operator '%s' and '%s' was replaced with '%s' in regular expression", 5442| 0| PopularQStr[targetq_num], PopularQStr[nestq_num], 5443| 0| ReduceQStr[ReduceTypeTable[targetq_num][nestq_num]]); 5444| 0| } 5445| 0| goto warn_exit; 5446| 0| break; 5447| 0| } 5448| 0| } 5449| | 5450| 0| warn_exit: 5451| 0|#endif 5452| 0| if (targetq_num >= 0) { ------------------ | Branch (5452:11): [True: 0, False: 0] ------------------ 5453| 0| if (nestq_num >= 0) { ------------------ | Branch (5453:6): [True: 0, False: 0] ------------------ 5454| 0| onig_reduce_nested_quantifier(qnode, target); 5455| 0| goto q_exit; 5456| 0| } 5457| 0| else if (targetq_num == 1 || targetq_num == 2) { /* * or + */ ------------------ | Branch (5457:11): [True: 0, False: 0] | Branch (5457:31): [True: 0, False: 0] ------------------ 5458| | /* (?:a*){n,m}, (?:a+){n,m} => (?:a*){n,n}, (?:a+){n,n} */ 5459| 0| if (! IS_REPEAT_INFINITE(qn->upper) && qn->upper > 1 && qn->greedy) { ------------------ | | 416| 0|#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE) | | ------------------ | | | | 415| 0|#define REPEAT_INFINITE -1 | | ------------------ ------------------ | Branch (5459:8): [True: 0, False: 0] | Branch (5459:43): [True: 0, False: 0] | Branch (5459:60): [True: 0, False: 0] ------------------ 5460| 0| qn->upper = (qn->lower == 0 ? 1 : qn->lower); ------------------ | Branch (5460:19): [True: 0, False: 0] ------------------ 5461| 0| } 5462| 0| } 5463| 0| } 5464| 0| } 5465| 0| break; 5466| | 5467| 39.0k| default: ------------------ | Branch (5467:3): [True: 39.0k, False: 1.34k] ------------------ 5468| 39.0k| break; 5469| 40.4k| } 5470| | 5471| 40.4k| qn->target = target; 5472| 40.4k| q_exit: 5473| 40.4k| return 0; 5474| 40.4k|} regparse.c:node_new_enclose_memory: 1354| 6.74k|{ 1355| 6.74k| Node* node = node_new_enclose(ENCLOSE_MEMORY); ------------------ | | 94| 6.74k|#define ENCLOSE_MEMORY (1<<0) ------------------ 1356| 6.74k| CHECK_NULL_RETURN(node); ------------------ | | 307| 6.74k|#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL | | ------------------ | | | | 305| 6.74k|#define IS_NULL(p) (((void*)(p)) == (void*)0) | | | | ------------------ | | | | | Branch (305:39): [True: 0, False: 6.74k] | | | | ------------------ | | ------------------ ------------------ 1357| 6.74k| if (is_named != 0) ------------------ | Branch (1357:7): [True: 5.39k, False: 1.34k] ------------------ 1358| 5.39k| SET_ENCLOSE_STATUS(node, NST_NAMED_GROUP); ------------------ | | 144| 5.39k|#define SET_ENCLOSE_STATUS(node,f) (node)->u.enclose.state |= (f) ------------------ 1359| | 1360| 6.74k|#ifdef USE_SUBEXP_CALL 1361| 6.74k| NENCLOSE(node)->option = option; ------------------ | | 81| 6.74k|#define NENCLOSE(node) (&((node)->u.enclose)) ------------------ 1362| 6.74k|#endif 1363| 6.74k| return node; 1364| 6.74k|} regparse.c:scan_env_set_mem_node: 1052| 6.74k|{ 1053| 6.74k| if (env->num_mem >= num) ------------------ | Branch (1053:7): [True: 6.74k, False: 0] ------------------ 1054| 6.74k| SCANENV_MEM_NODES(env)[num] = node; ------------------ | | 287| 6.74k| (IS_NOT_NULL((senv)->mem_nodes_dynamic) ? \ | | ------------------ | | | | 306| 6.74k|#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0) | | | | ------------------ | | | | | Branch (306:39): [True: 0, False: 6.74k] | | | | ------------------ | | ------------------ | | 288| 6.74k| (senv)->mem_nodes_dynamic : (senv)->mem_nodes_static) ------------------ 1055| 0| else 1056| 0| return ONIGERR_PARSER_BUG; ------------------ | | 631| 0|#define ONIGERR_PARSER_BUG -11 ------------------ 1057| 6.74k| return 0; 1058| 6.74k|} onig_st_init_table_with_size: 582| 1.34k|{ 583| 1.34k| st_table *tab; 584| 1.34k| 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| 1.34k| n = get_power2(size); 600| 1.34k|#ifndef RUBY 601| 1.34k| if (n < 0) ------------------ | Branch (601:9): [True: 0, False: 1.34k] ------------------ 602| 0| return NULL; 603| 1.34k|#endif 604| 1.34k| tab = (st_table *) malloc(sizeof (st_table)); 605| 1.34k|#ifndef RUBY 606| 1.34k| if (tab == NULL) ------------------ | Branch (606:9): [True: 0, False: 1.34k] ------------------ 607| 0| return NULL; 608| 1.34k|#endif 609| 1.34k| tab->type = type; 610| 1.34k| tab->entry_power = n; 611| 1.34k| tab->bin_power = features[n].bin_power; 612| 1.34k| tab->size_ind = features[n].size_ind; 613| 1.34k| if (n <= MAX_POWER2_FOR_TABLES_WITHOUT_BINS) ------------------ | | 343| 1.34k|#define MAX_POWER2_FOR_TABLES_WITHOUT_BINS 4 ------------------ | Branch (613:9): [True: 1.34k, False: 0] ------------------ 614| 1.34k| 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| 1.34k| tab->entries = (st_table_entry *) malloc(get_allocated_entries(tab) 625| 1.34k| * sizeof(st_table_entry)); 626| 1.34k|#ifndef RUBY 627| 1.34k| if (tab->entries == NULL) { ------------------ | Branch (627:9): [True: 0, False: 1.34k] ------------------ 628| 0| st_free_table(tab); ------------------ | | 187| 0|# define st_free_table onig_st_free_table ------------------ 629| 0| return NULL; 630| 0| } 631| 1.34k|#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| 1.34k| make_tab_empty(tab); 639| 1.34k| tab->rebuilds_num = 0; 640| |#ifdef ST_DEBUG 641| | st_check(tab); 642| |#endif 643| 1.34k| return tab; 644| 1.34k|} onig_st_free_table: 716| 1.34k|{ 717| 1.34k| if (tab->bins != NULL) ------------------ | Branch (717:9): [True: 0, False: 1.34k] ------------------ 718| 0| free(tab->bins); 719| 1.34k| free(tab->entries); 720| 1.34k| free(tab); 721| 1.34k|} onig_st_lookup: 1110| 4.04k|{ 1111| 4.04k| st_index_t bin; 1112| 4.04k| st_hash_t hash = do_hash(key, tab); 1113| | 1114| 4.04k| retry: 1115| 4.04k| if (tab->bins == NULL) { ------------------ | Branch (1115:9): [True: 4.04k, False: 0] ------------------ 1116| 4.04k| bin = find_entry(tab, hash, key); 1117| 4.04k| if (EXPECT(bin == REBUILT_TABLE_ENTRY_IND, 0)) ------------------ | | 117| 4.04k|#define EXPECT(expr, val) __builtin_expect(expr, val) | | ------------------ | | | Branch (117:27): [True: 0, False: 4.04k] | | ------------------ ------------------ 1118| 0| goto retry; 1119| 4.04k| if (bin == UNDEFINED_ENTRY_IND) ------------------ | | 399| 4.04k|#define UNDEFINED_ENTRY_IND (~(st_index_t) 0) ------------------ | Branch (1119:6): [True: 4.04k, False: 0] ------------------ 1120| 4.04k| return 0; 1121| 4.04k| } 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| 4.04k|} onig_st_insert: 1182| 5.39k|{ 1183| 5.39k| st_table_entry *entry; 1184| 5.39k| st_index_t bin; 1185| 5.39k| st_index_t ind; 1186| 5.39k| st_hash_t hash_value; 1187| 5.39k| st_index_t bin_ind; 1188| 5.39k| int new_p; 1189| | 1190| 5.39k| hash_value = do_hash(key, tab); 1191| 5.39k| retry: 1192| 5.39k| rebuild_table_if_necessary(tab); 1193| 5.39k| if (tab->bins == NULL) { ------------------ | Branch (1193:9): [True: 5.39k, False: 0] ------------------ 1194| 5.39k| bin = find_entry(tab, hash_value, key); 1195| 5.39k| if (EXPECT(bin == REBUILT_TABLE_ENTRY_IND, 0)) ------------------ | | 117| 5.39k|#define EXPECT(expr, val) __builtin_expect(expr, val) | | ------------------ | | | Branch (117:27): [True: 0, False: 5.39k] | | ------------------ ------------------ 1196| 0| goto retry; 1197| 5.39k| new_p = bin == UNDEFINED_ENTRY_IND; ------------------ | | 399| 5.39k|#define UNDEFINED_ENTRY_IND (~(st_index_t) 0) ------------------ 1198| 5.39k| if (new_p) ------------------ | Branch (1198:6): [True: 5.39k, False: 0] ------------------ 1199| 5.39k| tab->num_entries++; 1200| 5.39k| bin_ind = UNDEFINED_BIN_IND; ------------------ | | 400| 5.39k|#define UNDEFINED_BIN_IND (~(st_index_t) 0) ------------------ 1201| 5.39k| } 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| 5.39k| if (new_p) { ------------------ | Branch (1210:9): [True: 5.39k, False: 0] ------------------ 1211| 5.39k| st_assert(tab->entries_bound < get_allocated_entries(tab)); ------------------ | | 128| 5.39k|#define st_assert(cond) ((void)(0 && (cond))) | | ------------------ | | | Branch (128:33): [Folded - Ignored] | | | Branch (128:38): [True: 0, False: 0] | | ------------------ ------------------ 1212| 5.39k| ind = tab->entries_bound++; 1213| 5.39k| entry = &tab->entries[ind]; 1214| 5.39k| entry->hash = hash_value; 1215| 5.39k| entry->key = key; 1216| 5.39k| entry->record = value; 1217| 5.39k| if (bin_ind != UNDEFINED_BIN_IND) ------------------ | | 400| 5.39k|#define UNDEFINED_BIN_IND (~(st_index_t) 0) ------------------ | Branch (1217:6): [True: 0, False: 5.39k] ------------------ 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| 5.39k| return 0; 1223| 5.39k| } 1224| 0| tab->entries[bin].record = value; 1225| |#ifdef ST_DEBUG 1226| | st_check(tab); 1227| |#endif 1228| 0| return 1; 1229| 5.39k|} onig_st_foreach: 1723| 1.34k|{ 1724| 1.34k| return st_general_foreach(tab, func, NULL, arg, FALSE); ------------------ | | 77| 1.34k|# define FALSE 0 ------------------ 1725| 1.34k|} st.c:get_power2: 348| 1.34k|{ 349| 1.34k| unsigned int n; 350| | 351| 5.39k| for (n = 0; size != 0; n++) ------------------ | Branch (351:17): [True: 4.04k, False: 1.34k] ------------------ 352| 4.04k| size >>= 1; 353| 1.34k| if (n <= MAX_POWER2) ------------------ | | 210| 1.34k|#define MAX_POWER2 62 ------------------ | Branch (353:9): [True: 1.34k, False: 0] ------------------ 354| 1.34k| return n < MINIMAL_POWER2 ? MINIMAL_POWER2 : n; ------------------ | | 335| 1.34k|#define MINIMAL_POWER2 2 ------------------ return n < MINIMAL_POWER2 ? MINIMAL_POWER2 : n; ------------------ | | 335| 0|#define MINIMAL_POWER2 2 ------------------ | Branch (354:16): [True: 0, False: 1.34k] ------------------ 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| 1.34k|} st.c:get_allocated_entries: 466| 6.74k|{ 467| 6.74k| return ((st_index_t) 1)<entry_power; 468| 6.74k|} st.c:make_tab_empty: 487| 1.34k|{ 488| 1.34k| tab->num_entries = 0; 489| 1.34k| tab->entries_start = tab->entries_bound = 0; 490| 1.34k| if (tab->bins != NULL) ------------------ | Branch (490:9): [True: 0, False: 1.34k] ------------------ 491| 0| initialize_bins(tab); 492| 1.34k|} st.c:do_hash: 326| 9.43k|{ 327| 9.43k| 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| 9.43k| return hash == RESERVED_HASH_VAL ? RESERVED_HASH_SUBSTITUTION_VAL : hash; ------------------ | | 317| 9.43k|#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: 9.43k] ------------------ 332| 9.43k|} st.c:find_entry: 881| 14.8k|{ 882| 14.8k| int eq_p, rebuilt_p; 883| 14.8k| st_index_t i, bound; 884| 14.8k| st_table_entry *entries; 885| | 886| 14.8k| bound = tab->entries_bound; 887| 14.8k| entries = tab->entries; 888| 31.0k| for (i = tab->entries_start; i < bound; i++) { ------------------ | Branch (888:34): [True: 21.5k, False: 9.43k] ------------------ 889| 21.5k| DO_PTR_EQUAL_CHECK(tab, &entries[i], hash_value, key, eq_p, rebuilt_p); ------------------ | | 187| 21.5k| do { \ | | 188| 21.5k| unsigned int _old_rebuilds_num = (tab)->rebuilds_num; \ | | 189| 21.5k| res = PTR_EQUAL(tab, ptr, hash_val, key); \ | | ------------------ | | | | 182| 21.5k| ((ptr)->hash == (hash_val) && EQUAL((tab), (key_), (ptr)->key)) | | | | ------------------ | | | | | | 180| 5.39k|#define EQUAL(tab,x,y) ((x) == (y) || (*(tab)->type->compare)((x),(y)) == 0) | | | | | | ------------------ | | | | | | | Branch (180:25): [True: 5.39k, False: 0] | | | | | | | Branch (180:39): [True: 0, False: 0] | | | | | | ------------------ | | | | ------------------ | | | | | Branch (182:6): [True: 5.39k, False: 16.1k] | | | | ------------------ | | ------------------ | | 190| 21.5k| rebuilt_p = _old_rebuilds_num != (tab)->rebuilds_num; \ | | 191| 21.5k| } while (FALSE) | | ------------------ | | | | 77| 21.5k|# define FALSE 0 | | | | ------------------ | | | | | Branch (77:18): [Folded - Ignored] | | | | ------------------ | | ------------------ ------------------ 890| 21.5k| if (EXPECT(rebuilt_p, 0)) ------------------ | | 117| 21.5k|#define EXPECT(expr, val) __builtin_expect(expr, val) | | ------------------ | | | Branch (117:27): [True: 0, False: 21.5k] | | ------------------ ------------------ 891| 0| return REBUILT_TABLE_ENTRY_IND; ------------------ | | 404| 0|#define REBUILT_TABLE_ENTRY_IND (~(st_index_t) 1) ------------------ 892| 21.5k| if (eq_p) ------------------ | Branch (892:6): [True: 5.39k, False: 16.1k] ------------------ 893| 5.39k| return i; 894| 21.5k| } 895| 9.43k| return UNDEFINED_ENTRY_IND; ------------------ | | 399| 9.43k|#define UNDEFINED_ENTRY_IND (~(st_index_t) 0) ------------------ 896| 14.8k|} st.c:rebuild_table_if_necessary: 1169| 5.39k|{ 1170| 5.39k| st_index_t bound = tab->entries_bound; 1171| | 1172| 5.39k| if (bound == get_allocated_entries(tab)) ------------------ | Branch (1172:9): [True: 0, False: 5.39k] ------------------ 1173| 0| rebuild_table(tab); 1174| 5.39k| st_assert(tab->entries_bound < get_allocated_entries(tab)); ------------------ | | 128| 5.39k|#define st_assert(cond) ((void)(0 && (cond))) | | ------------------ | | | Branch (128:33): [Folded - Ignored] | | | Branch (128:38): [True: 0, False: 0] | | ------------------ ------------------ 1175| 5.39k|} st.c:st_general_foreach: 1605| 1.34k|{ 1606| 1.34k| st_index_t bin; 1607| 1.34k| st_index_t bin_ind; 1608| 1.34k| st_table_entry *entries, *curr_entry_ptr; 1609| 1.34k| enum st_retval retval; 1610| 1.34k| st_index_t i, rebuilds_num; 1611| 1.34k| st_hash_t hash; 1612| 1.34k| st_data_t key; 1613| 1.34k| int error_p, packed_p = tab->bins == NULL; 1614| | 1615| 1.34k| st_assert(tab->entries_start <= tab->entries_bound); ------------------ | | 128| 1.34k|#define st_assert(cond) ((void)(0 && (cond))) | | ------------------ | | | Branch (128:33): [Folded - Ignored] | | | Branch (128:38): [True: 0, False: 0] | | ------------------ ------------------ 1616| 1.34k| entries = tab->entries; 1617| | /* The bound can change inside the loop even without rebuilding 1618| | the table, e.g. by an entry inesrtion. */ 1619| 6.74k| for (i = tab->entries_start; i < tab->entries_bound; i++) { ------------------ | Branch (1619:34): [True: 5.39k, False: 1.34k] ------------------ 1620| 5.39k| curr_entry_ptr = &entries[i]; 1621| 5.39k| if (EXPECT(DELETED_ENTRY_P(curr_entry_ptr), 0)) ------------------ | | 117| 5.39k|#define EXPECT(expr, val) __builtin_expect(expr, val) | | ------------------ | | | Branch (117:27): [True: 0, False: 5.39k] | | ------------------ ------------------ 1622| 0| continue; 1623| 5.39k| key = curr_entry_ptr->key; 1624| 5.39k| rebuilds_num = tab->rebuilds_num; 1625| 5.39k| hash = curr_entry_ptr->hash; 1626| 5.39k| retval = (*func)(key, curr_entry_ptr->record, arg, 0); 1627| | 1628| 5.39k| if (retval == ST_REPLACE && replace) { ------------------ | Branch (1628:13): [True: 0, False: 5.39k] | 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| 5.39k| if (rebuilds_num != tab->rebuilds_num) { ------------------ | Branch (1636:6): [True: 0, False: 5.39k] ------------------ 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| 5.39k| switch (retval) { ------------------ | Branch (1663:10): [True: 0, False: 5.39k] ------------------ 1664| 0| case ST_REPLACE: ------------------ | Branch (1664:11): [True: 0, False: 5.39k] ------------------ 1665| 0| break; 1666| 0| case ST_CONTINUE: ------------------ | Branch (1666:4): [True: 0, False: 5.39k] ------------------ 1667| 0| break; 1668| 0| case ST_CHECK: ------------------ | Branch (1668:4): [True: 0, False: 5.39k] ------------------ 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: 5.39k] ------------------ 1672| |#ifdef ST_DEBUG 1673| | st_check(tab); 1674| |#endif 1675| 0| return 0; 1676| 5.39k| case ST_DELETE: { ------------------ | Branch (1676:4): [True: 5.39k, False: 0] ------------------ 1677| 5.39k| st_data_t key = curr_entry_ptr->key; 1678| | 1679| 5.39k| again: 1680| 5.39k| if (packed_p) { ------------------ | Branch (1680:10): [True: 5.39k, False: 0] ------------------ 1681| 5.39k| bin = find_entry(tab, hash, key); 1682| 5.39k| if (EXPECT(bin == REBUILT_TABLE_ENTRY_IND, 0)) ------------------ | | 117| 5.39k|#define EXPECT(expr, val) __builtin_expect(expr, val) | | ------------------ | | | Branch (117:27): [True: 0, False: 5.39k] | | ------------------ ------------------ 1683| 0| goto again; 1684| 5.39k| if (bin == UNDEFINED_ENTRY_IND) ------------------ | | 399| 5.39k|#define UNDEFINED_ENTRY_IND (~(st_index_t) 0) ------------------ | Branch (1684:7): [True: 0, False: 5.39k] ------------------ 1685| 0| break; 1686| 5.39k| } 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| 5.39k| curr_entry_ptr = &entries[bin]; 1697| 5.39k| MARK_ENTRY_DELETED(curr_entry_ptr); ------------------ | | 431| 5.39k|#define MARK_ENTRY_DELETED(e_ptr) ((e_ptr)->hash = RESERVED_HASH_VAL) | | ------------------ | | | | 317| 5.39k|#define RESERVED_HASH_VAL (~(st_hash_t) 0) | | ------------------ ------------------ 1698| 5.39k| tab->num_entries--; 1699| 5.39k| update_range_for_deleted(tab, bin); 1700| |#ifdef ST_DEBUG 1701| | st_check(tab); 1702| |#endif 1703| 5.39k| break; 1704| 5.39k| } 1705| 5.39k| } 1706| 5.39k| } 1707| |#ifdef ST_DEBUG 1708| | st_check(tab); 1709| |#endif 1710| 1.34k| return 0; 1711| 1.34k|} st.c:update_range_for_deleted: 1375| 5.39k|{ 1376| | /* Do not update entries_bound here. Otherwise, we can fill all 1377| | bins by deleted entry value before rebuilding the table. */ 1378| 5.39k| if (tab->entries_start == n) ------------------ | Branch (1378:9): [True: 5.39k, False: 0] ------------------ 1379| 5.39k| tab->entries_start = n + 1; 1380| 5.39k|} flb_cf_create: 38| 1.34k|{ 39| 1.34k| struct flb_cf *ctx; 40| | 41| 1.34k| ctx = flb_calloc(1, sizeof(struct flb_cf)); 42| 1.34k| if (!ctx) { ------------------ | Branch (42:9): [True: 0, False: 1.34k] ------------------ 43| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 44| 0| return NULL; 45| 0| } 46| | 47| | /* env vars */ 48| 1.34k| mk_list_init(&ctx->env); 49| | 50| | /* meta commands */ 51| 1.34k| mk_list_init(&ctx->metas); 52| | 53| | /* parsers */ 54| 1.34k| mk_list_init(&ctx->parsers); 55| 1.34k| mk_list_init(&ctx->multiline_parsers); 56| | 57| | /* custom plugins */ 58| 1.34k| mk_list_init(&ctx->customs); 59| | 60| | /* pipeline */ 61| 1.34k| mk_list_init(&ctx->inputs); 62| 1.34k| mk_list_init(&ctx->filters); 63| 1.34k| mk_list_init(&ctx->outputs); 64| | 65| | /* other sections */ 66| 1.34k| mk_list_init(&ctx->others); 67| | 68| | /* general list for sections */ 69| 1.34k| mk_list_init(&ctx->sections); 70| | 71| 1.34k| return ctx; 72| 1.34k|} flb_cf_destroy: 75| 1.34k|{ 76| 1.34k| flb_kv_release(&cf->env); 77| 1.34k| flb_kv_release(&cf->metas); 78| 1.34k| flb_cf_section_destroy_all(cf); 79| 1.34k| flb_free(cf); 80| 1.34k|} flb_cf_section_create: 480| 1.34k|{ 481| 1.34k| int type; 482| 1.34k| struct flb_cf_section *s; 483| | 484| 1.34k| if (!name) { ------------------ | Branch (484:9): [True: 0, False: 1.34k] ------------------ 485| 0| return NULL; 486| 0| } 487| | 488| | /* determinate type by name */ 489| 1.34k| if (len <= 0) { ------------------ | Branch (489:9): [True: 1.34k, False: 0] ------------------ 490| 1.34k| len = strlen(name); 491| 1.34k| } 492| | 493| | /* get the section type */ 494| 1.34k| type = get_section_type(name, len); 495| | 496| | /* check if 'service' already exists */ 497| 1.34k| if (type == FLB_CF_SERVICE && cf->service) { ------------------ | Branch (497:9): [True: 1.34k, False: 0] | Branch (497:35): [True: 0, False: 1.34k] ------------------ 498| 0| return cf->service; 499| 0| } 500| | 501| | /* section context */ 502| 1.34k| s = flb_malloc(sizeof(struct flb_cf_section)); 503| 1.34k| if (!s) { ------------------ | Branch (503:9): [True: 0, False: 1.34k] ------------------ 504| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 505| 0| return NULL; 506| 0| } 507| | 508| | /* initialize lists */ 509| 1.34k| s->properties = cfl_kvlist_create(); 510| 1.34k| mk_list_init(&s->groups); 511| | 512| | /* create a NULL terminated name */ 513| 1.34k| s->name = flb_sds_create_len(name, len); 514| 1.34k| if (!s->name) { ------------------ | Branch (514:9): [True: 0, False: 1.34k] ------------------ 515| 0| flb_free(s); 516| 0| return NULL; 517| 0| } 518| 1.34k| s->type = type; 519| | 520| 1.34k| if (type == FLB_CF_SERVICE && !cf->service) { ------------------ | Branch (520:9): [True: 1.34k, False: 0] | Branch (520:35): [True: 1.34k, False: 0] ------------------ 521| 1.34k| cf->service = s; 522| 1.34k| } 523| | 524| | /* link to global section */ 525| 1.34k| mk_list_add(&s->_head, &cf->sections); 526| | 527| | /* link to list per type */ 528| 1.34k| if (type == FLB_CF_PARSER) { ------------------ | Branch (528:9): [True: 0, False: 1.34k] ------------------ 529| 0| mk_list_add(&s->_head_section, &cf->parsers); 530| 0| } 531| 1.34k| else if (type == FLB_CF_MULTILINE_PARSER) { ------------------ | Branch (531:14): [True: 0, False: 1.34k] ------------------ 532| 0| mk_list_add(&s->_head_section, &cf->multiline_parsers); 533| 0| } 534| 1.34k| else if (type == FLB_CF_CUSTOM) { ------------------ | Branch (534:14): [True: 0, False: 1.34k] ------------------ 535| 0| mk_list_add(&s->_head_section, &cf->customs); 536| 0| } 537| 1.34k| else if (type == FLB_CF_INPUT) { ------------------ | Branch (537:14): [True: 0, False: 1.34k] ------------------ 538| 0| mk_list_add(&s->_head_section, &cf->inputs); 539| 0| } 540| 1.34k| else if (type == FLB_CF_FILTER) { ------------------ | Branch (540:14): [True: 0, False: 1.34k] ------------------ 541| 0| mk_list_add(&s->_head_section, &cf->filters); 542| 0| } 543| 1.34k| else if (type == FLB_CF_OUTPUT) { ------------------ | Branch (543:14): [True: 0, False: 1.34k] ------------------ 544| 0| mk_list_add(&s->_head_section, &cf->outputs); 545| 0| } 546| 1.34k| else if (type == FLB_CF_OTHER) { ------------------ | Branch (546:14): [True: 0, False: 1.34k] ------------------ 547| 0| mk_list_add(&s->_head_section, &cf->others); 548| 0| } 549| | 550| 1.34k| return s; 551| 1.34k|} flb_cf_section_destroy: 570| 1.34k|{ 571| 1.34k| struct mk_list *tmp; 572| 1.34k| struct mk_list *head; 573| 1.34k| struct flb_cf_group *g; 574| | 575| 1.34k| if (s->name) { ------------------ | Branch (575:9): [True: 1.34k, False: 0] ------------------ 576| 1.34k| flb_sds_destroy(s->name); 577| 1.34k| s->name = NULL; 578| 1.34k| } 579| 1.34k| cfl_kvlist_destroy(s->properties); 580| | 581| | /* groups */ 582| 1.34k| mk_list_foreach_safe(head, tmp, &s->groups) { ------------------ | | 207| 1.34k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 0, False: 1.34k] | | ------------------ ------------------ 583| 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) );}) | | ------------------ ------------------ 584| 0| flb_cf_group_destroy(g); 585| 0| } 586| | 587| | /* unlink */ 588| 1.34k| mk_list_del(&s->_head); 589| | 590| 1.34k| if (s->type != FLB_CF_SERVICE) { ------------------ | Branch (590:9): [True: 0, False: 1.34k] ------------------ 591| 0| mk_list_del(&s->_head_section); 592| 0| } 593| | 594| 1.34k| flb_free(s); 595| 1.34k|} flb_cf_section_destroy_all: 610| 1.34k|{ 611| 1.34k| section_destroy_list(cf, &cf->sections); 612| 1.34k|} flb_config_format.c:get_section_type: 83| 1.34k|{ 84| 1.34k| if (strncasecmp(name, "SERVICE", len) == 0) { ------------------ | Branch (84:9): [True: 1.34k, False: 0] ------------------ 85| 1.34k| return FLB_CF_SERVICE; 86| 1.34k| } 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| 1.34k|} flb_config_format.c:section_destroy_list: 598| 1.34k|{ 599| 1.34k| struct mk_list *tmp; 600| 1.34k| struct mk_list *head; 601| 1.34k| struct flb_cf_section *s; 602| | 603| 1.34k| mk_list_foreach_safe(head, tmp, list) { ------------------ | | 207| 2.69k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 1.34k, False: 1.34k] | | ------------------ ------------------ 604| 1.34k| s = mk_list_entry(head, struct flb_cf_section, _head); ------------------ | | 214| 1.34k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 1.34k|#define container_of(ptr, type, member) ({ \ | | | | 39| 1.34k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 1.34k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 605| 1.34k| flb_cf_section_destroy(cf, s); 606| 1.34k| } 607| 1.34k|} flb_config_init: 180| 1.34k|{ 181| 1.34k| int ret; 182| 1.34k| struct flb_config *config; 183| 1.34k| struct flb_cf *cf; 184| 1.34k| struct flb_cf_section *section; 185| | 186| 1.34k| config = flb_calloc(1, sizeof(struct flb_config)); 187| 1.34k| if (!config) { ------------------ | Branch (187:9): [True: 0, False: 1.34k] ------------------ 188| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 189| 0| return NULL; 190| 0| } 191| | 192| 1.34k| MK_EVENT_ZERO(&config->ch_event); 193| 1.34k| MK_EVENT_ZERO(&config->event_flush); 194| 1.34k| MK_EVENT_ZERO(&config->event_shutdown); 195| | 196| | /* is data ingestion active ? */ 197| 1.34k| config->is_ingestion_active = FLB_TRUE; ------------------ | | 26| 1.34k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 1.34k|#define FLB_FALSE 0 | | ------------------ ------------------ 198| | 199| | /* Is the engine (event loop) actively running ? */ 200| 1.34k| config->is_running = FLB_TRUE; ------------------ | | 26| 1.34k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 1.34k|#define FLB_FALSE 0 | | ------------------ ------------------ 201| | 202| | /* Initialize config_format context */ 203| 1.34k| cf = flb_cf_create(); 204| 1.34k| if (!cf) { ------------------ | Branch (204:9): [True: 0, False: 1.34k] ------------------ 205| 0| flb_config_exit(config); 206| 0| return NULL; 207| 0| } 208| 1.34k| config->cf_main = cf; 209| | 210| 1.34k| section = flb_cf_section_create(cf, "service", 0); 211| 1.34k| if (!section) { ------------------ | Branch (211:9): [True: 0, False: 1.34k] ------------------ 212| 0| flb_config_exit(config); 213| 0| return NULL; 214| 0| } 215| | 216| | /* Flush */ 217| 1.34k| config->flush = FLB_CONFIG_FLUSH_SECS; ------------------ | | 33| 1.34k|#define FLB_CONFIG_FLUSH_SECS 1 ------------------ 218| 1.34k| config->daemon = FLB_FALSE; ------------------ | | 25| 1.34k|#define FLB_FALSE 0 ------------------ 219| 1.34k| config->init_time = time(NULL); 220| 1.34k| config->kernel = flb_kernel_info(); 221| 1.34k| config->verbose = 3; 222| 1.34k| config->grace = 5; 223| 1.34k| config->grace_count = 0; 224| 1.34k| config->exit_status_code = 0; 225| | 226| | /* json */ 227| 1.34k| config->convert_nan_to_null = FLB_FALSE; ------------------ | | 25| 1.34k|#define FLB_FALSE 0 ------------------ 228| | 229| 1.34k|#ifdef FLB_HAVE_HTTP_SERVER 230| 1.34k| config->http_ctx = NULL; 231| 1.34k| config->http_server = FLB_FALSE; ------------------ | | 25| 1.34k|#define FLB_FALSE 0 ------------------ 232| 1.34k| config->http_listen = flb_strdup(FLB_CONFIG_HTTP_LISTEN); ------------------ | | 34| 1.34k|#define FLB_CONFIG_HTTP_LISTEN "0.0.0.0" ------------------ 233| 1.34k| config->http_port = flb_strdup(FLB_CONFIG_HTTP_PORT); ------------------ | | 35| 1.34k|#define FLB_CONFIG_HTTP_PORT "2020" ------------------ 234| 1.34k| config->health_check = FLB_FALSE; ------------------ | | 25| 1.34k|#define FLB_FALSE 0 ------------------ 235| 1.34k| config->hc_errors_count = HC_ERRORS_COUNT_DEFAULT; ------------------ | | 36| 1.34k|#define HC_ERRORS_COUNT_DEFAULT 5 ------------------ 236| 1.34k| config->hc_retry_failure_count = HC_RETRY_FAILURE_COUNTS_DEFAULT; ------------------ | | 37| 1.34k|#define HC_RETRY_FAILURE_COUNTS_DEFAULT 5 ------------------ 237| 1.34k| config->health_check_period = HEALTH_CHECK_PERIOD; ------------------ | | 38| 1.34k|#define HEALTH_CHECK_PERIOD 60 ------------------ 238| 1.34k|#endif 239| | 240| 1.34k| config->http_proxy = getenv("HTTP_PROXY"); 241| 1.34k| if (flb_str_emptyval(config->http_proxy) == FLB_TRUE) { ------------------ | | 26| 1.34k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 1.34k|#define FLB_FALSE 0 | | ------------------ ------------------ | Branch (241:9): [True: 0, False: 1.34k] ------------------ 242| 0| config->http_proxy = getenv("http_proxy"); 243| 0| if (flb_str_emptyval(config->http_proxy) == FLB_TRUE) { ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ | Branch (243:13): [True: 0, False: 0] ------------------ 244| | /* Proxy should not be set when `HTTP_PROXY` or `http_proxy` are set to "" */ 245| 0| config->http_proxy = NULL; 246| 0| } 247| 0| } 248| 1.34k| config->no_proxy = getenv("NO_PROXY"); 249| 1.34k| if (flb_str_emptyval(config->no_proxy) == FLB_TRUE || config->http_proxy == NULL) { ------------------ | | 26| 2.69k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 2.69k|#define FLB_FALSE 0 | | ------------------ ------------------ | Branch (249:9): [True: 0, False: 1.34k] | Branch (249:59): [True: 1.34k, False: 0] ------------------ 250| 1.34k| config->no_proxy = getenv("no_proxy"); 251| 1.34k| if (flb_str_emptyval(config->no_proxy) == FLB_TRUE || config->http_proxy == NULL) { ------------------ | | 26| 2.69k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 2.69k|#define FLB_FALSE 0 | | ------------------ ------------------ | Branch (251:13): [True: 0, False: 1.34k] | Branch (251:63): [True: 1.34k, False: 0] ------------------ 252| | /* NoProxy should not be set when `NO_PROXY` or `no_proxy` are set to "" or there is no Proxy. */ 253| 1.34k| config->no_proxy = NULL; 254| 1.34k| } 255| 1.34k| } 256| | 257| 1.34k| config->cio = NULL; 258| 1.34k| config->storage_path = NULL; 259| 1.34k| config->storage_input_plugin = NULL; 260| 1.34k| config->storage_metrics = FLB_TRUE; ------------------ | | 26| 1.34k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 1.34k|#define FLB_FALSE 0 | | ------------------ ------------------ 261| | 262| 1.34k| config->sched_cap = FLB_SCHED_CAP; ------------------ | | 29| 1.34k|#define FLB_SCHED_CAP 2000 ------------------ 263| 1.34k| config->sched_base = FLB_SCHED_BASE; ------------------ | | 30| 1.34k|#define FLB_SCHED_BASE 5 ------------------ 264| | 265| 1.34k|#ifdef FLB_HAVE_SQLDB 266| 1.34k| mk_list_init(&config->sqldb_list); 267| 1.34k|#endif 268| | 269| |#ifdef FLB_HAVE_LUAJIT 270| | mk_list_init(&config->luajit_list); 271| |#endif 272| | 273| |#ifdef FLB_HAVE_STREAM_PROCESSOR 274| | flb_slist_create(&config->stream_processor_tasks); 275| |#endif 276| | 277| | /* Set default coroutines stack size */ 278| 1.34k| config->coro_stack_size = FLB_CORO_STACK_SIZE_BYTE; ------------------ | | 67| 1.34k|#define FLB_CORO_STACK_SIZE_BYTE ((3 * PTHREAD_STACK_MIN) / 2) ------------------ 279| 1.34k| if (config->coro_stack_size < getpagesize()) { ------------------ | Branch (279:9): [True: 0, False: 1.34k] ------------------ 280| 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 */ | | ------------------ ------------------ 281| 0| config->coro_stack_size, getpagesize()); 282| 0| config->coro_stack_size = (unsigned int)getpagesize(); 283| 0| } 284| | 285| | /* collectors */ 286| 1.34k| pthread_mutex_init(&config->collectors_mutex, NULL); 287| | 288| | /* Initialize linked lists */ 289| 1.34k| mk_list_init(&config->custom_plugins); 290| 1.34k| mk_list_init(&config->custom_plugins); 291| 1.34k| mk_list_init(&config->in_plugins); 292| 1.34k| mk_list_init(&config->parser_plugins); 293| 1.34k| mk_list_init(&config->filter_plugins); 294| 1.34k| mk_list_init(&config->out_plugins); 295| 1.34k| mk_list_init(&config->customs); 296| 1.34k| mk_list_init(&config->inputs); 297| 1.34k| mk_list_init(&config->parsers); 298| 1.34k| mk_list_init(&config->filters); 299| 1.34k| mk_list_init(&config->outputs); 300| 1.34k| mk_list_init(&config->proxies); 301| 1.34k| mk_list_init(&config->workers); 302| 1.34k| mk_list_init(&config->upstreams); 303| 1.34k| mk_list_init(&config->downstreams); 304| 1.34k| mk_list_init(&config->cmetrics); 305| 1.34k| mk_list_init(&config->cf_parsers_list); 306| | 307| 1.34k| memset(&config->tasks_map, '\0', sizeof(config->tasks_map)); 308| | 309| | /* Environment */ 310| 1.34k| config->env = flb_env_create(); 311| | 312| | /* Multiline core */ 313| 1.34k| mk_list_init(&config->multiline_parsers); 314| 1.34k| ret = flb_ml_init(config); 315| 1.34k| if (ret == -1) { ------------------ | Branch (315:9): [True: 0, False: 1.34k] ------------------ 316| 0| flb_error("[config] multiline core initialization failed"); ------------------ | | 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 | | ------------------ ------------------ 317| 0| flb_config_exit(config); 318| 0| return NULL; 319| 0| } 320| | 321| | /* Register static plugins */ 322| 1.34k| ret = flb_plugins_register(config); 323| 1.34k| if (ret == -1) { ------------------ | Branch (323:9): [True: 0, False: 1.34k] ------------------ 324| 0| flb_error("[config] plugins registration failed"); ------------------ | | 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 | | ------------------ ------------------ 325| 0| flb_config_exit(config); 326| 0| return NULL; 327| 0| } 328| | 329| | /* Create environment for dynamic plugins */ 330| 1.34k| config->dso_plugins = flb_plugin_create(); 331| | 332| | /* Ignoring SIGPIPE on Windows (scary) */ 333| 1.34k|#ifndef _WIN32 334| | /* Ignore SIGPIPE */ 335| 1.34k| signal(SIGPIPE, SIG_IGN); 336| 1.34k|#endif 337| | 338| | /* Prepare worker interface */ 339| 1.34k| flb_worker_init(config); 340| | 341| 1.34k|#ifdef FLB_HAVE_REGEX 342| | /* Regex support */ 343| 1.34k| flb_regex_init(); 344| 1.34k|#endif 345| | 346| 1.34k| return config; 347| 1.34k|} flb_config_exit: 350| 1.34k|{ 351| 1.34k| struct mk_list *tmp; 352| 1.34k| struct mk_list *head; 353| 1.34k| struct flb_cf *cf; 354| | 355| 1.34k| if (config->log_file) { ------------------ | Branch (355:9): [True: 0, False: 1.34k] ------------------ 356| 0| flb_free(config->log_file); 357| 0| } 358| | 359| 1.34k| if (config->log) { ------------------ | Branch (359:9): [True: 0, False: 1.34k] ------------------ 360| 0| flb_log_destroy(config->log, config); 361| 0| } 362| | 363| 1.34k| if (config->parsers_file) { ------------------ | Branch (363:9): [True: 0, False: 1.34k] ------------------ 364| 0| flb_free(config->parsers_file); 365| 0| } 366| | 367| 1.34k| if (config->plugins_file) { ------------------ | Branch (367:9): [True: 0, False: 1.34k] ------------------ 368| 0| flb_free(config->plugins_file); 369| 0| } 370| | 371| 1.34k| if (config->kernel) { ------------------ | Branch (371:9): [True: 1.34k, False: 0] ------------------ 372| 1.34k| flb_free(config->kernel->s_version.data); 373| 1.34k| flb_free(config->kernel); 374| 1.34k| } 375| | 376| | /* release resources */ 377| 1.34k| if (config->ch_event.fd) { ------------------ | Branch (377:9): [True: 1.34k, False: 0] ------------------ 378| 1.34k| mk_event_closesocket(config->ch_event.fd); ------------------ | | 86| 1.34k| #define mk_event_closesocket(s) close(s) ------------------ 379| 1.34k| } 380| | 381| | /* Pipe */ 382| 1.34k| if (config->ch_data[0]) { ------------------ | Branch (382:9): [True: 0, False: 1.34k] ------------------ 383| 0| mk_event_closesocket(config->ch_data[0]); ------------------ | | 86| 0| #define mk_event_closesocket(s) close(s) ------------------ 384| 0| mk_event_closesocket(config->ch_data[1]); ------------------ | | 86| 0| #define mk_event_closesocket(s) close(s) ------------------ 385| 0| } 386| | 387| | /* Channel manager */ 388| 1.34k| if (config->ch_manager[0] > 0) { ------------------ | Branch (388:9): [True: 0, False: 1.34k] ------------------ 389| 0| mk_event_closesocket(config->ch_manager[0]); ------------------ | | 86| 0| #define mk_event_closesocket(s) close(s) ------------------ 390| 0| if (config->ch_manager[0] != config->ch_manager[1]) { ------------------ | Branch (390:13): [True: 0, False: 0] ------------------ 391| 0| mk_event_closesocket(config->ch_manager[1]); ------------------ | | 86| 0| #define mk_event_closesocket(s) close(s) ------------------ 392| 0| } 393| 0| } 394| | 395| | /* Channel notifications */ 396| 1.34k| if (config->ch_notif[0] > 0) { ------------------ | Branch (396:9): [True: 0, False: 1.34k] ------------------ 397| 0| mk_event_closesocket(config->ch_notif[0]); ------------------ | | 86| 0| #define mk_event_closesocket(s) close(s) ------------------ 398| 0| if (config->ch_notif[0] != config->ch_notif[1]) { ------------------ | Branch (398:13): [True: 0, False: 0] ------------------ 399| 0| mk_event_closesocket(config->ch_notif[1]); ------------------ | | 86| 0| #define mk_event_closesocket(s) close(s) ------------------ 400| 0| } 401| 0| } 402| | 403| 1.34k| if (config->env) { ------------------ | Branch (403:9): [True: 1.34k, False: 0] ------------------ 404| 1.34k| flb_env_destroy(config->env); 405| 1.34k| } 406| | 407| | /* Program name */ 408| 1.34k| if (config->program_name) { ------------------ | Branch (408:9): [True: 0, False: 1.34k] ------------------ 409| 0| flb_sds_destroy(config->program_name); 410| 0| } 411| | 412| | /* Conf path */ 413| 1.34k| if (config->conf_path) { ------------------ | Branch (413:9): [True: 0, False: 1.34k] ------------------ 414| 0| flb_free(config->conf_path); 415| 0| } 416| | 417| | /* Working directory */ 418| 1.34k| if (config->workdir) { ------------------ | Branch (418:9): [True: 0, False: 1.34k] ------------------ 419| 0| flb_free(config->workdir); 420| 0| } 421| | 422| | /* Destroy any DSO context */ 423| 1.34k| if (config->dso_plugins) { ------------------ | Branch (423:9): [True: 1.34k, False: 0] ------------------ 424| 1.34k| flb_plugin_destroy(config->dso_plugins); 425| 1.34k| } 426| | 427| | /* Workers */ 428| 1.34k| flb_worker_exit(config); 429| | 430| | /* Event flush */ 431| 1.34k| if (config->evl) { ------------------ | Branch (431:9): [True: 0, False: 1.34k] ------------------ 432| 0| if (config->event_flush.status != MK_EVENT_NONE) { ------------------ | | 52| 0|#define MK_EVENT_NONE 1 /* nothing */ ------------------ | Branch (432:13): [True: 0, False: 0] ------------------ 433| 0| mk_event_timeout_destroy(config->evl, &config->event_flush); 434| 0| } 435| 0| } 436| | 437| | /* Release scheduler */ 438| 1.34k| if (config->sched) { ------------------ | Branch (438:9): [True: 0, False: 1.34k] ------------------ 439| 0| flb_sched_destroy(config->sched); 440| 0| } 441| | 442| 1.34k|#ifdef FLB_HAVE_HTTP_SERVER 443| 1.34k| if (config->http_listen) { ------------------ | Branch (443:9): [True: 1.34k, False: 0] ------------------ 444| 1.34k| flb_free(config->http_listen); 445| 1.34k| } 446| | 447| 1.34k| if (config->http_port) { ------------------ | Branch (447:9): [True: 1.34k, False: 0] ------------------ 448| 1.34k| flb_free(config->http_port); 449| 1.34k| } 450| 1.34k|#endif 451| | 452| 1.34k|#ifdef FLB_HAVE_PARSER 453| | /* parsers */ 454| 1.34k| flb_parser_exit(config); 455| 1.34k|#endif 456| | 457| 1.34k| if (config->dns_mode) { ------------------ | Branch (457:9): [True: 0, False: 1.34k] ------------------ 458| 0| flb_free(config->dns_mode); 459| 0| } 460| 1.34k| if (config->dns_resolver) { ------------------ | Branch (460:9): [True: 0, False: 1.34k] ------------------ 461| 0| flb_free(config->dns_resolver); 462| 0| } 463| | 464| 1.34k| if (config->storage_path) { ------------------ | Branch (464:9): [True: 0, False: 1.34k] ------------------ 465| 0| flb_free(config->storage_path); 466| 0| } 467| 1.34k| if (config->storage_sync) { ------------------ | Branch (467:9): [True: 0, False: 1.34k] ------------------ 468| 0| flb_free(config->storage_sync); 469| 0| } 470| 1.34k| if (config->storage_bl_mem_limit) { ------------------ | Branch (470:9): [True: 0, False: 1.34k] ------------------ 471| 0| flb_free(config->storage_bl_mem_limit); 472| 0| } 473| | 474| |#ifdef FLB_HAVE_STREAM_PROCESSOR 475| | if (config->stream_processor_file) { 476| | flb_free(config->stream_processor_file); 477| | } 478| | 479| | flb_slist_destroy(&config->stream_processor_tasks); 480| |#endif 481| | 482| 1.34k| if (config->evl) { ------------------ | Branch (482:9): [True: 0, False: 1.34k] ------------------ 483| 0| mk_event_loop_destroy(config->evl); 484| 0| } 485| 1.34k| if (config->evl_bktq) { ------------------ | Branch (485:9): [True: 0, False: 1.34k] ------------------ 486| 0| flb_bucket_queue_destroy(config->evl_bktq); 487| 0| } 488| | 489| 1.34k| flb_plugins_unregister(config); 490| | 491| 1.34k| if (config->cf_main) { ------------------ | Branch (491:9): [True: 1.34k, False: 0] ------------------ 492| 1.34k| flb_cf_destroy(config->cf_main); 493| 1.34k| } 494| | 495| | /* remove parsers */ 496| 1.34k| mk_list_foreach_safe(head, tmp, &config->cf_parsers_list) { ------------------ | | 207| 1.34k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 0, False: 1.34k] | | ------------------ ------------------ 497| 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) );}) | | ------------------ ------------------ 498| 0| mk_list_del(&cf->_head); 499| 0| flb_cf_destroy(cf); 500| 0| } 501| | 502| 1.34k| flb_free(config); 503| 1.34k|} flb_env_create: 70| 1.34k|{ 71| 1.34k| struct flb_env *env; 72| 1.34k| struct flb_hash_table *ht; 73| | 74| 1.34k| env = flb_malloc(sizeof(struct flb_env)); 75| 1.34k| if (!env) { ------------------ | Branch (75:9): [True: 0, False: 1.34k] ------------------ 76| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 77| 0| return NULL; 78| 0| } 79| | 80| | /* Create the hash-table */ 81| 1.34k| ht = flb_hash_table_create(FLB_HASH_TABLE_EVICT_NONE, FLB_ENV_SIZE, -1); ------------------ | | 32| 1.34k|#define FLB_HASH_TABLE_EVICT_NONE 0 ------------------ ht = flb_hash_table_create(FLB_HASH_TABLE_EVICT_NONE, FLB_ENV_SIZE, -1); ------------------ | | 26| 1.34k|#define FLB_ENV_SIZE 64 ------------------ 82| 1.34k| if (!ht) { ------------------ | Branch (82:9): [True: 0, False: 1.34k] ------------------ 83| 0| flb_free(env); 84| 0| return NULL; 85| 0| } 86| | 87| 1.34k| env->warn_unused = FLB_TRUE; ------------------ | | 26| 1.34k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 1.34k|#define FLB_FALSE 0 | | ------------------ ------------------ 88| 1.34k| env->ht = ht; 89| 1.34k| env_preset(env); 90| | 91| 1.34k| return env; 92| 1.34k|} flb_env_destroy: 95| 1.34k|{ 96| 1.34k| flb_hash_table_destroy(env->ht); 97| 1.34k| flb_free(env); 98| 1.34k|} flb_env.c:env_preset: 43| 1.34k|{ 44| 1.34k| int ret; 45| 1.34k| char *buf; 46| 1.34k| 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| 1.34k| buf = getenv("HOSTNAME"); 59| 1.34k| if (!buf) { ------------------ | Branch (59:9): [True: 0, False: 1.34k] ------------------ 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| 1.34k| return 0; 67| 1.34k|} flb_hash_table_create: 43| 1.34k|{ 44| 1.34k| int i; 45| 1.34k| struct flb_hash_table_chain *tmp; 46| 1.34k| struct flb_hash_table *ht; 47| | 48| 1.34k| if (size <= 0) { ------------------ | Branch (48:9): [True: 0, False: 1.34k] ------------------ 49| 0| return NULL; 50| 0| } 51| | 52| 1.34k| ht = flb_malloc(sizeof(struct flb_hash_table)); 53| 1.34k| if (!ht) { ------------------ | Branch (53:9): [True: 0, False: 1.34k] ------------------ 54| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 55| 0| return NULL; 56| 0| } 57| | 58| 1.34k| mk_list_init(&ht->entries); 59| 1.34k| ht->evict_mode = evict_mode; 60| 1.34k| ht->max_entries = max_entries; 61| 1.34k| ht->size = size; 62| 1.34k| ht->total_count = 0; 63| 1.34k| ht->cache_ttl = 0; 64| 1.34k| ht->table = flb_calloc(1, sizeof(struct flb_hash_table_chain) * size); 65| 1.34k| if (!ht->table) { ------------------ | Branch (65:9): [True: 0, False: 1.34k] ------------------ 66| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 67| 0| flb_free(ht); 68| 0| return NULL; 69| 0| } 70| | 71| | /* Initialize chains list head */ 72| 87.6k| for (i = 0; i < size; i++) { ------------------ | Branch (72:17): [True: 86.2k, False: 1.34k] ------------------ 73| 86.2k| tmp = &ht->table[i]; 74| 86.2k| tmp->count = 0; 75| 86.2k| mk_list_init(&tmp->chains); 76| 86.2k| } 77| | 78| 1.34k| return ht; 79| 1.34k|} flb_hash_table_destroy: 131| 1.34k|{ 132| 1.34k| int i; 133| 1.34k| struct mk_list *tmp; 134| 1.34k| struct mk_list *head; 135| 1.34k| struct flb_hash_table_entry *entry; 136| 1.34k| struct flb_hash_table_chain *table; 137| | 138| 87.6k| for (i = 0; i < ht->size; i++) { ------------------ | Branch (138:17): [True: 86.2k, False: 1.34k] ------------------ 139| 86.2k| table = &ht->table[i]; 140| 86.2k| mk_list_foreach_safe(head, tmp, &table->chains) { ------------------ | | 207| 86.2k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 0, False: 86.2k] | | ------------------ ------------------ 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| 86.2k| } 145| | 146| 1.34k| flb_free(ht->table); 147| 1.34k| flb_free(ht); 148| 1.34k|} flb_kernel_info: 70| 1.34k|{ 71| | 72| 1.34k| int a, b, c; 73| 1.34k| int len; 74| 1.34k| int pos; 75| 1.34k| char *p, *t; 76| 1.34k| char *tmp; 77| 1.34k| struct utsname uts; 78| 1.34k| struct flb_kernel *kernel; 79| | 80| 1.34k| if (uname(&uts) == -1) { ------------------ | Branch (80:9): [True: 0, False: 1.34k] ------------------ 81| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 82| 0| return NULL; 83| 0| } 84| 1.34k| len = strlen(uts.release); 85| | 86| | /* Fixme: this don't support Linux Kernel 10.x.x :P */ 87| 1.34k| a = (*uts.release - '0'); 88| | 89| | /* Second number */ 90| 1.34k| p = (uts.release) + 2; 91| 1.34k| pos = mk_string_char_search(p, '.', len - 2); 92| 1.34k| if (pos <= 0) { ------------------ | Branch (92:9): [True: 0, False: 1.34k] ------------------ 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| 1.34k| tmp = mk_string_copy_substr(p, 0, pos); 101| 1.34k| if (!tmp) { ------------------ | Branch (101:9): [True: 0, False: 1.34k] ------------------ 102| 0| return NULL; 103| 0| } 104| 1.34k| b = atoi(tmp); 105| 1.34k| mk_mem_free(tmp); 106| | 107| | /* Last number (it needs filtering) */ 108| 1.34k| t = p = p + pos + 1; 109| 1.34k| do { 110| 1.34k| t++; 111| 1.34k| } while (isdigit(*t)); 112| | 113| 1.34k| tmp = mk_string_copy_substr(p, 0, t - p); 114| 1.34k| if (!tmp) { ------------------ | Branch (114:9): [True: 0, False: 1.34k] ------------------ 115| 0| return NULL; 116| 0| } 117| 1.34k| c = atoi(tmp); 118| 1.34k| mk_mem_free(tmp); 119| | 120| 1.34k| kernel = flb_malloc(sizeof(struct flb_kernel)); 121| 1.34k| if (!kernel) { ------------------ | Branch (121:9): [True: 0, False: 1.34k] ------------------ 122| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 123| 0| return NULL; 124| 0| } 125| 1.34k| kernel->minor = a; 126| 1.34k| kernel->major = b; 127| 1.34k| kernel->patch = c; 128| 1.34k| kernel->s_version.data = flb_malloc(16); 129| | 130| 1.34k| if (!kernel->s_version.data) { ------------------ | Branch (130:9): [True: 0, False: 1.34k] ------------------ 131| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 132| 0| flb_free(kernel); 133| 0| return NULL; 134| 0| } 135| | 136| 1.34k| len = snprintf(kernel->s_version.data, 16, "%i.%i.%i", a, b, c); 137| 1.34k| if (len == -1) { ------------------ | Branch (137:9): [True: 0, False: 1.34k] ------------------ 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| 1.34k| kernel->s_version.len = len; 144| 1.34k| kernel->n_version = FLB_KERNEL_VERSION(a, b, c); ------------------ | | 27| 1.34k|#define FLB_KERNEL_VERSION(a, b, c) (((a) << 16) + ((b) << 8) + (c)) ------------------ 145| | 146| 1.34k| return kernel; 147| 1.34k|} flb_kv_release: 94| 2.69k|{ 95| 2.69k| struct mk_list *tmp; 96| 2.69k| struct mk_list *head; 97| 2.69k| struct flb_kv *kv; 98| | 99| 2.69k| mk_list_foreach_safe(head, tmp, list) { ------------------ | | 207| 2.69k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 0, False: 2.69k] | | ------------------ ------------------ 100| 0| kv = mk_list_entry(head, struct flb_kv, _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) );}) | | ------------------ ------------------ 101| 0| flb_kv_item_destroy(kv); 102| 0| } 103| 2.69k|} flb_log_construct: 497| 409|{ 498| 409| int body_size; 499| 409| int ret; 500| 409| int len; 501| 409| int total; 502| 409| time_t now; 503| 409| const char *header_color = NULL; 504| 409| const char *header_title = NULL; 505| 409| const char *bold_color = ANSI_BOLD; ------------------ | | 47| 409|#define ANSI_BOLD "\033[1m" ------------------ 506| 409| const char *reset_color = ANSI_RESET; ------------------ | | 46| 409|#define ANSI_RESET "\033[0m" ------------------ 507| 409| struct tm result; 508| 409| struct tm *current; 509| | 510| 409| switch (type) { ------------------ | Branch (510:13): [True: 0, False: 409] ------------------ 511| 0| case FLB_LOG_HELP: ------------------ | | 44| 0|#define FLB_LOG_HELP 6 /* unused by log level */ ------------------ | Branch (511:5): [True: 0, False: 409] ------------------ 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: 409] ------------------ 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: 409] ------------------ 520| 0| header_title = "warn"; 521| 0| header_color = ANSI_YELLOW; ------------------ | | 51| 0|#define ANSI_YELLOW "\033[93m" ------------------ 522| 0| break; 523| 409| case FLB_LOG_ERROR: ------------------ | | 39| 409|#define FLB_LOG_ERROR 1 ------------------ | Branch (523:5): [True: 409, False: 0] ------------------ 524| 409| header_title = "error"; 525| 409| header_color = ANSI_RED; ------------------ | | 50| 409|#define ANSI_RED "\033[91m" ------------------ 526| 409| break; 527| 0| case FLB_LOG_DEBUG: ------------------ | | 42| 0|#define FLB_LOG_DEBUG 4 ------------------ | Branch (527:5): [True: 0, False: 409] ------------------ 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: 409] ------------------ 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: 409] ------------------ 536| 0| header_title = "trace"; 537| 0| header_color = ANSI_BLUE; ------------------ | | 52| 0|#define ANSI_BLUE "\033[94m" ------------------ 538| 0| break; 539| 409| } 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| 409| if (!isatty(STDOUT_FILENO)) { ------------------ | Branch (547:9): [True: 409, False: 0] ------------------ 548| 409| header_color = ""; 549| 409| bold_color = ""; 550| 409| reset_color = ""; 551| 409| } 552| 409| #endif // FLB_LOG_NO_CONTROL_CHARS 553| | 554| 409| now = time(NULL); 555| 409| current = localtime_r(&now, &result); 556| | 557| 409| if (current == NULL) { ------------------ | Branch (557:9): [True: 0, False: 409] ------------------ 558| 0| return -1; 559| 0| } 560| | 561| 409| len = snprintf(msg->msg, sizeof(msg->msg) - 1, 562| 409| "%s[%s%i/%02i/%02i %02i:%02i:%02i%s]%s [%s%5s%s] ", 563| | /* time */ /* type */ 564| | 565| | /* time variables */ 566| 409| bold_color, reset_color, 567| 409| current->tm_year + 1900, 568| 409| current->tm_mon + 1, 569| 409| current->tm_mday, 570| 409| current->tm_hour, 571| 409| current->tm_min, 572| 409| current->tm_sec, 573| 409| bold_color, reset_color, 574| | 575| | /* type format */ 576| 409| header_color, header_title, reset_color); 577| | 578| 409| body_size = (sizeof(msg->msg) - 2) - len; 579| 409| total = vsnprintf(msg->msg + len, 580| 409| body_size, 581| 409| fmt, *args); 582| 409| if (total < 0) { ------------------ | Branch (582:9): [True: 0, False: 409] ------------------ 583| 0| return -1; 584| 0| } 585| 409| ret = total; /* ret means a buffer size need to save log body */ 586| | 587| 409| total = strlen(msg->msg + len) + len; 588| 409| msg->msg[total++] = '\n'; 589| 409| msg->msg[total] = '\0'; 590| 409| msg->size = total; 591| | 592| 409| *ret_len = len; 593| | 594| 409| if (ret >= body_size) { ------------------ | Branch (594:9): [True: 0, False: 409] ------------------ 595| | /* log is truncated */ 596| 0| return ret - body_size; 597| 0| } 598| | 599| 409| return 0; 600| 409|} flb_log_print: 629| 409|{ 630| 409| int n; 631| 409| int len; 632| 409| int ret; 633| 409| struct log_message msg = {0}; 634| 409| va_list args; 635| | 636| 409| struct flb_worker *w; 637| | 638| 409| va_start(args, fmt); 639| 409| ret = flb_log_construct(&msg, &len, type, file, line, fmt, &args); 640| 409| va_end(args); 641| | 642| 409| if (ret < 0) { ------------------ | Branch (642:9): [True: 0, False: 409] ------------------ 643| 0| return; 644| 0| } 645| | 646| 409| w = flb_worker_get(); 647| 409| if (w) { ------------------ | Branch (647:9): [True: 0, False: 409] ------------------ 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| 409| else { 655| 409| fprintf(stderr, "%s", (char *) msg.msg); 656| 409| } 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| 409|} flb_errno_print: 670| 31|{ 671| 31| char buf[256]; 672| | 673| 31| strerror_r(errnum, buf, sizeof(buf) - 1); 674| 31| flb_error("[%s:%i errno=%i] %s", file, line, errnum, buf); ------------------ | | 140| 31| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 31|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 31, False: 0] | | ------------------ | | 141| 31| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 31|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 675| 31| return 0; 676| 31|} flb_parser_create: 160| 4.04k|{ 161| 4.04k| int ret; 162| 4.04k| int len; 163| 4.04k| int diff = 0; 164| 4.04k| int size; 165| 4.04k| int is_epoch = FLB_FALSE; ------------------ | | 25| 4.04k|#define FLB_FALSE 0 ------------------ 166| 4.04k| char *tmp; 167| 4.04k| char *timeptr; 168| 4.04k| struct mk_list *head; 169| 4.04k| struct flb_parser *p; 170| 4.04k| struct flb_regex *regex; 171| | 172| | /* Iterate current parsers and make sure the new one don't exists */ 173| 4.04k| mk_list_foreach(head, &config->parsers) { ------------------ | | 205| 8.08k|#define mk_list_foreach(curr, head) for( curr = (head)->next; curr != (head); curr = curr->next ) | | ------------------ | | | Branch (205:63): [True: 4.04k, False: 4.04k] | | ------------------ ------------------ 174| 4.04k| p = mk_list_entry(head, struct flb_parser, _head); ------------------ | | 214| 4.04k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 4.04k|#define container_of(ptr, type, member) ({ \ | | | | 39| 4.04k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 4.04k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 175| 4.04k| if (p->name && strcmp(p->name, name) == 0) { ------------------ | Branch (175:13): [True: 4.04k, False: 0] | Branch (175:24): [True: 0, False: 4.04k] ------------------ 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| 4.04k| } 181| | 182| | /* Allocate context */ 183| 4.04k| p = flb_calloc(1, sizeof(struct flb_parser)); 184| 4.04k| if (!p) { ------------------ | Branch (184:9): [True: 0, False: 4.04k] ------------------ 185| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 186| 0| return NULL; 187| 0| } 188| 4.04k| p->decoders = decoders; 189| 4.04k| mk_list_add(&p->_head, &config->parsers); 190| | 191| | /* Format lookup */ 192| 4.04k| if (strcasecmp(format, "regex") == 0) { ------------------ | Branch (192:9): [True: 1.34k, False: 2.69k] ------------------ 193| 1.34k| p->type = FLB_PARSER_REGEX; ------------------ | | 30| 1.34k|#define FLB_PARSER_REGEX 1 ------------------ 194| 1.34k| } 195| 2.69k| else if (strcasecmp(format, "json") == 0) { ------------------ | Branch (195:14): [True: 1.34k, False: 1.34k] ------------------ 196| 1.34k| p->type = FLB_PARSER_JSON; ------------------ | | 31| 1.34k|#define FLB_PARSER_JSON 2 ------------------ 197| 1.34k| } 198| 1.34k| else if (strcasecmp(format, "ltsv") == 0) { ------------------ | Branch (198:14): [True: 0, False: 1.34k] ------------------ 199| 0| p->type = FLB_PARSER_LTSV; ------------------ | | 32| 0|#define FLB_PARSER_LTSV 3 ------------------ 200| 0| } 201| 1.34k| else if (strcasecmp(format, "logfmt") == 0) { ------------------ | Branch (201:14): [True: 1.34k, False: 0] ------------------ 202| 1.34k| p->type = FLB_PARSER_LOGFMT; ------------------ | | 33| 1.34k|#define FLB_PARSER_LOGFMT 4 ------------------ 203| 1.34k| } 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.04k| if (p->type == FLB_PARSER_REGEX) { ------------------ | | 30| 4.04k|#define FLB_PARSER_REGEX 1 ------------------ | Branch (211:9): [True: 1.34k, False: 2.69k] ------------------ 212| 1.34k| if (!p_regex) { ------------------ | Branch (212:13): [True: 0, False: 1.34k] ------------------ 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| 1.34k| regex = flb_regex_create(p_regex); 220| 1.34k| if (!regex) { ------------------ | Branch (220:13): [True: 0, False: 1.34k] ------------------ 221| 0| flb_error("[parser:%s] Invalid regex pattern %s", name, p_regex); ------------------ | | 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 | | ------------------ ------------------ 222| 0| mk_list_del(&p->_head); 223| 0| flb_free(p); 224| 0| return NULL; 225| 0| } 226| 1.34k| p->regex = regex; 227| 1.34k| p->skip_empty = skip_empty; 228| 1.34k| p->p_regex = flb_strdup(p_regex); 229| 1.34k| } 230| | 231| 4.04k| p->name = flb_strdup(name); 232| | 233| 4.04k| if (time_fmt) { ------------------ | Branch (233:9): [True: 2.69k, False: 1.34k] ------------------ 234| 2.69k| p->time_fmt_full = flb_strdup(time_fmt); 235| 2.69k| if (!p->time_fmt_full) { ------------------ | Branch (235:13): [True: 0, False: 2.69k] ------------------ 236| 0| flb_error("[parser:%s] could not duplicate time fmt full", 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 | | ------------------ ------------------ 237| 0| flb_interim_parser_destroy(p); 238| 0| return NULL; 239| 0| } 240| 2.69k| p->time_fmt = flb_strdup(time_fmt); 241| 2.69k| if (!p->time_fmt) { ------------------ | Branch (241:13): [True: 0, False: 2.69k] ------------------ 242| 0| flb_error("[parser:%s] could not duplicate time fmt", 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 | | ------------------ ------------------ 243| 0| flb_interim_parser_destroy(p); 244| 0| return NULL; 245| 0| } 246| | 247| | /* Check if the format is considering the year */ 248| 2.69k| if (strstr(p->time_fmt, "%Y") || strstr(p->time_fmt, "%y")) { ------------------ | Branch (248:13): [True: 2.69k, False: 0] | Branch (248:42): [True: 0, False: 0] ------------------ 249| 2.69k| p->time_with_year = FLB_TRUE; ------------------ | | 26| 2.69k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 2.69k|#define FLB_FALSE 0 | | ------------------ ------------------ 250| 2.69k| } 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| 2.69k| if (strstr(p->time_fmt, "%z") || strstr(p->time_fmt, "%Z") || ------------------ | Branch (277:13): [True: 1.34k, False: 1.34k] | Branch (277:42): [True: 0, False: 1.34k] ------------------ 278| 2.69k| strstr(p->time_fmt, "%SZ") || strstr(p->time_fmt, "%S.%LZ")) { ------------------ | Branch (278:13): [True: 0, False: 1.34k] | Branch (278:43): [True: 0, False: 1.34k] ------------------ 279| 1.34k|#if defined(FLB_HAVE_GMTOFF) || !defined(FLB_HAVE_SYSTEM_STRPTIME) 280| 1.34k| p->time_with_tz = FLB_TRUE; ------------------ | | 26| 1.34k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 1.34k|#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| 1.34k| } 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| 2.69k| if (is_epoch == FLB_TRUE || p->time_with_year == FLB_TRUE) { ------------------ | | 26| 5.39k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 5.39k|#define FLB_FALSE 0 | | ------------------ ------------------ if (is_epoch == FLB_TRUE || p->time_with_year == FLB_TRUE) { ------------------ | | 26| 2.69k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 2.69k|#define FLB_FALSE 0 | | ------------------ ------------------ | Branch (301:13): [True: 0, False: 2.69k] | Branch (301:37): [True: 2.69k, False: 0] ------------------ 302| 2.69k| timeptr = p->time_fmt; 303| 2.69k| } 304| 0| else { 305| 0| timeptr = p->time_fmt_year; 306| 0| } 307| | 308| 2.69k| tmp = strstr(timeptr, "%L"); 309| 2.69k| if (tmp) { ------------------ | Branch (309:13): [True: 2.69k, False: 0] ------------------ 310| 2.69k| tmp[0] = '\0'; 311| 2.69k| tmp[1] = '\0'; 312| 2.69k| p->time_frac_secs = (tmp + 2); 313| 2.69k| } 314| | 315| | /* Optional fixed timezone offset */ 316| 2.69k| if (time_offset) { ------------------ | Branch (316:13): [True: 0, False: 2.69k] ------------------ 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| 2.69k| } 327| | 328| 4.04k| if (time_key) { ------------------ | Branch (328:9): [True: 2.69k, False: 1.34k] ------------------ 329| 2.69k| p->time_key = flb_strdup(time_key); 330| 2.69k| } 331| | 332| 4.04k| p->time_keep = time_keep; 333| 4.04k| p->time_strict = time_strict; 334| 4.04k| p->logfmt_no_bare_keys = logfmt_no_bare_keys; 335| 4.04k| p->types = types; 336| 4.04k| p->types_len = types_len; 337| 4.04k| return p; 338| 4.04k|} flb_parser_destroy: 341| 4.04k|{ 342| 4.04k| int i = 0; 343| | 344| 4.04k| if (parser->type == FLB_PARSER_REGEX) { ------------------ | | 30| 4.04k|#define FLB_PARSER_REGEX 1 ------------------ | Branch (344:9): [True: 1.34k, False: 2.69k] ------------------ 345| 1.34k| flb_regex_destroy(parser->regex); 346| 1.34k| flb_free(parser->p_regex); 347| 1.34k| } 348| | 349| 4.04k| flb_free(parser->name); 350| 4.04k| if (parser->time_fmt) { ------------------ | Branch (350:9): [True: 2.69k, False: 1.34k] ------------------ 351| 2.69k| flb_free(parser->time_fmt); 352| 2.69k| flb_free(parser->time_fmt_full); 353| 2.69k| } 354| 4.04k| if (parser->time_fmt_year) { ------------------ | Branch (354:9): [True: 0, False: 4.04k] ------------------ 355| 0| flb_free(parser->time_fmt_year); 356| 0| } 357| 4.04k| if (parser->time_key) { ------------------ | Branch (357:9): [True: 2.69k, False: 1.34k] ------------------ 358| 2.69k| flb_free(parser->time_key); 359| 2.69k| } 360| 4.04k| if (parser->types_len != 0) { ------------------ | Branch (360:9): [True: 0, False: 4.04k] ------------------ 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.04k| if (parser->decoders) { ------------------ | Branch (367:9): [True: 0, False: 4.04k] ------------------ 368| 0| flb_parser_decoder_list_destroy(parser->decoders); 369| 0| } 370| | 371| 4.04k| mk_list_del(&parser->_head); 372| 4.04k| flb_free(parser); 373| 4.04k|} flb_parser_exit: 376| 1.34k|{ 377| 1.34k| struct mk_list *tmp; 378| 1.34k| struct mk_list *head; 379| 1.34k| struct flb_parser *parser; 380| | 381| | /* release 'parsers' */ 382| 2.69k| mk_list_foreach_safe(head, tmp, &config->parsers) { ------------------ | | 207| 4.04k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 2.69k, False: 1.34k] | | ------------------ ------------------ 383| 2.69k| parser = mk_list_entry(head, struct flb_parser, _head); ------------------ | | 214| 2.69k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 2.69k|#define container_of(ptr, type, member) ({ \ | | | | 39| 2.69k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 2.69k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 384| 2.69k| flb_parser_destroy(parser); 385| 2.69k| } 386| | 387| | /* release 'multiline parsers' */ 388| 1.34k| flb_ml_exit(config); 389| 1.34k|} flb_parser_do: 955| 1.34k|{ 956| | 957| 1.34k| if (parser->type == FLB_PARSER_REGEX) { ------------------ | | 30| 1.34k|#define FLB_PARSER_REGEX 1 ------------------ | Branch (957:9): [True: 0, False: 1.34k] ------------------ 958| 0| return flb_parser_regex_do(parser, buf, length, 959| 0| out_buf, out_size, out_time); 960| 0| } 961| 1.34k| else if (parser->type == FLB_PARSER_JSON) { ------------------ | | 31| 1.34k|#define FLB_PARSER_JSON 2 ------------------ | Branch (961:14): [True: 0, False: 1.34k] ------------------ 962| 0| return flb_parser_json_do(parser, buf, length, 963| 0| out_buf, out_size, out_time); 964| 0| } 965| 1.34k| else if (parser->type == FLB_PARSER_LTSV) { ------------------ | | 32| 1.34k|#define FLB_PARSER_LTSV 3 ------------------ | Branch (965:14): [True: 0, False: 1.34k] ------------------ 966| 0| return flb_parser_ltsv_do(parser, buf, length, 967| 0| out_buf, out_size, out_time); 968| 0| } 969| 1.34k| else if (parser->type == FLB_PARSER_LOGFMT) { ------------------ | | 33| 1.34k|#define FLB_PARSER_LOGFMT 4 ------------------ | Branch (969:14): [True: 1.34k, False: 0] ------------------ 970| 1.34k| return flb_parser_logfmt_do(parser, buf, length, 971| 1.34k| out_buf, out_size, out_time); 972| 1.34k| } 973| | 974| 0| return -1; 975| 1.34k|} flb_parser_logfmt_do: 260| 1.34k|{ 261| 1.34k| int ret; 262| 1.34k| time_t time_lookup; 263| 1.34k| double tmfrac = 0; 264| 1.34k| struct flb_time *t; 265| 1.34k| msgpack_sbuffer tmp_sbuf; 266| 1.34k| msgpack_packer tmp_pck; 267| 1.34k| char *dec_out_buf; 268| 1.34k| size_t dec_out_size; 269| 1.34k| size_t map_size; 270| 1.34k| char *time_key; 271| 1.34k| size_t time_key_len; 272| 1.34k| int last_byte; 273| | 274| 1.34k| if (parser->time_key) { ------------------ | Branch (274:9): [True: 0, False: 1.34k] ------------------ 275| 0| time_key = parser->time_key; 276| 0| } 277| 1.34k| else { 278| 1.34k| time_key = "time"; 279| 1.34k| } 280| 1.34k| time_key_len = strlen(time_key); 281| 1.34k| time_lookup = 0; 282| | 283| | /* count the number of key value pairs */ 284| 1.34k| map_size = 0; 285| 1.34k| logfmt_parser(parser, in_buf, in_size, NULL, 286| 1.34k| time_key, time_key_len, 287| 1.34k| &time_lookup, &tmfrac, &map_size); 288| 1.34k| if (map_size == 0) { ------------------ | Branch (288:9): [True: 2, False: 1.34k] ------------------ 289| 2| return -1; 290| 2| } 291| | 292| | /* Prepare new outgoing buffer */ 293| 1.34k| msgpack_sbuffer_init(&tmp_sbuf); 294| 1.34k| msgpack_packer_init(&tmp_pck, &tmp_sbuf, msgpack_sbuffer_write); 295| 1.34k| msgpack_pack_map(&tmp_pck, map_size); 296| | 297| 1.34k| last_byte = logfmt_parser(parser, in_buf, in_size, &tmp_pck, 298| 1.34k| time_key, time_key_len, 299| 1.34k| &time_lookup, &tmfrac, &map_size); 300| 1.34k| if (last_byte < 0) { ------------------ | Branch (300:9): [True: 31, False: 1.31k] ------------------ 301| 31| msgpack_sbuffer_destroy(&tmp_sbuf); 302| 31| return last_byte; 303| 31| } 304| | 305| | /* Export results */ 306| 1.31k| *out_buf = tmp_sbuf.data; 307| 1.31k| *out_size = tmp_sbuf.size; 308| | 309| 1.31k| t = out_time; 310| 1.31k| t->tm.tv_sec = time_lookup; 311| 1.31k| t->tm.tv_nsec = (tmfrac * 1000000000); 312| | 313| | /* Check if some decoder was specified */ 314| 1.31k| if (parser->decoders) { ------------------ | Branch (314:9): [True: 0, False: 1.31k] ------------------ 315| 0| ret = flb_parser_decoder_do(parser->decoders, 316| 0| tmp_sbuf.data, tmp_sbuf.size, 317| 0| &dec_out_buf, &dec_out_size); 318| 0| if (ret == 0) { ------------------ | Branch (318:13): [True: 0, False: 0] ------------------ 319| 0| *out_buf = dec_out_buf; 320| 0| *out_size = dec_out_size; 321| 0| msgpack_sbuffer_destroy(&tmp_sbuf); 322| 0| } 323| 0| } 324| | 325| 1.31k| return last_byte; 326| 1.34k|} flb_parser_logfmt.c:logfmt_parser: 69| 2.69k|{ 70| 2.69k| int ret; 71| 2.69k| struct flb_tm tm = {0}; 72| 2.69k| const unsigned char *key = NULL; 73| 2.69k| size_t key_len = 0; 74| 2.69k| const unsigned char *value = NULL; 75| 2.69k| size_t value_len = 0; 76| 2.69k| const unsigned char *c = (const unsigned char *)in_buf; 77| 2.69k| const unsigned char *end = c + in_size; 78| 2.69k| int last_byte; 79| 2.69k| int do_pack = FLB_TRUE; ------------------ | | 26| 2.69k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 2.69k|#define FLB_FALSE 0 | | ------------------ ------------------ 80| 2.69k| int value_set = FLB_FALSE; ------------------ | | 25| 2.69k|#define FLB_FALSE 0 ------------------ 81| 2.69k| int value_str = FLB_FALSE; ------------------ | | 25| 2.69k|#define FLB_FALSE 0 ------------------ 82| 2.69k| int value_escape = FLB_FALSE; ------------------ | | 25| 2.69k|#define FLB_FALSE 0 ------------------ 83| | 84| | /* if map_size is 0 only count the number of k:v */ 85| 2.69k| if (*map_size == 0) { ------------------ | Branch (85:9): [True: 1.34k, False: 1.34k] ------------------ 86| 1.34k| do_pack = FLB_FALSE; ------------------ | | 25| 1.34k|#define FLB_FALSE 0 ------------------ 87| 1.34k| } 88| | 89| 13.5M| while (c < end) { ------------------ | Branch (89:12): [True: 13.5M, False: 0] ------------------ 90| | /* garbage */ 91| 25.5M| while ((c < end) && !ident_byte[*c]) { ------------------ | Branch (91:16): [True: 25.5M, False: 158] | Branch (91:29): [True: 11.9M, False: 13.5M] ------------------ 92| 11.9M| c++; 93| 11.9M| } 94| 13.5M| if (c == end) { ------------------ | Branch (94:13): [True: 158, False: 13.5M] ------------------ 95| 158| break; 96| 158| } 97| | /* key */ 98| 13.5M| key = c; 99| 54.5M| while ((c < end) && ident_byte[*c]) { ------------------ | Branch (99:16): [True: 54.5M, False: 261] | Branch (99:29): [True: 40.9M, False: 13.5M] ------------------ 100| 40.9M| c++; 101| 40.9M| } 102| | 103| 13.5M| key_len = c - key; 104| | /* value */ 105| 13.5M| value_len = 0; 106| 13.5M| value_set = FLB_FALSE; ------------------ | | 25| 13.5M|#define FLB_FALSE 0 ------------------ 107| 13.5M| value_str = FLB_FALSE; ------------------ | | 25| 13.5M|#define FLB_FALSE 0 ------------------ 108| 13.5M| value_escape = FLB_FALSE; ------------------ | | 25| 13.5M|#define FLB_FALSE 0 ------------------ 109| | 110| 13.5M| if (c < end && *c == '=') { ------------------ | Branch (110:13): [True: 13.5M, False: 261] | Branch (110:24): [True: 1.60M, False: 11.9M] ------------------ 111| 1.60M| value_set = FLB_TRUE; ------------------ | | 26| 1.60M|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 1.60M|#define FLB_FALSE 0 | | ------------------ ------------------ 112| 1.60M| c++; 113| 1.60M| if (c < end) { ------------------ | Branch (113:17): [True: 1.60M, False: 52] ------------------ 114| 1.60M| if (*c == '"') { ------------------ | Branch (114:21): [True: 1.60M, False: 3.97k] ------------------ 115| 1.60M| c++; 116| 1.60M| value = c; 117| 1.60M| value_str = FLB_TRUE; ------------------ | | 26| 1.60M|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 1.60M|#define FLB_FALSE 0 | | ------------------ ------------------ 118| 51.6M| while (c < end) { ------------------ | Branch (118:28): [True: 51.6M, False: 1.58k] ------------------ 119| 51.6M| if (*c != '\\' && *c!= '"') { ------------------ | Branch (119:29): [True: 49.5M, False: 2.06M] | Branch (119:43): [True: 47.9M, False: 1.60M] ------------------ 120| 47.9M| c++; 121| 47.9M| } 122| 3.67M| else if (*c == '\\') { ------------------ | Branch (122:34): [True: 2.06M, False: 1.60M] ------------------ 123| 2.06M| value_escape = FLB_TRUE; ------------------ | | 26| 2.06M|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 2.06M|#define FLB_FALSE 0 | | ------------------ ------------------ 124| 2.06M| c++; 125| 2.06M| if (c == end) { ------------------ | Branch (125:33): [True: 318, False: 2.06M] ------------------ 126| 318| break; 127| 318| } 128| 2.06M| c++; 129| 2.06M| } 130| 1.60M| else { 131| 1.60M| break; 132| 1.60M| } 133| 51.6M| } 134| 1.60M| value_len = c - value; 135| 1.60M| if (c < end && *c == '\"') { ------------------ | Branch (135:25): [True: 1.60M, False: 1.90k] | Branch (135:36): [True: 1.60M, False: 0] ------------------ 136| 1.60M| c++; 137| 1.60M| } 138| 1.60M| } 139| 3.97k| else { 140| 3.97k| value = c; 141| 14.6M| while ((c < end) && ident_byte[*c]) { ------------------ | Branch (141:27): [True: 14.6M, False: 223] | Branch (141:40): [True: 14.6M, False: 3.75k] ------------------ 142| 14.6M| c++; 143| 14.6M| } 144| 3.97k| value_len = c - value; 145| 3.97k| } 146| 1.60M| } 147| 1.60M| } 148| | 149| 13.5M| if (key_len > 0) { ------------------ | Branch (149:13): [True: 13.5M, False: 0] ------------------ 150| 13.5M| int time_found = FLB_FALSE; ------------------ | | 25| 13.5M|#define FLB_FALSE 0 ------------------ 151| 13.5M| if (parser->logfmt_no_bare_keys && value_len == 0 && !value_set) { ------------------ | Branch (151:17): [True: 0, False: 13.5M] | Branch (151:48): [True: 0, False: 0] | Branch (151:66): [True: 0, False: 0] ------------------ 152| 0| if (!do_pack) { ------------------ | Branch (152:21): [True: 0, False: 0] ------------------ 153| 0| *map_size = 0; 154| 0| } 155| 0| return 0; 156| 0| } 157| | 158| 13.5M| if (parser->time_fmt && key_len == time_key_len && ------------------ | Branch (158:17): [True: 0, False: 13.5M] | Branch (158:37): [True: 0, False: 0] ------------------ 159| 13.5M| value_len > 0 && ------------------ | Branch (159:17): [True: 0, False: 0] ------------------ 160| 13.5M| !strncmp((const char *)key, time_key, key_len)) { ------------------ | Branch (160:17): [True: 0, False: 0] ------------------ 161| 0| if (do_pack) { ------------------ | Branch (161:21): [True: 0, False: 0] ------------------ 162| 0| ret = flb_parser_time_lookup((const char *) value, value_len, 163| 0| 0, parser, &tm, tmfrac); 164| 0| if (ret == -1) { ------------------ | Branch (164:25): [True: 0, False: 0] ------------------ 165| 0| flb_error("[parser:%s] Invalid time format %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 | | ------------------ ------------------ 166| 0| parser->name, parser->time_fmt_full); 167| 0| return -1; 168| 0| } 169| 0| *time_lookup = flb_parser_tm2time(&tm); 170| 0| } 171| 0| time_found = FLB_TRUE; ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ 172| 0| } 173| | 174| 13.5M| if (time_found == FLB_FALSE || parser->time_keep == FLB_TRUE) { ------------------ | | 25| 27.1M|#define FLB_FALSE 0 ------------------ if (time_found == FLB_FALSE || parser->time_keep == FLB_TRUE) { ------------------ | | 26| 0|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 0|#define FLB_FALSE 0 | | ------------------ ------------------ | Branch (174:17): [True: 13.5M, False: 0] | Branch (174:44): [True: 0, False: 0] ------------------ 175| 13.5M| if (do_pack) { ------------------ | Branch (175:21): [True: 6.77M, False: 6.77M] ------------------ 176| 6.77M| if (parser->types_len != 0) { ------------------ | Branch (176:25): [True: 0, False: 6.77M] ------------------ 177| 0| flb_parser_typecast((const char*) key, key_len, 178| 0| (const char*) value, value_len, 179| 0| tmp_pck, 180| 0| parser->types, 181| 0| parser->types_len); 182| 0| } 183| 6.77M| else { 184| 6.77M| msgpack_pack_str(tmp_pck, key_len); 185| 6.77M| msgpack_pack_str_body(tmp_pck, (const char *)key, key_len); 186| 6.77M| if (value_len == 0) { ------------------ | Branch (186:29): [True: 5.97M, False: 803k] ------------------ 187| 5.97M| if (value_str == FLB_TRUE) { ------------------ | | 26| 5.97M|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 5.97M|#define FLB_FALSE 0 | | ------------------ ------------------ | Branch (187:33): [True: 372, False: 5.97M] ------------------ 188| 372| msgpack_pack_str(tmp_pck, 0); 189| 372| } 190| 5.97M| else { 191| 5.97M| msgpack_pack_true(tmp_pck); 192| 5.97M| } 193| 5.97M| } 194| 803k| else { 195| 803k| if (value_escape == FLB_TRUE) { ------------------ | | 26| 803k|#define FLB_TRUE !FLB_FALSE | | ------------------ | | | | 25| 803k|#define FLB_FALSE 0 | | ------------------ ------------------ | Branch (195:33): [True: 801k, False: 1.91k] ------------------ 196| 801k| int out_len; 197| 801k| char *out_str; 198| | 199| 801k| out_str = flb_malloc(value_len + 1); 200| 801k| if (out_str == NULL) { ------------------ | Branch (200:37): [True: 31, False: 801k] ------------------ 201| 31| flb_errno(); ------------------ | | 201| 31|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 202| 31| return -1; 203| 31| } 204| 801k| out_str[0] = 0; 205| 801k| flb_unescape_string_utf8((const char *)value, 206| 801k| value_len, 207| 801k| out_str); 208| 801k| out_len = strlen(out_str); 209| | 210| 801k| msgpack_pack_str(tmp_pck, out_len); 211| 801k| msgpack_pack_str_body(tmp_pck, 212| 801k| out_str, 213| 801k| out_len); 214| | 215| 801k| flb_free(out_str); 216| 801k| } 217| 1.91k| else { 218| 1.91k| msgpack_pack_str(tmp_pck, value_len); 219| 1.91k| msgpack_pack_str_body(tmp_pck, 220| 1.91k| (const char *)value, 221| 1.91k| value_len); 222| 1.91k| } 223| 803k| } 224| 6.77M| } 225| 6.77M| } 226| 6.77M| else { 227| 6.77M| (*map_size)++; 228| 6.77M| } 229| 13.5M| } 230| 13.5M| } 231| | 232| 13.5M| if (c == end) { ------------------ | Branch (232:13): [True: 2.45k, False: 13.5M] ------------------ 233| 2.45k| break; 234| 2.45k| } 235| | 236| 13.5M| if (*c == '\r') { ------------------ | Branch (236:13): [True: 41, False: 13.5M] ------------------ 237| 41| c++; 238| 41| if (c == end) { ------------------ | Branch (238:17): [True: 13, False: 28] ------------------ 239| 13| break; 240| 13| } 241| 28| if (*c == '\n') { ------------------ | Branch (241:17): [True: 7, False: 21] ------------------ 242| 7| c++; 243| 7| } 244| 28| break; 245| 41| } 246| 13.5M| if (*c == '\n') { ------------------ | Branch (246:13): [True: 11, False: 13.5M] ------------------ 247| 11| c++; 248| 11| break; 249| 11| } 250| 13.5M| } 251| 2.66k| last_byte = (const char *)c - in_buf; 252| | 253| 2.66k| return last_byte; 254| 2.69k|} flb_plugin_create: 173| 1.34k|{ 174| 1.34k| struct flb_plugins *ctx; 175| | 176| 1.34k| ctx = flb_malloc(sizeof(struct flb_plugins)); 177| 1.34k| if (!ctx) { ------------------ | Branch (177:9): [True: 0, False: 1.34k] ------------------ 178| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 179| 0| return NULL; 180| 0| } 181| | 182| 1.34k| mk_list_init(&ctx->input); 183| 1.34k| mk_list_init(&ctx->filter); 184| 1.34k| mk_list_init(&ctx->output); 185| | 186| 1.34k| return ctx; 187| 1.34k|} flb_plugin_destroy: 399| 1.34k|{ 400| 1.34k| struct mk_list *tmp; 401| 1.34k| struct mk_list *head; 402| 1.34k| struct flb_plugin *plugin; 403| | 404| 1.34k| mk_list_foreach_safe(head, tmp, &ctx->input) { ------------------ | | 207| 1.34k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 0, False: 1.34k] | | ------------------ ------------------ 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.34k| mk_list_foreach_safe(head, tmp, &ctx->filter) { ------------------ | | 207| 1.34k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 0, False: 1.34k] | | ------------------ ------------------ 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.34k| mk_list_foreach_safe(head, tmp, &ctx->output) { ------------------ | | 207| 1.34k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 0, False: 1.34k] | | ------------------ ------------------ 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.34k| flb_free(ctx); 420| 1.34k|} flb_regex_init: 151| 1.34k|{ 152| 1.34k| return onig_init(); 153| 1.34k|} flb_regex_create: 156| 31.0k|{ 157| 31.0k| int ret; 158| 31.0k| struct flb_regex *r; 159| | 160| | /* Create context */ 161| 31.0k| r = flb_malloc(sizeof(struct flb_regex)); 162| 31.0k| if (!r) { ------------------ | Branch (162:9): [True: 0, False: 31.0k] ------------------ 163| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 164| 0| return NULL; 165| 0| } 166| | 167| | /* Compile pattern */ 168| 31.0k| ret = str_to_regex(pattern, (OnigRegex*)&r->regex); 169| 31.0k| if (ret == -1) { ------------------ | Branch (169:9): [True: 0, False: 31.0k] ------------------ 170| 0| flb_free(r); 171| 0| return NULL; 172| 0| } 173| | 174| 31.0k| return r; 175| 31.0k|} flb_regex_destroy: 311| 31.0k|{ 312| 31.0k| onig_free(r->regex); 313| 31.0k| flb_free(r); 314| 31.0k| return 0; 315| 31.0k|} flb_regex.c:str_to_regex: 111| 31.0k|{ 112| 31.0k| int ret; 113| 31.0k| size_t len; 114| 31.0k| const char *start; 115| 31.0k| const char *end; 116| 31.0k| char *new_end = NULL; 117| 31.0k| OnigErrorInfo einfo; 118| 31.0k| OnigOptionType option; 119| | 120| 31.0k| len = strlen(pattern); 121| 31.0k| start = pattern; 122| 31.0k| end = pattern + len; 123| | 124| 31.0k| option = check_option(start, end, &new_end); 125| | 126| 31.0k| if (pattern[0] == '/' && pattern[len - 1] == '/') { ------------------ | Branch (126:9): [True: 29.6k, False: 1.34k] | Branch (126:30): [True: 29.6k, False: 0] ------------------ 127| 29.6k| start++; 128| 29.6k| end--; 129| 29.6k| } 130| | 131| 31.0k| if (new_end != NULL) { ------------------ | Branch (131:9): [True: 0, False: 31.0k] ------------------ 132| | /* pattern is /pat/option. new_end indicates a last '/'. */ 133| 0| start++; 134| 0| end = new_end; 135| 0| } 136| | 137| 31.0k| ret = onig_new(reg, 138| 31.0k| (const unsigned char *)start, (const unsigned char *)end, 139| 31.0k| option, 140| 31.0k| ONIG_ENCODING_UTF8, ONIG_SYNTAX_RUBY, &einfo); ------------------ | | 274| 31.0k|# define ONIG_ENCODING_UTF8 ONIG_ENCODING_UTF_8 | | ------------------ | | | | 242| 31.0k|# define ONIG_ENCODING_UTF_8 (&OnigEncodingUTF_8) | | ------------------ ------------------ ONIG_ENCODING_UTF8, ONIG_SYNTAX_RUBY, &einfo); ------------------ | | 511| 31.0k|#define ONIG_SYNTAX_RUBY (&OnigSyntaxRuby) ------------------ 141| | 142| 31.0k| if (ret != ONIG_NORMAL) { ------------------ | | 624| 31.0k|#define ONIG_NORMAL 0 ------------------ | Branch (142:9): [True: 0, False: 31.0k] ------------------ 143| 0| printf("ret=%d. start=%s end=%c\n", ret, start, *end); 144| 0| return -1; 145| 0| } 146| 31.0k| return 0; 147| 31.0k|} flb_regex.c:check_option: 61| 31.0k|{ 62| 31.0k| char *chr = NULL; 63| 31.0k| OnigOptionType option = ONIG_OPTION_NONE; ------------------ | | 450| 31.0k|#define ONIG_OPTION_NONE 0U ------------------ 64| | 65| 31.0k| if (start == NULL || end == NULL || new_end == NULL) { ------------------ | Branch (65:9): [True: 0, False: 31.0k] | Branch (65:26): [True: 0, False: 31.0k] | Branch (65:41): [True: 0, False: 31.0k] ------------------ 66| 0| return ONIG_OPTION_DEFAULT; ------------------ | | 447| 0|#define ONIG_OPTION_DEFAULT ONIG_OPTION_NONE | | ------------------ | | | | 450| 0|#define ONIG_OPTION_NONE 0U | | ------------------ ------------------ 67| 31.0k| } else if (start[0] != '/') { ------------------ | Branch (67:16): [True: 1.34k, False: 29.6k] ------------------ 68| 1.34k| *new_end = NULL; 69| 1.34k| return ONIG_OPTION_DEFAULT; ------------------ | | 447| 1.34k|#define ONIG_OPTION_DEFAULT ONIG_OPTION_NONE | | ------------------ | | | | 450| 1.34k|#define ONIG_OPTION_NONE 0U | | ------------------ ------------------ 70| 1.34k| } 71| | 72| 29.6k| chr = strrchr(start, '/'); 73| 29.6k| if (chr == start || chr == end) { ------------------ | Branch (73:9): [True: 0, False: 29.6k] | Branch (73:25): [True: 0, False: 29.6k] ------------------ 74| 0| *new_end = NULL; 75| 0| return ONIG_OPTION_DEFAULT; ------------------ | | 447| 0|#define ONIG_OPTION_DEFAULT ONIG_OPTION_NONE | | ------------------ | | | | 450| 0|#define ONIG_OPTION_NONE 0U | | ------------------ ------------------ 76| 0| } 77| 29.6k| *new_end = chr; 78| | 79| 29.6k| chr++; 80| 29.6k| while(chr != end && *chr != '\0') { ------------------ | Branch (80:11): [True: 0, False: 29.6k] | 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; ------------------ | | 453| 0|#define ONIG_OPTION_MULTILINE (ONIG_OPTION_EXTEND << 1) | | ------------------ | | | | 452| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | | | ------------------ | | | | | | 451| 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; ------------------ | | 451| 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; ------------------ | | 452| 0|#define ONIG_OPTION_EXTEND (ONIG_OPTION_IGNORECASE << 1) | | ------------------ | | | | 451| 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; ------------------ | | 447| 0|#define ONIG_OPTION_DEFAULT ONIG_OPTION_NONE | | ------------------ | | | | 450| 0|#define ONIG_OPTION_NONE 0U | | ------------------ ------------------ 98| 0| } 99| 0| chr++; 100| 0| } 101| | 102| 29.6k| if (option == ONIG_OPTION_NONE) { ------------------ | | 450| 29.6k|#define ONIG_OPTION_NONE 0U ------------------ | Branch (102:9): [True: 29.6k, False: 0] ------------------ 103| 29.6k| *new_end = NULL; 104| 29.6k| option = ONIG_OPTION_DEFAULT; ------------------ | | 447| 29.6k|#define ONIG_OPTION_DEFAULT ONIG_OPTION_NONE | | ------------------ | | | | 450| 29.6k|#define ONIG_OPTION_NONE 0U | | ------------------ ------------------ 105| 29.6k| } 106| | 107| 29.6k| return option; 108| 29.6k|} flb_sds_create_len: 58| 91.6k|{ 59| 91.6k| flb_sds_t s; 60| 91.6k| struct flb_sds *head; 61| | 62| 91.6k| s = sds_alloc(len); 63| 91.6k| if (!s) { ------------------ | Branch (63:9): [True: 0, False: 91.6k] ------------------ 64| 0| return NULL; 65| 0| } 66| | 67| 91.6k| if (str) { ------------------ | Branch (67:9): [True: 91.6k, False: 0] ------------------ 68| 91.6k| memcpy(s, str, len); 69| 91.6k| s[len] = '\0'; 70| | 71| 91.6k| head = FLB_SDS_HEADER(s); ------------------ | | 46| 91.6k|#define FLB_SDS_HEADER(s) ((struct flb_sds *) (s - FLB_SDS_HEADER_SIZE)) | | ------------------ | | | | 34| 91.6k|#define FLB_SDS_HEADER_SIZE (sizeof(uint64_t) + sizeof(uint64_t)) | | ------------------ ------------------ 72| 91.6k| head->len = len; 73| 91.6k| } 74| 91.6k| return s; 75| 91.6k|} flb_sds_create: 78| 47.1k|{ 79| 47.1k| size_t len; 80| | 81| 47.1k| if (!str) { ------------------ | Branch (81:9): [True: 0, False: 47.1k] ------------------ 82| 0| len = 0; 83| 0| } 84| 47.1k| else { 85| 47.1k| len = strlen(str); 86| 47.1k| } 87| | 88| 47.1k| return flb_sds_create_len(str, len); 89| 47.1k|} flb_sds_destroy: 462| 91.6k|{ 463| 91.6k| struct flb_sds *head; 464| | 465| 91.6k| if (!s) { ------------------ | Branch (465:9): [True: 0, False: 91.6k] ------------------ 466| 0| return; 467| 0| } 468| | 469| 91.6k| head = FLB_SDS_HEADER(s); ------------------ | | 46| 91.6k|#define FLB_SDS_HEADER(s) ((struct flb_sds *) (s - FLB_SDS_HEADER_SIZE)) | | ------------------ | | | | 34| 91.6k|#define FLB_SDS_HEADER_SIZE (sizeof(uint64_t) + sizeof(uint64_t)) | | ------------------ ------------------ 470| 91.6k| flb_free(head); 471| 91.6k|} flb_sds.c:sds_alloc: 36| 91.6k|{ 37| 91.6k| void *buf; 38| 91.6k| flb_sds_t s; 39| 91.6k| struct flb_sds *head; 40| | 41| 91.6k| buf = flb_malloc(FLB_SDS_HEADER_SIZE + size + 1); ------------------ | | 34| 91.6k|#define FLB_SDS_HEADER_SIZE (sizeof(uint64_t) + sizeof(uint64_t)) ------------------ 42| 91.6k| if (!buf) { ------------------ | Branch (42:9): [True: 0, False: 91.6k] ------------------ 43| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 44| 0| return NULL; 45| 0| } 46| | 47| 91.6k| head = buf; 48| 91.6k| head->len = 0; 49| 91.6k| head->alloc = size; 50| | 51| 91.6k| s = head->buf; 52| 91.6k| *s = '\0'; 53| | 54| 91.6k| return s; 55| 91.6k|} flb_slist_create: 28| 29.6k|{ 29| 29.6k| mk_list_init(list); 30| 29.6k| return 0; 31| 29.6k|} flb_slist_add_n: 35| 43.1k|{ 36| 43.1k| struct flb_slist_entry *e; 37| | 38| 43.1k| e = flb_malloc(sizeof(struct flb_slist_entry)); 39| 43.1k| if (!e) { ------------------ | Branch (39:9): [True: 0, False: 43.1k] ------------------ 40| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 41| 0| return -1; 42| 0| } 43| | 44| 43.1k| e->str = flb_sds_create_len(str, len); 45| 43.1k| if (!e->str) { ------------------ | Branch (45:9): [True: 0, False: 43.1k] ------------------ 46| 0| flb_free(e); 47| 0| return -1; 48| 0| } 49| | 50| 43.1k| mk_list_add(&e->_head, head); 51| 43.1k| return 0; 52| 43.1k|} flb_slist_split_string: 216| 29.6k|{ 217| 29.6k| int i = 0; 218| 29.6k| int ret; 219| 29.6k| int count = 0; 220| 29.6k| int val_len; 221| 29.6k| int len; 222| 29.6k| int end; 223| 29.6k| char *p_init; 224| 29.6k| char *p_end; 225| | 226| 29.6k| if (!str) { ------------------ | Branch (226:9): [True: 0, False: 29.6k] ------------------ 227| 0| return -1; 228| 0| } 229| | 230| 29.6k| len = strlen(str); 231| 72.7k| while (i < len) { ------------------ | Branch (231:12): [True: 43.1k, False: 29.6k] ------------------ 232| 43.1k| end = mk_string_char_search(str + i, separator, len - i); 233| 43.1k| if (end < 0) { ------------------ | Branch (233:13): [True: 29.6k, False: 13.4k] ------------------ 234| 29.6k| end = len - i; 235| 29.6k| } 236| 13.4k| else if ((end + i) == i) { ------------------ | Branch (236:18): [True: 0, False: 13.4k] ------------------ 237| 0| i++; 238| 0| continue; 239| 0| } 240| | 241| 43.1k| p_init = (char *) str + i; 242| 43.1k| p_end = p_init + end - 1; 243| | 244| | /* Skip empty spaces */ 245| 56.6k| while (*p_init == ' ') { ------------------ | Branch (245:16): [True: 13.4k, False: 43.1k] ------------------ 246| 13.4k| p_init++; 247| 13.4k| } 248| | 249| 43.1k| while (*p_end == ' ' && p_end >= p_init) { ------------------ | Branch (249:16): [True: 0, False: 43.1k] | Branch (249:33): [True: 0, False: 0] ------------------ 250| 0| p_end--; 251| 0| } 252| | 253| 43.1k| if (p_init > p_end) { ------------------ | Branch (253:13): [True: 0, False: 43.1k] ------------------ 254| 0| goto next; 255| 0| } 256| | 257| 43.1k| if (p_init == p_end) { ------------------ | Branch (257:13): [True: 0, False: 43.1k] ------------------ 258| 0| if (*p_init == ' ') { ------------------ | Branch (258:17): [True: 0, False: 0] ------------------ 259| 0| goto next; 260| 0| } 261| 0| val_len = 1; 262| 0| } 263| 43.1k| else { 264| 43.1k| val_len = (p_end - p_init) + 1; 265| 43.1k| } 266| | 267| 43.1k| if (val_len == 0) { ------------------ | Branch (267:13): [True: 0, False: 43.1k] ------------------ 268| 0| goto next; 269| 0| } 270| | 271| 43.1k| ret = flb_slist_add_n(list, p_init, val_len); 272| 43.1k| if (ret == -1) { ------------------ | Branch (272:13): [True: 0, False: 43.1k] ------------------ 273| 0| return -1; 274| 0| } 275| 43.1k| count++; 276| | 277| | /* Append remaining string as a new node ? */ 278| 43.1k| if (count >= max_split && max_split > 0) { ------------------ | Branch (278:13): [True: 43.1k, False: 0] | Branch (278:35): [True: 0, False: 43.1k] ------------------ 279| 0| p_end = p_init + end; 280| 0| if (*p_end == separator) { ------------------ | Branch (280:17): [True: 0, False: 0] ------------------ 281| 0| p_end++; 282| 0| } 283| 0| while (*p_end == ' ') { ------------------ | Branch (283:20): [True: 0, False: 0] ------------------ 284| 0| p_end++; 285| 0| } 286| | 287| 0| if ((p_end - str) >= len) { ------------------ | Branch (287:17): [True: 0, False: 0] ------------------ 288| 0| break; 289| 0| } 290| | 291| 0| ret = flb_slist_add(list, p_end); 292| 0| if (ret == -1) { ------------------ | Branch (292:17): [True: 0, False: 0] ------------------ 293| 0| return -1; 294| 0| } 295| 0| count++; 296| 0| break; 297| 0| } 298| | 299| 43.1k| next: 300| 43.1k| i += end + 1; 301| 43.1k| } 302| | 303| 29.6k| return count; 304| 29.6k|} flb_slist_destroy: 319| 29.6k|{ 320| 29.6k| struct mk_list *tmp; 321| 29.6k| struct mk_list *head; 322| 29.6k| struct flb_slist_entry *e; 323| | 324| 43.1k| mk_list_foreach_safe(head, tmp, list) { ------------------ | | 207| 72.7k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 43.1k, False: 29.6k] | | ------------------ ------------------ 325| 43.1k| e = mk_list_entry(head, struct flb_slist_entry, _head); ------------------ | | 214| 43.1k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 43.1k|#define container_of(ptr, type, member) ({ \ | | | | 39| 43.1k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 43.1k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 326| 43.1k| flb_sds_destroy(e->str); 327| 43.1k| mk_list_del(&e->_head); 328| 43.1k| flb_free(e); 329| 43.1k| } 330| 29.6k|} flb_unescape_string_utf8: 128| 801k|{ 129| 801k| uint32_t ch; 130| 801k| char temp[4]; 131| 801k| const char *end; 132| 801k| const char *next; 133| 801k| int size; 134| | 135| | 136| 801k| int count_out = 0; 137| 801k| int count_in = 0; 138| 801k| int esc_in = 0; 139| 801k| int esc_out = 0; 140| | 141| 801k| end = in_buf + sz; 142| 17.9M| while (in_buf < end && *in_buf && count_in < sz) { ------------------ | Branch (142:12): [True: 17.1M, False: 801k] | Branch (142:28): [True: 17.1M, False: 378] | Branch (142:39): [True: 17.1M, False: 0] ------------------ 143| 17.1M| next = in_buf + 1; 144| 17.1M| if (next < end && *in_buf == '\\') { ------------------ | Branch (144:13): [True: 17.1M, False: 7.94k] | Branch (144:27): [True: 870k, False: 16.2M] ------------------ 145| 870k| esc_in = 2; 146| 870k| switch (*next) { 147| 6.17k| case '"': ------------------ | Branch (147:13): [True: 6.17k, False: 864k] ------------------ 148| 6.17k| ch = '"'; 149| 6.17k| break; 150| 307| case '\'': ------------------ | Branch (150:13): [True: 307, False: 870k] ------------------ 151| 307| ch = '\''; 152| 307| break; 153| 6.34k| case '\\': ------------------ | Branch (153:13): [True: 6.34k, False: 863k] ------------------ 154| 6.34k| ch = '\\'; 155| 6.34k| break; 156| 260| case '/': ------------------ | Branch (156:13): [True: 260, False: 870k] ------------------ 157| 260| ch = '/'; 158| 260| break; 159| 352| case 'n': ------------------ | Branch (159:13): [True: 352, False: 869k] ------------------ 160| 352| ch = '\n'; 161| 352| break; 162| 229| case 'b': ------------------ | Branch (162:13): [True: 229, False: 870k] ------------------ 163| 229| ch = '\b'; 164| 229| break; 165| 210| case 't': ------------------ | Branch (165:13): [True: 210, False: 870k] ------------------ 166| 210| ch = '\t'; 167| 210| break; 168| 210| case 'f': ------------------ | Branch (168:13): [True: 210, False: 870k] ------------------ 169| 210| ch = '\f'; 170| 210| break; 171| 696| case 'r': ------------------ | Branch (171:13): [True: 696, False: 869k] ------------------ 172| 696| ch = '\r'; 173| 696| break; 174| 855k| default: ------------------ | Branch (174:13): [True: 855k, False: 14.7k] ------------------ 175| 855k| size = end - next; 176| 855k| if (size > 0) { ------------------ | Branch (176:21): [True: 855k, False: 0] ------------------ 177| 855k| esc_in = u8_read_escape_sequence(next, size, &ch) + 1; 178| 855k| } 179| 0| else { 180| | /* because char is unsigned char by default on arm, so we need to do a explicit conversion */ 181| 0| ch = (uint32_t) (signed char) *in_buf; 182| 0| esc_in = 1; 183| 0| } 184| 870k| } 185| 870k| } 186| 16.2M| else { 187| | /* explicit convert char to signed char */ 188| 16.2M| ch = (uint32_t) (signed char) *in_buf; 189| 16.2M| esc_in = 1; 190| 16.2M| } 191| | 192| 17.1M| in_buf += esc_in; 193| 17.1M| count_in += esc_in; 194| | 195| 17.1M| esc_out = u8_wc_toutf8(temp, ch); 196| 17.1M| if (esc_out > sz-count_out) { ------------------ | Branch (196:13): [True: 0, False: 17.1M] ------------------ 197| 0| flb_error("Crossing over string boundary"); ------------------ | | 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 | | ------------------ ------------------ 198| 0| break; 199| 0| } 200| | 201| 17.1M| if (esc_out == 0) { ------------------ | Branch (201:13): [True: 279k, False: 16.8M] ------------------ 202| 279k| out_buf[count_out] = ch; 203| 279k| esc_out = 1; 204| 279k| } 205| 16.8M| else if (esc_out == 1) { ------------------ | Branch (205:18): [True: 16.8M, False: 22.6k] ------------------ 206| 16.8M| out_buf[count_out] = (char) temp[0]; 207| 16.8M| } 208| 22.6k| else { 209| 22.6k| memcpy(&out_buf[count_out], temp, esc_out); 210| 22.6k| } 211| 17.1M| count_out += esc_out; 212| 17.1M| } 213| 801k| if (count_in < sz) { ------------------ | Branch (213:9): [True: 378, False: 801k] ------------------ 214| 378| flb_error("Not at boundary but still NULL terminating : %d - '%s'", sz, in_buf); ------------------ | | 140| 378| if (flb_log_check(FLB_LOG_ERROR)) \ | | ------------------ | | | | 39| 378|#define FLB_LOG_ERROR 1 | | ------------------ | | | Branch (140:9): [True: 378, False: 0] | | ------------------ | | 141| 378| flb_log_print(FLB_LOG_ERROR, NULL, 0, fmt, ##__VA_ARGS__) | | ------------------ | | | | 39| 378|#define FLB_LOG_ERROR 1 | | ------------------ ------------------ 215| 378| } 216| 801k| out_buf[count_out] = '\0'; 217| 801k| return count_out; 218| 801k|} flb_unescape.c:u8_read_escape_sequence: 70| 855k|{ 71| 855k| uint32_t ch; 72| 855k| char digs[9]="\0\0\0\0\0\0\0\0"; 73| 855k| int dno=0, i=1; 74| | 75| 855k| ch = (uint32_t)str[0]; /* take literal character */ 76| | 77| 855k| if (str[0] == 'n') ------------------ | Branch (77:9): [True: 0, False: 855k] ------------------ 78| 0| ch = L'\n'; 79| 855k| else if (str[0] == 't') ------------------ | Branch (79:14): [True: 0, False: 855k] ------------------ 80| 0| ch = L'\t'; 81| 855k| else if (str[0] == 'r') ------------------ | Branch (81:14): [True: 0, False: 855k] ------------------ 82| 0| ch = L'\r'; 83| 855k| else if (str[0] == 'b') ------------------ | Branch (83:14): [True: 0, False: 855k] ------------------ 84| 0| ch = L'\b'; 85| 855k| else if (str[0] == 'f') ------------------ | Branch (85:14): [True: 0, False: 855k] ------------------ 86| 0| ch = L'\f'; 87| 855k| else if (str[0] == 'v') ------------------ | Branch (87:14): [True: 216, False: 855k] ------------------ 88| 216| ch = L'\v'; 89| 855k| else if (str[0] == 'a') ------------------ | Branch (89:14): [True: 1.93k, False: 853k] ------------------ 90| 1.93k| ch = L'\a'; 91| 853k| else if (octal_digit(str[0])) { ------------------ | Branch (91:14): [True: 5.24k, False: 848k] ------------------ 92| 5.24k| i = 0; 93| 6.30k| do { 94| 6.30k| digs[dno++] = str[i++]; 95| 6.30k| } while (i < size && octal_digit(str[i]) && dno < 3); ------------------ | Branch (95:18): [True: 5.98k, False: 316] | Branch (95:30): [True: 1.21k, False: 4.76k] | Branch (95:53): [True: 1.06k, False: 159] ------------------ 96| 5.24k| ch = strtol(digs, NULL, 8); 97| 5.24k| } 98| 848k| else if (str[0] == 'x') { ------------------ | Branch (98:14): [True: 17.3k, False: 830k] ------------------ 99| 43.3k| while (i < size && hex_digit(str[i]) && dno < 2) { ------------------ | Branch (99:16): [True: 42.5k, False: 828] | Branch (99:28): [True: 26.7k, False: 15.7k] | Branch (99:49): [True: 25.9k, False: 783] ------------------ 100| 25.9k| digs[dno++] = str[i++]; 101| 25.9k| } 102| 17.3k| if (dno > 0) { ------------------ | Branch (102:13): [True: 13.3k, False: 4.08k] ------------------ 103| 13.3k| ch = strtol(digs, NULL, 16); 104| 13.3k| } 105| 17.3k| } 106| 830k| else if (str[0] == 'u') { ------------------ | Branch (106:14): [True: 61.4k, False: 769k] ------------------ 107| 95.6k| while (i < size && hex_digit(str[i]) && dno < 4) { ------------------ | Branch (107:16): [True: 46.1k, False: 49.4k] | Branch (107:28): [True: 37.2k, False: 8.92k] | Branch (107:49): [True: 34.1k, False: 3.06k] ------------------ 108| 34.1k| digs[dno++] = str[i++]; 109| 34.1k| } 110| 61.4k| if (dno > 0) { ------------------ | Branch (110:13): [True: 10.4k, False: 51.0k] ------------------ 111| 10.4k| ch = strtol(digs, NULL, 16); 112| 10.4k| } 113| 61.4k| } 114| 769k| else if (str[0] == 'U') { ------------------ | Branch (114:14): [True: 18.8k, False: 750k] ------------------ 115| 67.1k| while (i < size && hex_digit(str[i]) && dno < 8) { ------------------ | Branch (115:16): [True: 66.6k, False: 445] | Branch (115:28): [True: 48.4k, False: 18.2k] | Branch (115:49): [True: 48.3k, False: 141] ------------------ 116| 48.3k| digs[dno++] = str[i++]; 117| 48.3k| } 118| 18.8k| if (dno > 0) { ------------------ | Branch (118:13): [True: 14.3k, False: 4.47k] ------------------ 119| 14.3k| ch = strtol(digs, NULL, 16); 120| 14.3k| } 121| 18.8k| } 122| 855k| *dest = ch; 123| | 124| 855k| return i; 125| 855k|} flb_unescape.c:octal_digit: 29| 859k|{ 30| 859k| return (c >= '0' && c <= '7'); ------------------ | Branch (30:13): [True: 855k, False: 3.61k] | Branch (30:25): [True: 6.46k, False: 849k] ------------------ 31| 859k|} flb_unescape.c:hex_digit: 34| 155k|{ 35| 155k| return ((c >= '0' && c <= '9') || ------------------ | Branch (35:14): [True: 142k, False: 13.3k] | Branch (35:26): [True: 34.7k, False: 107k] ------------------ 36| 155k| (c >= 'A' && c <= 'F') || ------------------ | Branch (36:14): [True: 106k, False: 13.7k] | Branch (36:26): [True: 51.1k, False: 55.7k] ------------------ 37| 155k| (c >= 'a' && c <= 'f')); ------------------ | Branch (37:14): [True: 35.8k, False: 33.6k] | Branch (37:26): [True: 26.5k, False: 9.31k] ------------------ 38| 155k|} flb_unescape.c:u8_wc_toutf8: 41| 17.1M|{ 42| 17.1M| if (ch < 0x80) { ------------------ | Branch (42:9): [True: 16.8M, False: 301k] ------------------ 43| 16.8M| dest[0] = (char)ch; 44| 16.8M| return 1; 45| 16.8M| } 46| 301k| if (ch < 0x800) { ------------------ | Branch (46:9): [True: 5.83k, False: 295k] ------------------ 47| 5.83k| dest[0] = (ch>>6) | 0xC0; 48| 5.83k| dest[1] = (ch & 0x3F) | 0x80; 49| 5.83k| return 2; 50| 5.83k| } 51| 295k| if (ch < 0x10000) { ------------------ | Branch (51:9): [True: 15.6k, False: 280k] ------------------ 52| 15.6k| dest[0] = (ch>>12) | 0xE0; 53| 15.6k| dest[1] = ((ch>>6) & 0x3F) | 0x80; 54| 15.6k| dest[2] = (ch & 0x3F) | 0x80; 55| 15.6k| return 3; 56| 15.6k| } 57| 280k| if (ch < 0x110000) { ------------------ | Branch (57:9): [True: 1.20k, False: 279k] ------------------ 58| 1.20k| dest[0] = (ch>>18) | 0xF0; 59| 1.20k| dest[1] = ((ch>>12) & 0x3F) | 0x80; 60| 1.20k| dest[2] = ((ch>>6) & 0x3F) | 0x80; 61| 1.20k| dest[3] = (ch & 0x3F) | 0x80; 62| 1.20k| return 4; 63| 1.20k| } 64| 279k| return 0; 65| 280k|} flb_worker_init: 112| 1.34k|{ 113| 1.34k| FLB_TLS_INIT(flb_worker_ctx); ------------------ | | 35| 1.34k|#define FLB_TLS_INIT(key) do {} while (0) | | ------------------ | | | Branch (35:49): [Folded - Ignored] | | ------------------ ------------------ 114| | 115| 1.34k| return 0; 116| 1.34k|} flb_worker_get: 135| 409|{ 136| 409| return FLB_TLS_GET(flb_worker_ctx); ------------------ | | 34| 409|#define FLB_TLS_GET(key) key ------------------ 137| 409|} flb_worker_exit: 154| 1.34k|{ 155| 1.34k| int c = 0; 156| 1.34k| struct mk_list *tmp; 157| 1.34k| struct mk_list *head; 158| 1.34k| struct flb_worker *worker; 159| | 160| 1.34k| mk_list_foreach_safe(head, tmp, &config->workers) { ------------------ | | 207| 1.34k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 0, False: 1.34k] | | ------------------ ------------------ 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| 1.34k| return c; 167| 1.34k|} flb_ml_init: 1155| 1.34k|{ 1156| 1.34k| int ret; 1157| | 1158| 1.34k| ret = flb_ml_parser_builtin_create(config); 1159| 1.34k| if (ret == -1) { ------------------ | Branch (1159:9): [True: 0, False: 1.34k] ------------------ 1160| 0| return -1; 1161| 0| } 1162| | 1163| 1.34k| return 0; 1164| 1.34k|} flb_ml_exit: 1167| 1.34k|{ 1168| 1.34k| flb_ml_parser_destroy_all(&config->multiline_parsers); 1169| 1.34k| return 0; 1170| 1.34k|} flb_ml_parser_init: 28| 5.39k|{ 29| 5.39k| int ret; 30| | 31| 5.39k| ret = flb_ml_rule_init(ml_parser); 32| 5.39k| if (ret == -1) { ------------------ | Branch (32:9): [True: 0, False: 5.39k] ------------------ 33| 0| return -1; 34| 0| } 35| | 36| 5.39k| return 0; 37| 5.39k|} flb_ml_parser_builtin_create: 41| 1.34k|{ 42| 1.34k| struct flb_ml_parser *mlp; 43| | 44| | /* Docker */ 45| 1.34k| mlp = flb_ml_parser_docker(config); 46| 1.34k| if (!mlp) { ------------------ | Branch (46:9): [True: 0, False: 1.34k] ------------------ 47| 0| flb_error("[multiline] could not init 'docker' built-in parser"); ------------------ | | 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 | | ------------------ ------------------ 48| 0| return -1; 49| 0| } 50| | 51| | /* CRI */ 52| 1.34k| mlp = flb_ml_parser_cri(config); 53| 1.34k| if (!mlp) { ------------------ | Branch (53:9): [True: 0, False: 1.34k] ------------------ 54| 0| flb_error("[multiline] could not init 'cri' built-in parser"); ------------------ | | 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 | | ------------------ ------------------ 55| 0| return -1; 56| 0| } 57| | 58| | /* Java */ 59| 1.34k| mlp = flb_ml_parser_java(config, NULL); 60| 1.34k| if (!mlp) { ------------------ | Branch (60:9): [True: 0, False: 1.34k] ------------------ 61| 0| flb_error("[multiline] could not init 'java' built-in parser"); ------------------ | | 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 | | ------------------ ------------------ 62| 0| return -1; 63| 0| } 64| | 65| | /* Go */ 66| 1.34k| mlp = flb_ml_parser_go(config, NULL); 67| 1.34k| if (!mlp) { ------------------ | Branch (67:9): [True: 0, False: 1.34k] ------------------ 68| 0| flb_error("[multiline] could not init 'go' built-in parser"); ------------------ | | 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 | | ------------------ ------------------ 69| 0| return -1; 70| 0| } 71| | 72| | /* Ruby */ 73| 1.34k| mlp = flb_ml_parser_ruby(config, NULL); 74| 1.34k| if (!mlp) { ------------------ | Branch (74:9): [True: 0, False: 1.34k] ------------------ 75| 0| flb_error("[multiline] could not init 'ruby' built-in parser"); ------------------ | | 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 | | ------------------ ------------------ 76| 0| return -1; 77| 0| } 78| | 79| | /* Python */ 80| 1.34k| mlp = flb_ml_parser_python(config, NULL); 81| 1.34k| if (!mlp) { ------------------ | Branch (81:9): [True: 0, False: 1.34k] ------------------ 82| 0| flb_error("[multiline] could not init 'python' built-in parser"); ------------------ | | 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 | | ------------------ ------------------ 83| 0| return -1; 84| 0| } 85| | 86| 1.34k| return 0; 87| 1.34k|} flb_ml_parser_create: 98| 8.08k|{ 99| 8.08k| struct flb_ml_parser *ml_parser; 100| | 101| 8.08k| ml_parser = flb_calloc(1, sizeof(struct flb_ml_parser)); 102| 8.08k| if (!ml_parser) { ------------------ | Branch (102:9): [True: 0, False: 8.08k] ------------------ 103| 0| flb_errno(); ------------------ | | 201| 0|#define flb_errno() flb_errno_print(errno, __FLB_FILENAME__, __LINE__) ------------------ 104| 0| return NULL; 105| 0| } 106| 8.08k| ml_parser->name = flb_sds_create(name); 107| 8.08k| ml_parser->type = type; 108| | 109| 8.08k| if (match_str) { ------------------ | Branch (109:9): [True: 2.69k, False: 5.39k] ------------------ 110| 2.69k| ml_parser->match_str = flb_sds_create(match_str); 111| 2.69k| if (!ml_parser->match_str) { ------------------ | Branch (111:13): [True: 0, False: 2.69k] ------------------ 112| 0| if (ml_parser->name) { ------------------ | Branch (112:17): [True: 0, False: 0] ------------------ 113| 0| flb_sds_destroy(ml_parser->name); 114| 0| } 115| 0| flb_free(ml_parser); 116| 0| return NULL; 117| 0| } 118| 2.69k| } 119| | 120| 8.08k| ml_parser->parser = parser_ctx; 121| | 122| 8.08k| if (parser_name) { ------------------ | Branch (122:9): [True: 0, False: 8.08k] ------------------ 123| 0| ml_parser->parser_name = flb_sds_create(parser_name); 124| 0| } 125| 8.08k| ml_parser->negate = negate; 126| 8.08k| ml_parser->flush_ms = flush_ms; 127| 8.08k| mk_list_init(&ml_parser->regex_rules); 128| 8.08k| mk_list_add(&ml_parser->_head, &ctx->multiline_parsers); 129| | 130| 8.08k| if (key_content) { ------------------ | Branch (130:9): [True: 2.69k, False: 5.39k] ------------------ 131| 2.69k| ml_parser->key_content = flb_sds_create(key_content); 132| 2.69k| if (!ml_parser->key_content) { ------------------ | Branch (132:13): [True: 0, False: 2.69k] ------------------ 133| 0| flb_ml_parser_destroy(ml_parser); 134| 0| return NULL; 135| 0| } 136| 2.69k| } 137| | 138| 8.08k| if (key_group) { ------------------ | Branch (138:9): [True: 2.69k, False: 5.39k] ------------------ 139| 2.69k| ml_parser->key_group = flb_sds_create(key_group); 140| 2.69k| if (!ml_parser->key_group) { ------------------ | Branch (140:13): [True: 0, False: 2.69k] ------------------ 141| 0| flb_ml_parser_destroy(ml_parser); 142| 0| return NULL; 143| 0| } 144| 2.69k| } 145| | 146| 8.08k| if (key_pattern) { ------------------ | Branch (146:9): [True: 1.34k, False: 6.74k] ------------------ 147| 1.34k| ml_parser->key_pattern = flb_sds_create(key_pattern); 148| 1.34k| if (!ml_parser->key_pattern) { ------------------ | Branch (148:13): [True: 0, False: 1.34k] ------------------ 149| 0| flb_ml_parser_destroy(ml_parser); 150| 0| return NULL; 151| 0| } 152| 1.34k| } 153| | 154| 8.08k| return ml_parser; 155| 8.08k|} flb_ml_parser_destroy: 274| 8.08k|{ 275| 8.08k| if (!ml_parser) { ------------------ | Branch (275:9): [True: 0, False: 8.08k] ------------------ 276| 0| return 0; 277| 0| } 278| | 279| 8.08k| if (ml_parser->name) { ------------------ | Branch (279:9): [True: 8.08k, False: 0] ------------------ 280| 8.08k| flb_sds_destroy(ml_parser->name); 281| 8.08k| } 282| | 283| 8.08k| if (ml_parser->parser_name) { ------------------ | Branch (283:9): [True: 0, False: 8.08k] ------------------ 284| 0| flb_sds_destroy(ml_parser->parser_name); 285| 0| } 286| | 287| 8.08k| if (ml_parser->match_str) { ------------------ | Branch (287:9): [True: 2.69k, False: 5.39k] ------------------ 288| 2.69k| flb_sds_destroy(ml_parser->match_str); 289| 2.69k| } 290| 8.08k| if (ml_parser->key_content) { ------------------ | Branch (290:9): [True: 2.69k, False: 5.39k] ------------------ 291| 2.69k| flb_sds_destroy(ml_parser->key_content); 292| 2.69k| } 293| 8.08k| if (ml_parser->key_group) { ------------------ | Branch (293:9): [True: 2.69k, False: 5.39k] ------------------ 294| 2.69k| flb_sds_destroy(ml_parser->key_group); 295| 2.69k| } 296| 8.08k| if (ml_parser->key_pattern) { ------------------ | Branch (296:9): [True: 1.34k, False: 6.74k] ------------------ 297| 1.34k| flb_sds_destroy(ml_parser->key_pattern); 298| 1.34k| } 299| | 300| | /* Regex rules */ 301| 8.08k| flb_ml_rule_destroy_all(ml_parser); 302| | 303| | /* Unlink from struct flb_config->multiline_parsers */ 304| 8.08k| mk_list_del(&ml_parser->_head); 305| | 306| 8.08k| flb_free(ml_parser); 307| 8.08k| return 0; 308| 8.08k|} flb_ml_parser_destroy_all: 338| 1.34k|{ 339| 1.34k| struct mk_list *tmp; 340| 1.34k| struct mk_list *head; 341| 1.34k| struct flb_ml_parser *parser; 342| | 343| 8.08k| mk_list_foreach_safe(head, tmp, list) { ------------------ | | 207| 9.43k| for (curr = (head)->next, n = curr->next; curr != (head); curr = n, n = curr->next) | | ------------------ | | | Branch (207:47): [True: 8.08k, False: 1.34k] | | ------------------ ------------------ 344| 8.08k| parser = mk_list_entry(head, struct flb_ml_parser, _head); ------------------ | | 214| 8.08k|#define mk_list_entry( ptr, type, member ) container_of( ptr, type, member ) | | ------------------ | | | | 38| 8.08k|#define container_of(ptr, type, member) ({ \ | | | | 39| 8.08k| const typeof( ((type *)0)->member ) *__mptr = (ptr); \ | | | | 40| 8.08k| (type *)( (char *)__mptr - offsetof(type,member) );}) | | ------------------ ------------------ 345| 8.08k| flb_ml_parser_destroy(parser); 346| 8.08k| } 347| 1.34k|} flb_ml_parser_cri: 53| 1.34k|{ 54| 1.34k| struct flb_parser *parser; 55| 1.34k| struct flb_ml_parser *mlp; 56| | 57| | /* Create a Docker parser */ 58| 1.34k| parser = cri_parser_create(config); 59| 1.34k| if (!parser) { ------------------ | Branch (59:9): [True: 0, False: 1.34k] ------------------ 60| 0| return NULL; 61| 0| } 62| | 63| 1.34k| mlp = flb_ml_parser_create(config, 64| 1.34k| "cri", /* name */ 65| 1.34k| FLB_ML_EQ, /* type */ ------------------ | | 35| 1.34k|#define FLB_ML_EQ 3 /* record key/content equaks 'abc' */ ------------------ 66| 1.34k| "F", /* match_str */ 67| 1.34k| FLB_FALSE, /* negate */ ------------------ | | 25| 1.34k|#define FLB_FALSE 0 ------------------ 68| 1.34k| FLB_ML_FLUSH_TIMEOUT, /* flush_ms */ ------------------ | | 47| 1.34k|#define FLB_ML_FLUSH_TIMEOUT 4000 /* Flush timeout default (milliseconds) */ ------------------ 69| 1.34k| "log", /* key_content */ 70| 1.34k| "stream", /* key_group */ 71| 1.34k| "_p", /* key_pattern */ 72| 1.34k| parser, /* parser ctx */ 73| 1.34k| NULL); /* parser name */ 74| | 75| 1.34k| if (!mlp) { ------------------ | Branch (75:9): [True: 0, False: 1.34k] ------------------ 76| 0| flb_error("[multiline] could not create 'cri mode'"); ------------------ | | 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 | | ------------------ ------------------ 77| 0| return NULL; 78| 0| } 79| | 80| 1.34k| return mlp; 81| 1.34k|} flb_ml_parser_cri.c:cri_parser_create: 31| 1.34k|{ 32| 1.34k| struct flb_parser *p; 33| | 34| 1.34k| p = flb_parser_create("_ml_cri", /* parser name */ 35| 1.34k| "regex", /* backend type */ 36| 1.34k| FLB_ML_CRI_REGEX, /* regex */ ------------------ | | 25| 1.34k| "^(?