H A D | tre-compile.c | 53 Algorithms to setup tags so that submatch addressing can be done. 99 const char *sep = " tags="; 103 if (bit_test(branch->tags, i)) 165 const char *sep = " tags="; 168 DPRINT(("%s%d", sep, branch->tags[i])); 213 bitstr_t *l = db->tags; 214 bitstr_t *r = sb->tags; 219 /* db and sb are the info from two parallel sub-trees, so the tags 261 /* tag_id is a new tag, and shouldn't exist in db's tags, 263 bit_set(db->tags, tag_i 2120 tre_set_union(tre_mem_t mem, tre_pos_and_tags_t *set1, tre_pos_and_tags_t *set2, int *tags, int assertions, int *params) argument 2227 tre_match_empty(tre_stack_t *stack, tre_ast_node_t *node, int *tags, int *assertions, int *params, int *num_tags_seen, int *params_seen) argument 2467 int num_tags, *tags, assertions, params_seen; local 2555 int num_tags, *tags, assertions, params_seen; local 2824 int *tags; local 3234 int *tags; local [all...] |