Cross Reference: /illumos-gate/usr/src/cmd/fm/eversholt/common/tree.c

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