Lines Matching defs:to
7 * This code is derived from software contributed to Berkeley by
19 * may be used to endorse or promote products derived from this software
40 * This code is derived from software contributed to Berkeley by
56 * may be used to endorse or promote products derived from this software
105 * parse structure, passed up and down to avoid global variables and
117 # define NPAREN 10 /* we need to remember () 1-9 for back refs */
144 static void repeat(struct parse *p, sopno start, int from, int to, size_t reclimit);
176 static char nuls[10]; /* place to point scanner in event of error */
565 * taken as an ordinary character and then revised to be an anchor. The
568 * The amount of lookahead needed to avoid this kludge is excessive.
785 invert++; /* make note to invert set at end */
1128 == static void repeat(struct parse *p, sopno start, int from, int to,
1134 sopno start, /* operand from here to end of strip */
1136 int to, /* to this number of times (maybe INFINITY) */
1155 assert(from <= to);
1157 switch (REP(MAP(from), MAP(to))) {
1166 repeat(p, start+1, 1, to, reclimit);
1186 repeat(p, copy, 1, to-1, reclimit);
1194 repeat(p, copy, from-1, to-1, reclimit);
1198 repeat(p, copy, from-1, to, reclimit);
1220 p->next = nuls; /* try to bring things to a halt */
1270 /* caller's responsibility not to do set ops */
1317 * is done using addition rather than xor -- all ASCII [aA] sets xor to
1406 - mcadd - add a collating element to a cset
1515 * This would have to know the set of possibilities. Implementation
1535 * This would have to know the set of possibilities. Implementation
1647 sopno finish) /* to this less one */
1671 * It might seem better to implement this as a macro with a function as
1673 * some changes to the data structures. Maybe later.
1695 /* finally, it's all reduced to the easy case */