Lines Matching refs:u
178 size += sizeof (ret->u.name) - sizeof (ret->u); in nodesize()
182 size += sizeof (ret->u.globid) - sizeof (ret->u); in nodesize()
187 size += sizeof (ret->u.ull) - sizeof (ret->u); in nodesize()
191 size += sizeof (ret->u.quote) - sizeof (ret->u); in nodesize()
195 size += sizeof (ret->u.func) - sizeof (ret->u); in nodesize()
210 size += sizeof (ret->u.stmt) - sizeof (ret->u); in nodesize()
214 size += sizeof (ret->u.event) - sizeof (ret->u); in nodesize()
218 size += sizeof (ret->u.arrow) - sizeof (ret->u); in nodesize()
222 size += sizeof (ret->u.expr) - sizeof (ret->u); in nodesize()
253 tree_free(root->u.name.child); in tree_free()
254 tree_free(root->u.name.next); in tree_free()
257 tree_free(root->u.func.arglist); in tree_free()
283 tree_free(root->u.expr.left); in tree_free()
284 tree_free(root->u.expr.right); in tree_free()
287 tree_free(root->u.event.ename); in tree_free()
288 tree_free(root->u.event.epname); in tree_free()
289 tree_free(root->u.event.eexprlist); in tree_free()
292 tree_free(root->u.expr.left); in tree_free()
295 tree_free(root->u.arrow.lhs); in tree_free()
296 tree_free(root->u.arrow.nnp); in tree_free()
297 tree_free(root->u.arrow.knp); in tree_free()
298 tree_free(root->u.arrow.rhs); in tree_free()
302 tree_free(root->u.stmt.np); in tree_free()
314 tree_free(root->u.stmt.np); in tree_free()
315 if (root->u.stmt.nvpairs) in tree_free()
316 tree_free(root->u.stmt.nvpairs); in tree_free()
317 if (root->u.stmt.lutp) in tree_free()
318 lut_free(root->u.stmt.lutp, NULL, NULL); in tree_free()
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()
402 return (tree_treecmp(np1->u.event.eexprlist, 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()
488 ret->u.expr.left = left; in tree_expr()
489 ret->u.expr.right = right; in tree_expr()
523 if (ename->u.name.next == NULL) in ename_compress()
526 for (np = ename; np != NULL; np = np->u.name.next) { in ename_compress()
529 len += strlen(np->u.name.s); in ename_compress()
532 for (np = ename; np != NULL; np = np->u.name.next) { in ename_compress()
536 (void) strcpy(cp, np->u.name.s); in ename_compress()
540 ename->u.name.s = stable(buf); in ename_compress()
541 tree_free(ename->u.name.next); in ename_compress()
542 ename->u.name.next = NULL; in ename_compress()
543 ename->u.name.last = ename; in ename_compress()
556 ret->u.event.ename = ename_compress(ename); in tree_event()
557 ret->u.event.epname = epname; in tree_event()
558 ret->u.event.eexprlist = eexprlist; in tree_event()
573 ret->u.name.t = N_UNSPEC; in tree_name()
574 ret->u.name.s = stable(s); in tree_name()
575 ret->u.name.it = it; in tree_name()
576 ret->u.name.last = ret; in tree_name()
581 ret->u.name.t = N_FAULT; in tree_name()
583 ret->u.name.t = N_UPSET; in tree_name()
585 ret->u.name.t = N_DEFECT; in tree_name()
587 ret->u.name.t = N_ERROR; in tree_name()
589 ret->u.name.t = N_EREPORT; in tree_name()
591 ret->u.name.t = N_SERD; in tree_name()
593 ret->u.name.t = N_STAT; in tree_name()
623 ret->u.name.child = tree_num(ptr, file, line); in tree_iname()
625 ret->u.name.t = N_UNSPEC; in tree_iname()
626 ret->u.name.s = stable(ss); in tree_iname()
627 ret->u.name.it = IT_NONE; in tree_iname()
628 ret->u.name.last = ret; in tree_iname()
641 ret->u.globid.s = stable(s); in tree_globid()
658 ASSERT(np1->u.name.last != NULL); 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()
688 ASSERT(np->u.name.last != NULL); in tree_name_repairdash()
690 len = strlen(np->u.name.last->u.name.s) + 1 + strlen(s) + 1; in tree_name_repairdash()
692 (void) snprintf(buf, len, "%s-%s", np->u.name.last->u.name.s, s); in tree_name_repairdash()
693 np->u.name.last->u.name.s = stable(buf); in tree_name_repairdash()
711 ASSERT(np->u.name.last != NULL); in tree_name_repairdash2()
713 len = strlen(np->u.name.last->u.name.s) + 1 + strlen(s) + 1; in tree_name_repairdash2()
715 (void) snprintf(buf, len, "%s-%s", s, np->u.name.last->u.name.s); in tree_name_repairdash2()
716 np->u.name.last->u.name.s = stable(buf); in tree_name_repairdash2()
728 np1->u.name.child = np2; in tree_name_iterator()
748 ret->u.ull = 1; in tree_timeval()
750 ret->u.ull = (unsigned long long)strtoul(s, NULL, 0) * *ullp; in tree_timeval()
761 ret->u.ull = (unsigned long long)strtoul(s, NULL, 0); in tree_num()
770 ret->u.quote.s = stable(s); in tree_quote()
780 ret->u.func.s = s; in tree_func()
781 ret->u.func.arglist = np; in tree_func()
790 ptr = stable(np->u.expr.right->u.quote.s); in tree_func()
858 make_explicit(np->u.expr.left, eventonly); in make_explicit()
859 make_explicit(np->u.expr.right, eventonly); in make_explicit()
863 make_explicit(np->u.event.epname, 0); in make_explicit()
864 make_explicit(np->u.event.eexprlist, 1); in make_explicit()
868 make_explicit(np->u.func.arglist, eventonly); in make_explicit()
874 for (pnp = np; pnp != NULL; pnp = pnp->u.name.next) in make_explicit()
875 if (pnp->u.name.child == NULL) { in make_explicit()
886 pnp2 = pnp2->u.name.next) in make_explicit()
889 else if (pnp2->u.name.s == in make_explicit()
890 pnp->u.name.s) in make_explicit()
893 if (namesz < strlen(pnp->u.name.s) + in make_explicit()
895 namesz = strlen(pnp->u.name.s) + in make_explicit()
913 "%s#%s%d", pnp->u.name.s, in make_explicit()
914 (pnp->u.name.it == IT_HORIZONTAL) ? in make_explicit()
917 pnp->u.name.child = tree_name(Newname, in make_explicit()
919 pnp->u.name.childgen = 1; in make_explicit()
944 ret->u.arrow.lhs = lhs; in tree_arrow()
945 ret->u.arrow.nnp = nnp; in tree_arrow()
946 ret->u.arrow.knp = knp; in tree_arrow()
947 ret->u.arrow.rhs = rhs; in tree_arrow()
962 ASSERTeq(np->u.expr.left->t, T_NAME, in nvpair2lut()
966 np->u.expr.left->u.name.s, np->u.expr.right); in nvpair2lut()
968 lutp = nvpair2lut(np->u.expr.left, lutp, t); in nvpair2lut()
969 lutp = nvpair2lut(np->u.expr.right, lutp, t); in nvpair2lut()
1042 ret->u.stmt.np = np; in dodecl()
1043 ret->u.stmt.nvpairs = nvpairs; in dodecl()
1059 ret->u.stmt.lutp = nvpair2lut(nvpairs, NULL, t); in dodecl()
1065 ret->u.stmt.lutp = nvpair2lut(nvpairs, NULL, t); in dodecl()
1068 decl->u.stmt.lutp = nvpair2lut(nvpairs, decl->u.stmt.lutp, t); in dodecl()
1082 serd = tree_s2np_lut_lookup(((struct node *)rhs)->u.stmt.lutp, in update_serd_refstmt()
1093 serd->u.stmt.flags |= STMT_REF; in update_serd_refstmt()
1110 ASSERT(np->u.event.ename->t == T_NAME); in tree_decl()
1111 switch (np->u.event.ename->u.name.t) { in tree_decl()
1154 np->u.event.ename, np); in tree_decl()
1163 if (tree_s2np_lut_lookup(ret->u.stmt.lutp, in tree_decl()
1167 (void *)np->u.event.ename->u.name.s, in tree_decl()
1168 (void *)np->u.event.ename->u.name.s, NULL); in tree_decl()
1175 ptree_nametype2str(np->u.event.ename->u.name.t)); in tree_decl()
1181 ASSERT(np->u.event.ename->t == T_NAME); in tree_decl()
1182 switch (np->u.event.ename->u.name.t) { in tree_decl()
1197 ptree_nametype2str(np->u.event.ename->u.name.t)); in tree_decl()
1219 ret->u.stmt.np = np; in tree_decl()
1220 ret->u.stmt.nvpairs = nvpairs; in tree_decl()
1221 ret->u.stmt.lutp = nvpair2lut(nvpairs, NULL, T_CONFIG); in tree_decl()
1245 np->u.arrow.prop = prop; in set_arrow_prop()
1246 set_arrow_prop(prop, np->u.arrow.lhs); in set_arrow_prop()
1263 ret->u.stmt.np = np; in tree_stmt()
1272 for (pp = Props; pp; pp = pp->u.stmt.next) { in tree_stmt()
1284 Lastprops->u.stmt.next = ret; in tree_stmt()
1296 for (pp = Masks; pp; pp = pp->u.stmt.next) { in tree_stmt()
1308 Lastmasks->u.stmt.next = ret; in tree_stmt()
1366 while (np1 && np2 && np1->u.name.s == np2->u.name.s) { in tree_namecmp()
1367 np1 = np1->u.name.next; in tree_namecmp()
1368 np2 = np2->u.name.next; in tree_namecmp()
1378 return (np2->u.name.s - np1->u.name.s); in tree_namecmp()
1391 if ((ret = tree_namecmp(np1->u.event.ename, in tree_eventcmp()
1392 np2->u.event.ename)) == 0) { in tree_eventcmp()
1393 if (np1->u.event.epname == NULL && in tree_eventcmp()
1394 np2->u.event.epname == NULL) in tree_eventcmp()
1396 else if (np1->u.event.epname == NULL) in tree_eventcmp()
1398 else if (np2->u.event.epname == NULL) in tree_eventcmp()
1401 return tree_namecmp(np1->u.event.epname, in tree_eventcmp()
1402 np2->u.event.epname); in tree_eventcmp()