320 tree_treecmp(struct node *np1, struct node *np2, enum nodetype t,  in tree_treecmp()  argument
323 	if (np1 == NULL || np2 == NULL)  in tree_treecmp()
326 	if (np1->t != np2->t)  in tree_treecmp()
331 	if (np1->t == t)  in tree_treecmp()
332 		return ((*cmp_func)(np1, np2));  in tree_treecmp()
334 	switch (np1->t) {  in tree_treecmp()
336 		if (tree_treecmp(np1->u.name.child, np2->u.name.child, t,  in tree_treecmp()
339 		return (tree_treecmp(np1->u.name.next, np2->u.name.next, t,  in tree_treecmp()
344 		return (tree_treecmp(np1->u.func.arglist, np2->u.func.arglist,  in tree_treecmp()
372 		if (tree_treecmp(np1->u.expr.left, np2->u.expr.left, t,  in tree_treecmp()
375 		return (tree_treecmp(np1->u.expr.right, np2->u.expr.right, t,  in tree_treecmp()
380 		if (tree_treecmp(np1->u.event.ename, np2->u.event.ename, t,  in tree_treecmp()
383 		if (tree_treecmp(np1->u.event.epname, np2->u.event.epname, t,  in tree_treecmp()
386 		return (tree_treecmp(np1->u.event.eexprlist,  in tree_treecmp()
391 		return (tree_treecmp(np1->u.expr.left, np2->u.expr.left, t,  in tree_treecmp()
396 		if (tree_treecmp(np1->u.arrow.lhs, np2->u.arrow.lhs, t,  in tree_treecmp()
399 		if (tree_treecmp(np1->u.arrow.nnp, np2->u.arrow.nnp, t,  in tree_treecmp()
402 		if (tree_treecmp(np1->u.arrow.knp, np2->u.arrow.knp, t,  in tree_treecmp()
405 		return (tree_treecmp(np1->u.arrow.rhs, np2->u.arrow.rhs, t,  in tree_treecmp()
411 		return (tree_treecmp(np1->u.stmt.np, np2->u.stmt.np, t,  in tree_treecmp()
424 		if (tree_treecmp(np1->u.stmt.np, np2->u.stmt.np, t, cmp_func))  in tree_treecmp()
426 		return (tree_treecmp(np1->u.stmt.nvpairs, np2->u.stmt.nvpairs,  in tree_treecmp()
439 		    np1->t);  in tree_treecmp()
631 tree_name_append(struct node *np1, struct node *np2)  in tree_name_append()  argument
633 	ASSERT(np1 != NULL && np2 != NULL);  in tree_name_append()
635 	if (np1->t != T_NAME)  in tree_name_append()
636 		outfl(O_DIE, np1->file, np1->line,  in tree_name_append()
637 		    "tree_name_append: internal error (np1 type %d)", np1->t);  in tree_name_append()
642 	ASSERT(np1->u.name.last != NULL);  in tree_name_append()
644 	np1->u.name.last->u.name.next = np2;  in tree_name_append()
645 	np1->u.name.last = np2;  in tree_name_append()
646 	return (np1);  in tree_name_append()
706 tree_name_iterator(struct node *np1, struct node *np2)  in tree_name_iterator()  argument
708 	ASSERT(np1 != NULL);  in tree_name_iterator()
710 	ASSERTinfo(np1->t == T_NAME, ptree_nodetype2str(np1->t));  in tree_name_iterator()
712 	np1->u.name.child = np2;  in tree_name_iterator()
714 	check_name_iterator(np1);  in tree_name_iterator()
716 	return (np1);  in tree_name_iterator()
1343 tree_namecmp(struct node *np1, struct node *np2)  in tree_namecmp()  argument
1345 	ASSERT(np1 != NULL);  in tree_namecmp()
1347 	ASSERTinfo(np1->t == T_NAME, ptree_nodetype2str(np1->t));  in tree_namecmp()
1348 	ASSERTinfo(np2->t == T_NAME, ptree_nodetype2str(np1->t));  in tree_namecmp()
1350 	while (np1 && np2 && np1->u.name.s == np2->u.name.s) {  in tree_namecmp()
1351 		np1 = np1->u.name.next;  in tree_namecmp()
1354 	if (np1 == NULL)  in tree_namecmp()
1362 		return (np2->u.name.s - np1->u.name.s);  in tree_namecmp()
1366 tree_eventcmp(struct node *np1, struct node *np2)  in tree_eventcmp()  argument
1370 	ASSERT(np1 != NULL);  in tree_eventcmp()
1372 	ASSERTinfo(np1->t == T_EVENT, ptree_nodetype2str(np1->t));  in tree_eventcmp()
1375 	if ((ret = tree_namecmp(np1->u.event.ename,  in tree_eventcmp()
1377 			if (np1->u.event.epname == NULL &&  in tree_eventcmp()
1380 			else if (np1->u.event.epname == NULL)  in tree_eventcmp()
1385 				return tree_namecmp(np1->u.event.epname,  in tree_eventcmp()