Lines Matching refs:parse_ctx
1870 tre_parse_ctx_t parse_ctx;
1886 memset(&parse_ctx, 0, sizeof(parse_ctx));
1887 parse_ctx.mem = mem;
1888 parse_ctx.stack = stack;
1889 parse_ctx.re = regex;
1890 parse_ctx.len = n;
1891 parse_ctx.cflags = cflags;
1892 parse_ctx.max_backref = -1;
1894 errcode = tre_parse(&parse_ctx);
1897 preg->re_nsub = parse_ctx.submatch_id - 1;
1898 tree = parse_ctx.result;
1902 if (parse_ctx.max_backref >= 0 && parse_ctx.have_approx)
1910 if (parse_ctx.max_backref > (int)preg->re_nsub)
1917 tnfa->have_backrefs = parse_ctx.max_backref >= 0;
1918 tnfa->have_approx = parse_ctx.have_approx;
1919 tnfa->num_submatches = parse_ctx.submatch_id;
1950 submatch_data = xcalloc((unsigned)parse_ctx.submatch_id,
1961 for (i = 0; i < parse_ctx.submatch_id; i++)
1972 errcode = tre_expand_ast(mem, stack, tree, &parse_ctx.position,
1982 tmp_ast_r = tre_ast_new_literal(mem, 0, 0, parse_ctx.position++);
1992 DPRINT(("Number of states: %d\n", parse_ctx.position));
1999 counts = xmalloc(sizeof(int) * parse_ctx.position);
2003 offs = xmalloc(sizeof(int) * parse_ctx.position);
2007 for (i = 0; i < parse_ctx.position; i++)
2012 for (i = 0; i < parse_ctx.position; i++)
2150 tnfa->num_states = parse_ctx.position;