162 		size += sizeof (ret->u.name) - sizeof (ret->u);  in nodesize()
166 		size += sizeof (ret->u.globid) - sizeof (ret->u);  in nodesize()
171 		size += sizeof (ret->u.ull) - sizeof (ret->u);  in nodesize()
175 		size += sizeof (ret->u.quote) - sizeof (ret->u);  in nodesize()
179 		size += sizeof (ret->u.func) - sizeof (ret->u);  in nodesize()
194 		size += sizeof (ret->u.stmt) - sizeof (ret->u);  in nodesize()
198 		size += sizeof (ret->u.event) - sizeof (ret->u);  in nodesize()
202 		size += sizeof (ret->u.arrow) - sizeof (ret->u);  in nodesize()
206 		size += sizeof (ret->u.expr) - sizeof (ret->u);  in nodesize()
237 		tree_free(root->u.name.child);  in tree_free()
238 		tree_free(root->u.name.next);  in tree_free()
241 		tree_free(root->u.func.arglist);  in tree_free()
267 		tree_free(root->u.expr.left);  in tree_free()
268 		tree_free(root->u.expr.right);  in tree_free()
271 		tree_free(root->u.event.ename);  in tree_free()
272 		tree_free(root->u.event.epname);  in tree_free()
273 		tree_free(root->u.event.eexprlist);  in tree_free()
276 		tree_free(root->u.expr.left);  in tree_free()
279 		tree_free(root->u.arrow.lhs);  in tree_free()
280 		tree_free(root->u.arrow.nnp);  in tree_free()
281 		tree_free(root->u.arrow.knp);  in tree_free()
282 		tree_free(root->u.arrow.rhs);  in tree_free()
286 		tree_free(root->u.stmt.np);  in tree_free()
298 		tree_free(root->u.stmt.np);  in tree_free()
299 		if (root->u.stmt.nvpairs)  in tree_free()
300 			tree_free(root->u.stmt.nvpairs);  in tree_free()
301 		if (root->u.stmt.lutp)  in tree_free()
302 			lut_free(root->u.stmt.lutp, NULL, NULL);  in tree_free()
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()
387 		    np2->u.event.eexprlist, t, cmp_func));  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()
472 	ret->u.expr.left = left;  in tree_expr()
473 	ret->u.expr.right = right;  in tree_expr()
507 	if (ename->u.name.next == NULL)  in ename_compress()
510 	for (np = ename; np != NULL; np = np->u.name.next) {  in ename_compress()
513 		len += strlen(np->u.name.s);  in ename_compress()
516 	for (np = ename; np != NULL; np = np->u.name.next) {  in ename_compress()
520 		(void) strcpy(cp, np->u.name.s);  in ename_compress()
524 	ename->u.name.s = stable(buf);  in ename_compress()
525 	tree_free(ename->u.name.next);  in ename_compress()
526 	ename->u.name.next = NULL;  in ename_compress()
527 	ename->u.name.last = ename;  in ename_compress()
540 	ret->u.event.ename = ename_compress(ename);  in tree_event()
541 	ret->u.event.epname = epname;  in tree_event()
542 	ret->u.event.eexprlist = eexprlist;  in tree_event()
557 	ret->u.name.t = N_UNSPEC;  in tree_name()
558 	ret->u.name.s = stable(s);  in tree_name()
559 	ret->u.name.it = it;  in tree_name()
560 	ret->u.name.last = ret;  in tree_name()
565 			ret->u.name.t = N_FAULT;  in tree_name()
567 			ret->u.name.t = N_UPSET;  in tree_name()
569 			ret->u.name.t = N_DEFECT;  in tree_name()
571 			ret->u.name.t = N_ERROR;  in tree_name()
573 			ret->u.name.t = N_EREPORT;  in tree_name()
575 			ret->u.name.t = N_SERD;  in tree_name()
577 			ret->u.name.t = N_STAT;  in tree_name()
607 	ret->u.name.child = tree_num(ptr, file, line);  in tree_iname()
609 	ret->u.name.t = N_UNSPEC;  in tree_iname()
610 	ret->u.name.s = stable(ss);  in tree_iname()
611 	ret->u.name.it = IT_NONE;  in tree_iname()
612 	ret->u.name.last = ret;  in tree_iname()
625 	ret->u.globid.s = stable(s);  in tree_globid()
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()
672 	ASSERT(np->u.name.last != NULL);  in tree_name_repairdash()
674 	len = strlen(np->u.name.last->u.name.s) + 1 + strlen(s) + 1;  in tree_name_repairdash()
676 	(void) snprintf(buf, len, "%s-%s", np->u.name.last->u.name.s, s);  in tree_name_repairdash()
677 	np->u.name.last->u.name.s = stable(buf);  in tree_name_repairdash()
695 	ASSERT(np->u.name.last != NULL);  in tree_name_repairdash2()
697 	len = strlen(np->u.name.last->u.name.s) + 1 + strlen(s) + 1;  in tree_name_repairdash2()
699 	(void) snprintf(buf, len, "%s-%s", s, np->u.name.last->u.name.s);  in tree_name_repairdash2()
700 	np->u.name.last->u.name.s = stable(buf);  in tree_name_repairdash2()
712 	np1->u.name.child = np2;  in tree_name_iterator()
732 		ret->u.ull = 1;  in tree_timeval()
734 		ret->u.ull = (unsigned long long)strtoul(s, NULL, 0) * *ullp;  in tree_timeval()
745 	ret->u.ull = (unsigned long long)strtoul(s, NULL, 0);  in tree_num()
754 	ret->u.quote.s = stable(s);  in tree_quote()
764 	ret->u.func.s = s;  in tree_func()
765 	ret->u.func.arglist = np;  in tree_func()
774 		ptr = stable(np->u.expr.right->u.quote.s);  in tree_func()
842 			make_explicit(np->u.expr.left, eventonly);  in make_explicit()
843 			make_explicit(np->u.expr.right, eventonly);  in make_explicit()
847 			make_explicit(np->u.event.epname, 0);  in make_explicit()
848 			make_explicit(np->u.event.eexprlist, 1);  in make_explicit()
852 			make_explicit(np->u.func.arglist, eventonly);  in make_explicit()
858 			for (pnp = np; pnp != NULL; pnp = pnp->u.name.next)  in make_explicit()
859 				if (pnp->u.name.child == NULL) {  in make_explicit()
870 					    pnp2 = pnp2->u.name.next)  in make_explicit()
873 						else if (pnp2->u.name.s ==  in make_explicit()
874 						    pnp->u.name.s)  in make_explicit()
877 					if (namesz < strlen(pnp->u.name.s) +  in make_explicit()
879 						namesz = strlen(pnp->u.name.s) +  in make_explicit()
897 					    "%s#%s%d", pnp->u.name.s,  in make_explicit()
898 					    (pnp->u.name.it == IT_HORIZONTAL) ?  in make_explicit()
901 					pnp->u.name.child = tree_name(Newname,  in make_explicit()
903 					pnp->u.name.childgen = 1;  in make_explicit()
928 	ret->u.arrow.lhs = lhs;  in tree_arrow()
929 	ret->u.arrow.nnp = nnp;  in tree_arrow()
930 	ret->u.arrow.knp = knp;  in tree_arrow()
931 	ret->u.arrow.rhs = rhs;  in tree_arrow()
946 			ASSERTeq(np->u.expr.left->t, T_NAME,  in nvpair2lut()
950 			    np->u.expr.left->u.name.s, np->u.expr.right);  in nvpair2lut()
952 			lutp = nvpair2lut(np->u.expr.left, lutp, t);  in nvpair2lut()
953 			lutp = nvpair2lut(np->u.expr.right, lutp, t);  in nvpair2lut()
1026 	ret->u.stmt.np = np;  in dodecl()
1027 	ret->u.stmt.nvpairs = nvpairs;  in dodecl()
1043 		ret->u.stmt.lutp = nvpair2lut(nvpairs, NULL, t);  in dodecl()
1049 		ret->u.stmt.lutp = nvpair2lut(nvpairs, NULL, t);  in dodecl()
1052 		decl->u.stmt.lutp = nvpair2lut(nvpairs, decl->u.stmt.lutp, t);  in dodecl()
1066 	serd = tree_s2np_lut_lookup(((struct node *)rhs)->u.stmt.lutp,  in update_serd_refstmt()
1077 		serd->u.stmt.flags |= STMT_REF;  in update_serd_refstmt()
1094 		ASSERT(np->u.event.ename->t == T_NAME);  in tree_decl()
1095 		switch (np->u.event.ename->u.name.t) {  in tree_decl()
1138 			    np->u.event.ename, np);  in tree_decl()
1147 			if (tree_s2np_lut_lookup(ret->u.stmt.lutp,  in tree_decl()
1151 				    (void *)np->u.event.ename->u.name.s,  in tree_decl()
1152 				    (void *)np->u.event.ename->u.name.s, NULL);  in tree_decl()
1159 			    ptree_nametype2str(np->u.event.ename->u.name.t));  in tree_decl()
1165 		ASSERT(np->u.event.ename->t == T_NAME);  in tree_decl()
1166 		switch (np->u.event.ename->u.name.t) {  in tree_decl()
1181 			    ptree_nametype2str(np->u.event.ename->u.name.t));  in tree_decl()
1203 		ret->u.stmt.np = np;  in tree_decl()
1204 		ret->u.stmt.nvpairs = nvpairs;  in tree_decl()
1205 		ret->u.stmt.lutp = nvpair2lut(nvpairs, NULL, T_CONFIG);  in tree_decl()
1229 		np->u.arrow.prop = prop;  in set_arrow_prop()
1230 		set_arrow_prop(prop, np->u.arrow.lhs);  in set_arrow_prop()
1247 	ret->u.stmt.np = np;  in tree_stmt()
1256 		for (pp = Props; pp; pp = pp->u.stmt.next) {  in tree_stmt()
1268 			Lastprops->u.stmt.next = ret;  in tree_stmt()
1280 		for (pp = Masks; pp; pp = pp->u.stmt.next) {  in tree_stmt()
1292 			Lastmasks->u.stmt.next = ret;  in tree_stmt()
1350 	while (np1 && np2 && np1->u.name.s == np2->u.name.s) {  in tree_namecmp()
1351 		np1 = np1->u.name.next;  in tree_namecmp()
1352 		np2 = np2->u.name.next;  in tree_namecmp()
1362 		return (np2->u.name.s - np1->u.name.s);  in tree_namecmp()
1375 	if ((ret = tree_namecmp(np1->u.event.ename,  in tree_eventcmp()
1376 	    np2->u.event.ename)) == 0) {  in tree_eventcmp()
1377 			if (np1->u.event.epname == NULL &&  in tree_eventcmp()
1378 			    np2->u.event.epname == NULL)  in tree_eventcmp()
1380 			else if (np1->u.event.epname == NULL)  in tree_eventcmp()
1382 			else if (np2->u.event.epname == NULL)  in tree_eventcmp()
1385 				return tree_namecmp(np1->u.event.epname,  in tree_eventcmp()
1386 				    np2->u.event.epname);  in tree_eventcmp()