336 tree_treecmp(struct node *np1, struct node *np2, enum nodetype t,  in tree_treecmp()  argument
339 	if (np1 == NULL || np2 == NULL)  in tree_treecmp()
342 	if (np1->t != np2->t)  in tree_treecmp()
348 		return ((*cmp_func)(np1, np2));  in tree_treecmp()
352 		if (tree_treecmp(np1->u.name.child, np2->u.name.child, t,  in tree_treecmp()
355 		return (tree_treecmp(np1->u.name.next, np2->u.name.next, t,  in tree_treecmp()
360 		return (tree_treecmp(np1->u.func.arglist, np2->u.func.arglist,  in tree_treecmp()
388 		if (tree_treecmp(np1->u.expr.left, np2->u.expr.left, t,  in tree_treecmp()
391 		return (tree_treecmp(np1->u.expr.right, np2->u.expr.right, t,  in tree_treecmp()
396 		if (tree_treecmp(np1->u.event.ename, np2->u.event.ename, t,  in tree_treecmp()
399 		if (tree_treecmp(np1->u.event.epname, np2->u.event.epname, t,  in tree_treecmp()
403 		    np2->u.event.eexprlist, t, cmp_func));  in tree_treecmp()
407 		return (tree_treecmp(np1->u.expr.left, np2->u.expr.left, t,  in tree_treecmp()
412 		if (tree_treecmp(np1->u.arrow.lhs, np2->u.arrow.lhs, t,  in tree_treecmp()
415 		if (tree_treecmp(np1->u.arrow.nnp, np2->u.arrow.nnp, t,  in tree_treecmp()
418 		if (tree_treecmp(np1->u.arrow.knp, np2->u.arrow.knp, t,  in tree_treecmp()
421 		return (tree_treecmp(np1->u.arrow.rhs, np2->u.arrow.rhs, t,  in tree_treecmp()
427 		return (tree_treecmp(np1->u.stmt.np, np2->u.stmt.np, t,  in tree_treecmp()
440 		if (tree_treecmp(np1->u.stmt.np, np2->u.stmt.np, t, cmp_func))  in tree_treecmp()
442 		return (tree_treecmp(np1->u.stmt.nvpairs, np2->u.stmt.nvpairs,  in tree_treecmp()
647 tree_name_append(struct node *np1, struct node *np2)  in tree_name_append()  argument
649 	ASSERT(np1 != NULL && np2 != NULL);  in tree_name_append()
654 	if (np2->t != T_NAME)  in tree_name_append()
655 		outfl(O_DIE, np2->file, np2->line,  in tree_name_append()
656 		    "tree_name_append: internal error (np2 type %d)", np2->t);  in tree_name_append()
660 	np1->u.name.last->u.name.next = np2;  in tree_name_append()
661 	np1->u.name.last = np2;  in tree_name_append()
722 tree_name_iterator(struct node *np1, struct node *np2)  in tree_name_iterator()  argument
725 	ASSERT(np2 != NULL);  in tree_name_iterator()
728 	np1->u.name.child = np2;  in tree_name_iterator()
1359 tree_namecmp(struct node *np1, struct node *np2)  in tree_namecmp()  argument
1362 	ASSERT(np2 != NULL);  in tree_namecmp()
1364 	ASSERTinfo(np2->t == T_NAME, ptree_nodetype2str(np1->t));  in tree_namecmp()
1366 	while (np1 && np2 && np1->u.name.s == np2->u.name.s) {  in tree_namecmp()
1368 		np2 = np2->u.name.next;  in tree_namecmp()
1371 		if (np2 == NULL)  in tree_namecmp()
1375 	else if (np2 == NULL)  in tree_namecmp()
1378 		return (np2->u.name.s - np1->u.name.s);  in tree_namecmp()
1382 tree_eventcmp(struct node *np1, struct node *np2)  in tree_eventcmp()  argument
1387 	ASSERT(np2 != NULL);  in tree_eventcmp()
1389 	ASSERTinfo(np2->t == T_EVENT, ptree_nodetype2str(np2->t));  in tree_eventcmp()
1392 	    np2->u.event.ename)) == 0) {  in tree_eventcmp()
1394 			    np2->u.event.epname == NULL)  in tree_eventcmp()
1398 			else if (np2->u.event.epname == NULL)  in tree_eventcmp()
1402 				    np2->u.event.epname);  in tree_eventcmp()