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