Lines Matching refs:ename
271 tree_free(root->u.event.ename);
380 if (tree_treecmp(np1->u.event.ename, np2->u.event.ename, t,
483 * this routine is called after the parser has completed an "ename", which
485 * after this routine gets done with the ename, two things are true:
486 * 1. the ename uses only a single struct node
487 * 2. ename->u.name.s contains the *complete* class name, dots and all,
491 * allows consumers of the fault tree to assume the ename is a single
495 ename_compress(struct node *ename)
502 if (ename == NULL)
503 return (ename);
505 ASSERT(ename->t == T_NAME);
507 if (ename->u.name.next == NULL)
508 return (ename); /* no compression to be applied here */
510 for (np = ename; np != NULL; np = np->u.name.next) {
516 for (np = ename; np != NULL; np = np->u.name.next) {
518 if (np != ename)
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;
528 return (ename);
532 tree_event(struct node *ename, struct node *epname, struct node *eexprlist)
536 ASSERT(ename != NULL);
538 ret = newnode(T_EVENT, ename->file, ename->line);
540 ret->u.event.ename = ename_compress(ename);
1094 ASSERT(np->u.event.ename->t == T_NAME);
1095 switch (np->u.event.ename->u.name.t) {
1138 np->u.event.ename, np);
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));
1375 if ((ret = tree_namecmp(np1->u.event.ename,
1376 np2->u.event.ename)) == 0) {