| /src/external/bsd/tre/dist/lib/ |
| tre-compile.h | 15 int code_min; member in struct:__anon5877
|
| tre-ast.h | 32 #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 in struct:__anon5867
104 tre_ast_new_literal(tre_mem_t mem, int code_min, int code_max, int position);
|
| tre-ast.c | 36 tre_ast_new_literal(tre_mem_t mem, int code_min, int code_max, int position)
45 lit->code_min = code_min;
137 int code_min, code_max, pos; local
147 code_min = lit->code_min;
183 "%d tags\n", code_min, code_max, code_min, code_max, pos,
|
| tre-compile.c | 278 (int)lit->code_min, (int)lit->code_max));
695 int min = lit->code_min;
1063 new_set[0].code_min = -1;
1070 tre_set_one(tre_mem_t mem, int position, int code_min, int code_max,
1080 new_set[0].code_min = code_min;
1086 new_set[1].code_min = -1;
1111 new_set[s1].code_min = set1[s1].code_min;
1155 new_set[s1 + s2].code_min = set2[s2].code_min
[all...] |
| tre-match-backtrack.c | 527 trans_i->code_min, trans_i->code_max,
528 trans_i->code_min, trans_i->code_max,
530 if (trans_i->code_min <= (tre_cint_t)prev_c
|
| tre-parse.c | 165 int a_min = l_a->code_min, b_min = l_b->code_min;
470 min = l->code_min;
474 (int)l->code_min, (int)l->code_max, (long)l->u.class, curr_max));
492 l->code_min = curr_min;
507 DPRINT(("creating %d - %d\n", (int)l->code_min, (int)l->code_max));
|
| tre-internal.h | 152 tre_cint_t code_min; member in struct:tnfa_transition
|
| tre-match-parallel.c | 414 if (trans_i->code_min <= (tre_cint_t)prev_c &&
|
| tre-match-approx.c | 682 if (trans->code_min > (tre_cint_t)prev_c
|
| /src/sys/dev/hpc/ |
| fontconv.c | 40 long code_min = 0x10000; local
80 if (code < code_min) {
81 code_min = code;
93 fprintf(ofp, " 0x%02x,\t\t\t/* firstchar */\n", code_min);
94 fprintf(ofp, " %d,\t\t\t/* numchars */\n", code_max - code_min + 1);
112 long code_min = 0x10000; local
153 if (code < code_min) {
154 code_min = code;
167 for (code = code_min; code <= code_max; code++) {
|
