Home
last modified time | relevance | path

Searched refs:T_AND (Results 1 – 16 of 16) sorted by relevance

/titanic_51/usr/src/contrib/ast/src/lib/libast/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.c850 if (c == T_AND) in magic()
2703 case T_AND: in seq()
2874 if (!(e = seq(env)) || !(env->flags & REG_AUGMENTED) || token(env) != T_AND) in con()
/titanic_51/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) in magic()
2652 case T_AND: in seq()
2823 if (!(e = seq(env)) || !(env->flags & REG_AUGMENTED) || token(env) != T_AND) in con()
/titanic_51/usr/src/cmd/fm/modules/common/eversholt/
H A Diexpr.c96 case T_AND: in iexpr_hash()
176 case T_AND: in iexpr_cmp()
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: in eval_dup()
1240 * a T_AND node at the top of *newc.
1273 *newc = tree_expr(T_AND, *newc, newnp); in eval_potential()
1722 case T_AND: in eval_expr()
H A Deft_mdb.c551 case T_AND: /* boolean && operator */ in eft_node()
H A Dplatform.c1147 case T_AND: in arglist2argv()
/titanic_51/usr/src/cmd/fm/eversholt/common/
H A Dliterals.h193 L_DECL(T_AND);
H A Dtree.h59 T_AND, /* boolean && operator */ enumerator
H A Dptree.c189 case T_AND: in ptree()
510 case T_AND: return L_T_AND; in ptree_nodetype2str()
639 np->t == T_AND || in name_pattern_match_in_subtree()
H A Descparse.y290 { $$ = tree_expr(T_AND, $1, $3); }
H A Dtree.c243 case T_AND: in tree_free()
348 case T_AND: in tree_treecmp()
834 case T_AND: in make_explicit()
H A Dcheck.c650 case T_AND: in check_exprscope()