HomeSort by relevance Sort by last modified time
    Searched refs:T_NAME (Results 1 - 14 of 14) sorted by null

  /onnv/onnv-gate/usr/src/cmd/fm/eversholt/common/
tree.c 161 case T_NAME:
236 case T_NAME:
335 case T_NAME:
505 ASSERT(ename->t == T_NAME);
511 ASSERT(np->t == T_NAME);
517 ASSERT(np->t == T_NAME);
552 struct node *ret = newnode(T_NAME, file, line);
605 ret = newnode(T_NAME, file, line);
635 if (np1->t != T_NAME)
638 if (np2->t != T_NAME)
    [all...]
check.c 144 case T_NAME:
186 * Nork values must be "A" for all(T_NAME),
202 if (np->t == T_NAME)
295 /* make sure it is a node type T_NAME? */
296 if (np->t == T_NAME) {
360 if (np->t != T_NAME || np->u.name.next || np->u.name.child)
371 if (np->t != T_NAME || np->u.name.next || np->u.name.child ||
445 case T_NAME:
598 case T_NAME:
599 if (np->u.name.child && np->u.name.child->t == T_NAME)
    [all...]
ptree.c 104 case T_NAME:
132 ASSERT(np->u.name.next->t == T_NAME);
494 case T_NAME: return L_T_NAME;
583 ASSERTeq(np->t, T_NAME, ptree_nodetype2str);
626 if (np->t == T_NAME)
literals.h 178 L_DECL(T_NAME);
tree.h 44 T_NAME, /* identifiers, sometimes chained */
105 * info kept for T_NAME, used in several ways:
123 * - if child is a T_NAME, it is x[j] or x<j> and
135 * when T_NAME nodes are chained:
139 * where to append newly-created T_NAME nodes (see
  /onnv/onnv-gate/usr/src/cmd/fm/modules/common/eversholt/
iexpr.c 108 case T_NAME:
189 case T_NAME:
eval.c 75 ASSERTeq(lhs->t, T_NAME, ptree_nodetype2str);
76 ASSERTeq(rhs->t, T_NAME, ptree_nodetype2str);
83 } else if (lhs->u.name.child && lhs->u.name.child->t == T_NAME) {
96 } else if (rhs->u.name.child && rhs->u.name.child->t == T_NAME) {
126 if (np->t == T_NAME)
778 T_NAME) {
884 case T_NAME: {
907 if (np1f->u.name.child->t == T_NAME &&
924 if (np1t->u.name.child->t == T_NAME &&
950 newnp = newnode(T_NAME, np->file, np->line)
    [all...]
ipath.c 111 ASSERTinfo(np->t == T_NAME, ptree_nodetype2str(np->t));
241 ASSERTinfo(namep->t == T_NAME, ptree_nodetype2str(namep->t));
itree.c 219 struct node *newnp = newnode(T_NAME, file, line);
239 case T_NAME:
325 struct node *newnp = newnode(T_NAME, oldepname->file,
408 case T_NAME:
500 searchenamenode.t = T_NAME;
686 ASSERTeq(epname->t, T_NAME, ptree_nodetype2str);
830 else if (norknp->t == T_NAME && norknp->u.name.s == L_A)
990 ASSERT(np->u.name.child->t == T_NAME);
    [all...]
config.c 223 ASSERT(rhs->t == T_NAME);
eft_mdb.c 394 case T_NAME: /* identifiers, sometimes chained */
platform.c 1122 case T_NAME:
    [all...]
fme.c     [all...]
  /onnv/onnv-gate/usr/src/lib/libdevinfo/
devfsmap.c 105 T_NAME
329 token = T_NAME;
400 token = T_NAME;
459 token = T_NAME;
464 case T_NAME:
664 case T_NAME:
    [all...]

Completed in 420 milliseconds