Lines Matching refs:PROTO
36 void mkentry PROTO((register int*, int, int, int, int));
37 void mkprot PROTO((int[], int, int));
38 void mktemplate PROTO((int[], int, int));
39 void mv2front PROTO((int));
40 int tbldiff PROTO((int[], int, int[]));
60 * protos is kept around with the hope that most states will find a proto
63 * "templates" are a special type of proto. If a transition table is
69 * simply made into a proto, then (typically) each subsequent, similar
70 * state will differ from the proto for two out-transitions. One of these
71 * out-transitions will be that character on which the proto does not go
86 * which occur in "state" but not in the proto which, to date,
91 * just created by checking against a candidate "best" proto.
116 /* Find first proto which has the same "comstate". */
132 * that if this state is entered into the proto list,
145 /* We now have the first interesting proto in "minprot". If
146 * it matches within the tolerances set for the first proto,
147 * we don't want to bother scanning the rest of the proto list
168 /* Check if the proto we've decided on as our best bet is close
176 * make a proto.
192 { /* use the proto */
197 * proto we built it from, make it, too, a proto.
204 /* Since mkprot added a new proto to the proto queue,
206 * proto queue (if it happened to have been the last
208 * not there, then the new proto took its physical
209 * place (though logically the new proto is at the
670 /* mkprot - create new proto entry */
679 /* Gotta make room for the new proto by dropping last entry in
754 * of the proto queue.
762 /* mv2front - move proto queue element to front of queue */
856 * proto. "pr" is both the number of the proto we are extracting from
857 * and an index into the save area where we can find the proto's complete
