Lines Matching refs:constraint

155 newline_constraint (int constraint)  in newline_constraint()  argument
157 return (constraint >> 6) & 7; in newline_constraint()
160 letter_constraint (int constraint) in letter_constraint() argument
162 return (constraint >> 3) & 7; in letter_constraint()
165 other_constraint (int constraint) in other_constraint() argument
167 return constraint & 7; in other_constraint()
171 succeeds_in_context (int constraint, int prev, int curr) in succeeds_in_context() argument
173 return !! (((curr & CTX_NONE ? other_constraint (constraint) : 0) \ in succeeds_in_context()
174 | (curr & CTX_LETTER ? letter_constraint (constraint) : 0) \ in succeeds_in_context()
175 | (curr & CTX_NEWLINE ? newline_constraint (constraint) : 0)) \ in succeeds_in_context()
181 prev_newline_dependent (int constraint) in prev_newline_dependent() argument
183 return ((constraint ^ constraint >> 2) & 0111) != 0; in prev_newline_dependent()
186 prev_letter_dependent (int constraint) in prev_letter_dependent() argument
188 return ((constraint ^ constraint >> 1) & 0111) != 0; in prev_letter_dependent()
323 unsigned int constraint; /* Constraint for matching this position. */ member
342 unsigned short constraint; /* Constraint for this state to accept. */ member
572 return r->states[s].constraint != 0; in accepting()
579 return succeeds_in_context (dfa->states[state].constraint, prev, curr); in accepts_in_context()
2052 s->elems[mid].constraint |= p.constraint; in insert()
2096 ? s2->elems[j++].constraint & c2 in merge_constrained()
2099 m->elems[m->nelem++].constraint = s1->elems[i++].constraint | c; in merge_constrained()
2103 if (s2->elems[j].constraint & c2) in merge_constrained()
2106 m->elems[m->nelem++].constraint = s2->elems[j].constraint & c2; in merge_constrained()
2149 unsigned int c = s->elems[mid].constraint; in delete()
2165 unsigned int constraint, position_set *tmp) in replace() argument
2167 unsigned int c = delete (del, dst) & constraint; in replace()
2183 int constraint = 0; in state_index() local
2190 hash ^= ind + s->elems[i].constraint; in state_index()
2201 if (s->elems[j].constraint != d->states[i].elems.elems[j].constraint in state_index()
2237 constraint |= c; in state_index()
2242 constraint = NO_CONSTRAINT; in state_index()
2253 d->states[i].constraint = constraint; in state_index()
2279 unsigned int constraint; in epsclosure() local
2283 constraint = BEGLINE_CONSTRAINT; in epsclosure()
2286 constraint = ENDLINE_CONSTRAINT; in epsclosure()
2289 constraint = BEGWORD_CONSTRAINT; in epsclosure()
2292 constraint = ENDWORD_CONSTRAINT; in epsclosure()
2295 constraint = LIMWORD_CONSTRAINT; in epsclosure()
2298 constraint = NOTLIMWORD_CONSTRAINT; in epsclosure()
2301 constraint = NO_CONSTRAINT; in epsclosure()
2309 replace (&d->follows[j], i, &d->follows[i], constraint, &tmp); in epsclosure()
2386 unsigned int iconstraint = follows[tindex].elems[i].constraint; in merge_nfa_state()
2392 d->constraints[tindex] |= follows[tindex].elems[i].constraint; in merge_nfa_state()
2404 if (follows[tindex].elems[j].constraint != iconstraint) in merge_nfa_state()
2746 firstpos->constraint = lastpos->constraint = NO_CONSTRAINT; in dfaanalyze()
2799 pos.constraint = NO_CONSTRAINT; in dfaanalyze()
2818 if (prev_newline_dependent (d->follows[i].elems[j].constraint)) in dfaanalyze()
2820 if (prev_letter_dependent (d->follows[i].elems[j].constraint)) in dfaanalyze()
3013 if (succeeds_in_context (pos.constraint, d->states[s].context, in build_state()
3026 if (pos.constraint != NO_CONSTRAINT) in build_state()
3028 if (!succeeds_in_context (pos.constraint, in build_state()
3032 if (!succeeds_in_context (pos.constraint, in build_state()
3036 if (!succeeds_in_context (pos.constraint, in build_state()