Searched refs:T_AND (Results 1 - 13 of 13) sorted by relevance

/opensolaris-onvv-gate/usr/src/lib/libast/common/regex/
H A Dreginit.c141 '&', T_AND, T_BAD,
142 T_AND, '&', T_BAD,
144 T_AND, '&', T_BAD,
H A Dreglib.h148 #define T_AND (T_OPEN+11) macro
H A Dregcomp.c841 if (c == T_AND)
2652 case T_AND:
2823 if (!(e = seq(env)) || !(env->flags & REG_AUGMENTED) || token(env) != T_AND)
/opensolaris-onvv-gate/usr/src/cmd/fm/modules/common/eversholt/
H A Diexpr.c96 case T_AND:
176 case T_AND:
H A Deval.c938 * defines for u.expr.temp - these are used for T_OR and T_AND so that if
984 case T_AND:
1240 * a T_AND node at the top of *newc.
1273 *newc = tree_expr(T_AND, *newc, newnp);
1722 case T_AND:
H A Deft_mdb.c551 case T_AND: /* boolean && operator */
H A Dplatform.c1147 case T_AND:
/opensolaris-onvv-gate/usr/src/cmd/fm/eversholt/common/
H A Dliterals.h193 L_DECL(T_AND); variable
H A Dtree.h59 T_AND, /* boolean && operator */ enumerator in enum:node::nodetype
H A Descparse.y290 { $$ = tree_expr(T_AND, $1, $3); }
H A Dptree.c189 case T_AND:
510 case T_AND: return L_T_AND;
639 np->t == T_AND ||
H A Dtree.c243 case T_AND:
348 case T_AND:
834 case T_AND:
H A Dcheck.c650 case T_AND:

Completed in 94 milliseconds