Home
last modified time | relevance | path

Searched refs:code_min (Results 1 – 10 of 10) sorted by relevance

/netbsd-src/external/bsd/tre/dist/lib/
H A Dtre-ast.h32 #define IS_SPECIAL(x) ((x)->code_min < 0)
33 #define IS_EMPTY(x) ((x)->code_min == EMPTY)
34 #define IS_ASSERTION(x) ((x)->code_min == ASSERTION)
35 #define IS_TAG(x) ((x)->code_min == TAG)
36 #define IS_BACKREF(x) ((x)->code_min == BACKREF)
37 #define IS_PARAMETER(x) ((x)->code_min == PARAMETER)
58 int code_min; member
104 tre_ast_new_literal(tre_mem_t mem, int code_min, int code_max, int position);
H A Dtre-ast.c36 tre_ast_new_literal(tre_mem_t mem, int code_min, int code_max, int position) in tre_ast_new_literal() argument
45 lit->code_min = code_min; in tre_ast_new_literal()
137 int code_min, code_max, pos; in tre_do_print() local
147 code_min = lit->code_min; in tre_do_print()
183 "%d tags\n", code_min, code_max, code_min, code_max, pos, in tre_do_print()
H A Dtre-compile.c278 (int)lit->code_min, (int)lit->code_max)); in tre_add_tags()
695 int min = lit->code_min; in tre_copy_ast()
1063 new_set[0].code_min = -1; in tre_set_empty()
1070 tre_set_one(tre_mem_t mem, int position, int code_min, int code_max, in tre_set_one() argument
1080 new_set[0].code_min = code_min; in tre_set_one()
1086 new_set[1].code_min = -1; in tre_set_one()
1111 new_set[s1].code_min = set1[s1].code_min; in tre_set_union()
1155 new_set[s1 + s2].code_min = set2[s2].code_min; in tre_set_union()
1229 switch (lit->code_min) in tre_match_empty()
1359 else if (lit->code_min < 0) in tre_compute_nfl()
[all …]
H A Dtre-compile.h15 int code_min; member
H A Dtre-match-backtrack.c527 trans_i->code_min, trans_i->code_max, in tre_tnfa_run_backtrack()
528 trans_i->code_min, trans_i->code_max, in tre_tnfa_run_backtrack()
530 if (trans_i->code_min <= (tre_cint_t)prev_c in tre_tnfa_run_backtrack()
H A Dtre-parse.c165 int a_min = l_a->code_min, b_min = l_b->code_min; in tre_compare_items()
470 min = l->code_min; in tre_parse_bracket()
474 (int)l->code_min, (int)l->code_max, (long)l->u.class, curr_max)); in tre_parse_bracket()
492 l->code_min = curr_min; in tre_parse_bracket()
507 DPRINT(("creating %d - %d\n", (int)l->code_min, (int)l->code_max)); in tre_parse_bracket()
H A Dtre-internal.h152 tre_cint_t code_min; member
H A Dtre-match-parallel.c414 if (trans_i->code_min <= (tre_cint_t)prev_c && in tre_tnfa_run_parallel()
H A Dtre-match-approx.c682 if (trans->code_min > (tre_cint_t)prev_c in tre_tnfa_run_approx()
/netbsd-src/sys/dev/hpc/
H A Dfontconv.c40 long code_min = 0x10000; in fc_rasops() local
80 if (code < code_min) { in fc_rasops()
81 code_min = code; in fc_rasops()
93 fprintf(ofp, " 0x%02x,\t\t\t/* firstchar */\n", code_min); in fc_rasops()
94 fprintf(ofp, " %d,\t\t\t/* numchars */\n", code_max - code_min + 1); in fc_rasops()
112 long code_min = 0x10000; in fc_rcons() local
153 if (code < code_min) { in fc_rcons()
154 code_min = code; in fc_rcons()
167 for (code = code_min; code <= code_max; code++) { in fc_rcons()