T_NAME
arglist->u.expr.right->t != T_NAME) {
if ((arglist->u.expr.right->t == T_NAME) &&
if (arglist->t != T_NAME)
if (arglist->t != T_NAME)
(arglist->u.expr.left->t == T_NAME ||
(arglist->u.expr.right->t == T_NAME ||
if (arglist->t == T_NAME || arglist->t == T_FUNC) {
if (arglist->t == T_NAME || arglist->t == T_FUNC) {
(arglist->u.expr.left->t == T_NAME ||
if (arglist->t == T_NAME || arglist->t == T_FUNC) {
(arglist->u.expr.left->t == T_NAME ||
case T_NAME:
if (np->t == T_NAME)
if (np->t == T_NAME) {
if (np->t != T_NAME || np->u.name.next || np->u.name.child)
if (np->t != T_NAME || np->u.name.next || np->u.name.child ||
case T_NAME:
case T_NAME:
if (np->u.name.child && np->u.name.child->t == T_NAME)
case T_NAME:
if (np->u.name.child && np->u.name.child->t == T_NAME) {
np->u.name.child->t != T_NAME &&
} else if (np->t == T_NAME) {
case T_NAME:
L_DECL(T_NAME);
case T_NAME:
ASSERT(np->u.name.next->t == T_NAME);
case T_NAME: return L_T_NAME;
ASSERTeq(np->t, T_NAME, ptree_nodetype2str);
if (np->t == T_NAME)
ASSERT(np->u.event.ename->t == T_NAME);
ASSERT(np->u.event.ename->t == T_NAME);
if (tree_treecmp(pp, ret, T_NAME,
if (tree_treecmp(pp, ret, T_NAME,
ASSERTinfo(np1->t == T_NAME, ptree_nodetype2str(np1->t));
ASSERTinfo(np2->t == T_NAME, ptree_nodetype2str(np1->t));
case T_NAME:
case T_NAME:
case T_NAME:
ASSERT(ename->t == T_NAME);
ASSERT(np->t == T_NAME);
ASSERT(np->t == T_NAME);
struct node *ret = newnode(T_NAME, file, line);
ret = newnode(T_NAME, file, line);
if (np1->t != T_NAME)
if (np2->t != T_NAME)
if (np->t != T_NAME)
if (np->t != T_NAME)
ASSERTinfo(np1->t == T_NAME, ptree_nodetype2str(np1->t));
case T_NAME:
ASSERTeq(np->u.expr.left->t, T_NAME,
ASSERT(rhs->t == T_NAME);
case T_NAME: /* identifiers, sometimes chained */
case T_NAME: {
if (np1f->u.name.child->t == T_NAME &&
if (np1t->u.name.child->t == T_NAME &&
newnp = newnode(T_NAME, np->file, np->line);
newnp = newnode(T_NAME, np->file, np->line);
newnp = newnode(T_NAME, np->file, np->line);
newnp = newnode(T_NAME, np->file, np->line);
if (np->t == T_NAME)
T_NAME) {
T_NAME) {
case T_NAME:
if (np1->u.name.child->t == T_NAME &&
ASSERT(np->t == T_NAME);
ASSERT(np->t == T_NAME);
if (rhs->t != T_NAME || lhs->t != T_NAME) {
if (nodep->t != T_NAME) {
if (rhs->t != T_NAME || lhs->t != T_NAME) {
if (nodep->t != T_NAME) {
if (nodep->t != T_NAME) {
if (nodep->t != T_NAME) {
if (nodep->t != T_NAME) {
(valuep->v))->t == T_NAME) {
ASSERTeq(lhs->t, T_NAME, ptree_nodetype2str);
ASSERTeq(rhs->t, T_NAME, ptree_nodetype2str);
} else if (lhs->u.name.child && lhs->u.name.child->t == T_NAME) {
T_NAME) {
} else if (rhs->u.name.child && rhs->u.name.child->t == T_NAME) {
if (n == NULL || n->t != T_NAME)
np->u.event.ename = newnode(T_NAME, NULL, 0);
case T_NAME:
case T_NAME:
ASSERTinfo(np->t == T_NAME, ptree_nodetype2str(np->t));
ASSERTinfo(namep->t == T_NAME, ptree_nodetype2str(namep->t));
if (np1->u.name.child->t == T_NAME &&
case T_NAME:
case T_NAME:
case T_NAME:
struct node *newnp = newnode(T_NAME, file, line);
case T_NAME:
struct node *newnp = newnode(T_NAME, oldepname->file,
case T_NAME:
searchenamenode.t = T_NAME;
ASSERTeq(epname->t, T_NAME, ptree_nodetype2str);
else if (norknp->t == T_NAME && norknp->u.name.s == L_A)
ASSERT(np->u.name.child->t == T_NAME);
case T_NAME:
%token <token> T_NAME
| T_CODE_SET T_NAME T_NL
return (T_NAME);
%token <token> T_NAME
| T_CODE_SET T_NAME T_NL
copycat : T_COPY T_NAME T_NL
return (T_NAME);
case T_NAME:
token = T_NAME;
token = T_NAME;
token = T_NAME;
case T_NAME:
case T_NAME: