Lines Matching refs:constraint
1404 s->elems[i].constraint |= p.constraint;
1434 m->elems[m->nelem++].constraint |= s2->elems[j++].constraint;
1464 int constraint;
1471 hash ^= s->elems[i].index + s->elems[i].constraint;
1480 if (s->elems[j].constraint
1481 != d->states[i].elems.elems[j].constraint
1496 d->states[i].constraint = 0;
1505 constraint = s->elems[j].constraint;
1506 if (SUCCEEDS_IN_CONTEXT(constraint, newline, 0, letter, 0)
1507 || SUCCEEDS_IN_CONTEXT(constraint, newline, 0, letter, 1)
1508 || SUCCEEDS_IN_CONTEXT(constraint, newline, 1, letter, 0)
1509 || SUCCEEDS_IN_CONTEXT(constraint, newline, 1, letter, 1))
1510 d->states[i].constraint |= constraint;
1516 d->states[i].constraint = NO_CONSTRAINT;
1528 constraint. Repeat exhaustively until no funny positions are left.
1551 p.constraint = old.constraint;
1562 p.constraint &= BEGLINE_CONSTRAINT;
1565 p.constraint &= ENDLINE_CONSTRAINT;
1568 p.constraint &= BEGWORD_CONSTRAINT;
1571 p.constraint &= ENDWORD_CONSTRAINT;
1574 p.constraint &= LIMWORD_CONSTRAINT;
1577 p.constraint &= NOTLIMWORD_CONSTRAINT;
1635 constraint.
1796 firstpos->constraint = lastpos->constraint = NO_CONSTRAINT;
1863 if (PREV_NEWLINE_DEPENDENT(merged.elems[i].constraint))
1980 if (pos.constraint != 0xFF)
1982 if (! MATCHES_NEWLINE_CONTEXT(pos.constraint,
1985 if (! MATCHES_NEWLINE_CONTEXT(pos.constraint,
1989 if (! MATCHES_LETTER_CONTEXT(pos.constraint,
1993 if (! MATCHES_LETTER_CONTEXT(pos.constraint,
2078 if (PREV_NEWLINE_DEPENDENT(d->states[0].elems.elems[i].constraint))
2080 if (PREV_LETTER_DEPENDENT(d->states[0].elems.elems[i].constraint))
2158 if (PREV_NEWLINE_DEPENDENT(follows.elems[j].constraint))
2167 if (PREV_LETTER_DEPENDENT(follows.elems[j].constraint))
2428 if (!SUCCEEDS_IN_CONTEXT(pos.constraint, d->states[s].newline,
2475 if (!SUCCEEDS_IN_CONTEXT(pos.constraint, d->states[s].newline,