92 static int itree_set_arrow_traits(struct arrow *ap, struct node *fromev,
96 static void arrow_add_within(struct arrow *ap, struct node *xpr);
97 static struct arrow *itree_add_arrow(struct node *apnode,
100 static void add_arrow(struct bubble *bp, struct arrow *ap);
101 static struct constraintlist *itree_add_constraint(struct arrow *arrowp,
106 static void itree_free_constraints(struct arrow *ap);
170 	struct arrow *arrowp;  in generate()
1211 			    itree_np2nork(infop->anp->u.arrow.nnp),  in vmatch()
1212 			    itree_np2nork(infop->anp->u.arrow.knp));  in vmatch()
1213 			dst = infop->anp->u.arrow.rhs;  in vmatch()
1214 			src = infop->anp->u.arrow.lhs;  in vmatch()
1218 					hmatch(infop, src->u.arrow.rhs, dst);  in vmatch()
1220 					    itree_np2nork(src->u.arrow.nnp),  in vmatch()
1221 					    itree_np2nork(src->u.arrow.knp));  in vmatch()
1222 					dst = src->u.arrow.rhs;  in vmatch()
1223 					src = src->u.arrow.lhs;  in vmatch()
1337 		vmatch(infop, np->u.arrow.rhs, NULL, np->u.arrow.parent);  in vmatch()
1350 	if (anp->u.arrow.lhs->t == T_ARROW) {  in find_first_arrow()
1351 		anp->u.arrow.lhs->u.arrow.parent = anp;  in find_first_arrow()
1352 		find_first_arrow(infop, anp->u.arrow.lhs);  in find_first_arrow()
1354 		vmatch(infop, anp->u.arrow.lhs, NULL, anp);  in find_first_arrow()
1374 		cp_reset(np->u.arrow.lhs);  in cp_reset()
1375 		cp_reset(np->u.arrow.rhs);  in cp_reset()
1407 		if (!anp->u.arrow.needed)  in itree_create()
1413 		anp->u.arrow.parent = NULL;  in itree_create()
1476 	struct arrow *arrowp;  in itree_create_dummy()
1489 			dlst = arrownp->u.arrow.rhs;  in itree_create_dummy()
1490 			slst = arrownp->u.arrow.lhs;  in itree_create_dummy()
1494 				slst = slst->u.arrow.rhs;  in itree_create_dummy()
1517 					    sizeof (struct arrow));  in itree_create_dummy()
1518 					bzero(arrowp, sizeof (struct arrow));  in itree_create_dummy()
1839 add_arrow(struct bubble *bp, struct arrow *ap)  in add_arrow()
1861 static struct arrow *
1865 	struct arrow *newa;  in itree_add_arrow()
1867 	newa = alloc_xmalloc(sizeof (struct arrow));  in itree_add_arrow()
1868 	bzero(newa, sizeof (struct arrow));  in itree_add_arrow()
1878 		alloc_xfree(newa, sizeof (struct arrow));  in itree_add_arrow()
1887 itree_set_arrow_traits(struct arrow *ap, struct node *fromev,  in itree_set_arrow_traits()
1964 arrow_add_within(struct arrow *ap, struct node *xpr)  in arrow_add_within()
2026 			alloc_xfree(al->arrowp, sizeof (struct arrow));  in itree_free_arrowlists()
2034 itree_delete_arrow(struct bubble *bubp, struct arrow *arrow)  in itree_delete_arrow()  argument
2039 	if (al->arrowp == arrow) {  in itree_delete_arrow()
2048 		if (al->arrowp == arrow) {  in itree_delete_arrow()
2069 		alloc_xfree(al->arrowp, sizeof (struct arrow));  in itree_prune_arrowlists()
2088 itree_add_constraint(struct arrow *arrowp, struct node *c)  in itree_add_constraint()
2112 itree_next_constraint(struct arrow *arrowp, struct constraintlist *last)  in itree_next_constraint()
2124 itree_free_constraints(struct arrow *ap)  in itree_free_constraints()