Lines Matching refs:to
33 * One or two things that technically ought to be in here
34 * are actually in color.c, thanks to some incestuous relationships in
255 newarc(nfa, t, co, from, to)
260 struct state *to;
264 assert(from != NULL && to != NULL);
268 if (a->to == to && a->co == co && a->type == t)
278 a->to = to;
287 a->inchain = to->ins;
288 to->ins = a;
293 to->nins++;
355 struct state *to = victim->to;
379 assert(to != NULL);
380 assert(to->ins != NULL);
381 a = to->ins;
383 to->ins = victim->inchain;
390 to->nins--;
395 victim->to = NULL;
427 cparc(nfa, oa, from, to)
431 struct state *to;
433 newarc(nfa, oa->type, oa->co, from, to);
437 - moveins - move all in arcs of a state to another state
440 * for duplicate suppression, which makes it easier to just make new
441 * ones to exploit the suppression built into newarc.
463 - copyins - copy all in arcs of a state to another state
481 - moveouts - move all out arcs of a state to another state
495 cparc(nfa, a, new, a->to);
501 - copyouts - copy all out arcs of a state to another state
515 cparc(nfa, a, new, a->to);
519 - cloneouts - copy out arcs of a state to another state pair, modifying type
524 cloneouts(nfa, old, from, to, type)
528 struct state *to;
536 newarc(nfa, type, a->co, from, to);
549 struct state *rp; /* ...to here, *not* inclusive */
565 * This routine's basic job is to destroy all out-arcs of the state.
575 struct state *to;
578 return; /* nothing to do */
585 to = a->to;
586 deltraverse(nfa, leftend, to);
587 assert(to->nouts == 0 || to->tmp != NULL);
589 if (to->nins == 0 && to->tmp == NULL) {
590 assert(to->nouts == 0);
591 freestate(nfa, to);
604 * Another recursive traversal, this time using tmp to point to duplicates
611 dupnfa(nfa, start, stop, from, to)
616 struct state *to; /* to here */
619 newarc(nfa, EMPTY, 0, from, to);
623 stop->tmp = to;
653 duptraverse(nfa, a->to, (struct state *)NULL);
654 assert(a->to->tmp != NULL);
655 cparc(nfa, a, s->tmp, a->to->tmp);
675 cleartraverse(nfa, a->to);
734 - pullback - pull back constraints backward to (with luck) eliminate them
771 newarc(nfa, PLAIN, nfa->bos[a->co], a->from, a->to);
790 struct state *to = con->to;
795 if (from == to) { /* circular constraint is pointless */
806 /* first, clone from state if necessary to avoid other outarcs */
811 assert(to != from); /* con is not an inarc */
813 cparc(nfa, con, s, to); /* move constraint arc */
833 cparc(nfa, a, s, to); /* anticipate move */
846 moveins(nfa, from, to);
852 - pushfwd - push forward constraints forward to (with luck) eliminate them
889 newarc(nfa, PLAIN, nfa->eos[a->co], a->from, a->to);
898 * one state -- the constraint's to state -- and only if the constraint
908 struct state *to = con->to;
913 if (to == from) { /* circular constraint is pointless */
917 if (to->flag) /* can't push forward beyond end */
919 if (to->nouts == 0) { /* dead end */
924 /* first, clone to state if necessary to avoid other inarcs */
925 if (to->nins > 1) {
929 copyouts(nfa, to, s); /* duplicate outarcs */
932 to = s;
933 con = to->ins;
935 assert(to->nins == 1);
937 /* propagate the constraint into the to state's outarcs */
938 for (a = to->outs; a != NULL; a = nexta) {
950 cparc(nfa, con, s, a->to); /* anticipate move */
963 moveouts(nfa, to, from);
964 dropstate(nfa, to); /* will free the constraint */
1077 struct state *to = a->to;
1078 int usefrom; /* work on from, as opposed to to? */
1081 assert(from != nfa->pre && to != nfa->post);
1083 if (from == to) { /* vacuous loop */
1088 /* decide which end to work on */
1090 if (from->nouts > to->nins)
1092 else if (from->nouts == to->nins) {
1094 if (from->nins > to->nouts)
1102 moveins(nfa, from, to);
1105 copyins(nfa, from, to);
1107 if (to->nins == 0) {
1109 moveouts(nfa, to, from);
1110 freestate(nfa, to);
1112 copyouts(nfa, to, from);
1131 /* use pre to mark reachable, then post to mark can-reach-post */
1161 struct state *mark; /* the value to mark with */
1170 markreachable(nfa, a->to, okay, mark);
1183 struct state *mark; /* the value to mark with */
1199 static long /* re_info bits to be ORed in */
1209 for (aa = a->to->outs; aa != NULL; aa = aa->outchain)
1210 if (aa->to == nfa->post)
1272 ca->to = a->to->no;
1278 ca->to = a->to->no;
1288 ca->to = 0;
1296 cnfa->states[a->to->no]->co = 1;
1302 * Really dumb algorithm, but if the list is long enough for that to matter,
1321 (p->co == q->co && p->to > q->to)) {
1399 if (a->to != s)
1400 fprintf(f, "\tlink from %d to %d on %d's in-chain\n",
1401 a->from->no, a->to->no, s->no);
1494 if (a->to == NULL) {
1498 fprintf(f, "%d", a->to->no);
1499 for (aa = a->to->ins; aa != NULL; aa = aa->inchain)
1564 fprintf(f, "\t[%ld]->%d", (long)ca[i].co, ca[i].to);
1567 ca[i].to);