Home
last modified time | relevance | path

Searched refs:T_NUM (Results 1 – 17 of 17) sorted by relevance

/titanic_41/usr/src/lib/libcmd/common/
H A Dexpr.c121 #define T_NUM 1 macro
141 #define numeric(np) ((np)->type&T_NUM)
208 np->type = T_NUM; in getnode()
218 np->type = T_NUM; in getnode()
280 np->type |= T_NUM; in getnode()
311 np->type = T_NUM; in expr_cond()
325 np->type |= T_NUM; in expr_cond()
369 np->type = T_NUM; in expr_mult()
389 np->type = T_NUM; in expr_add()
457 np->type = T_NUM; in expr_cmp()
[all …]
/titanic_41/usr/src/cmd/fm/eversholt/common/
H A Dcheck.c207 if (np->t == T_NUM) in check_nork()
248 if (np->t != T_NUM) in check_num()
283 if (np->t != T_NUM && np->t != T_FUNC) in check_num_func()
439 case T_NUM: in check_stmt_allowed_properties()
678 case T_NUM: in check_exprscope()
922 if (np->u.name.child->t != T_NUM && in check_name_iterator()
950 np->u.name.child->t != T_NUM) { in check_type_iterator()
984 case T_NUM: in check_func()
1005 if (arglist->u.expr.left->t != T_NUM && in check_func()
1016 if (arglist->u.expr.right->t != T_NUM && in check_func()
[all …]
H A Dliterals.h185 L_DECL(T_NUM);
H A Dtree.h51 T_NUM, /* num (ull internally) */ enumerator
H A Dtree.c170 case T_NUM: in nodesize()
305 case T_NUM: in tree_free()
431 case T_NUM: in tree_treecmp()
743 struct node *ret = newnode(T_NUM, file, line); in tree_num()
H A Dptree.c143 case T_NUM: in ptree()
502 case T_NUM: return L_T_NUM; in ptree_nodetype2str()
/titanic_41/usr/src/lib/libc/port/i18n/
H A Dplural_parser.c182 if (type == T_NUM) in setop1()
351 ret = T_NUM; in gettoken()
667 if ((type == T_NUM) || (type == T_VAR)) { in plural_expr()
668 exp = setop1(op, type == T_NUM ? num : 0, stk, flag); in plural_expr()
866 if (type == T_NUM) { in plural_eval()
H A Dplural_parser.h47 #define T_NUM 0x00000003 macro
H A Dgettext_util.c544 case T_NUM: in printexpr()
/titanic_41/usr/src/cmd/fm/modules/common/eversholt/
H A Diexpr.c122 case T_NUM: in iexpr_hash()
211 case T_NUM: in iexpr_cmp()
H A Deval.c81 if (lhs->u.name.child && lhs->u.name.child->t == T_NUM) { in begins_with()
94 if (rhs->u.name.child && rhs->u.name.child->t == T_NUM) { in begins_with()
1027 if (np1f->u.name.child->t == T_NUM && in eval_dup()
1044 if (np1t->u.name.child->t == T_NUM && in eval_dup()
1081 newnode(T_NUM, np->file, np->line); in eval_dup()
1106 newnode(T_NUM, np->file, np->line); in eval_dup()
1129 newnp = newnode(T_NUM, np->file, np->line); in eval_dup()
1149 newnode(T_NUM, np->file, np->line); in eval_dup()
1190 case T_NUM: in eval_dup()
1191 newnp = newnode(T_NUM, np->file, np->line); in eval_dup()
[all …]
H A Ditree.c233 case T_NUM: in tname_dup()
235 newnode(T_NUM, file, line); in tname_dup()
334 newnp->u.name.child = newnode(T_NUM, oldepname->file, in tname_dup_to_epname()
338 npref->u.name.child->t != T_NUM) { in tname_dup_to_epname()
398 case T_NUM: in nv_instantiate()
399 nrhs = newnode(T_NUM, orhs->file, orhs->line); in nv_instantiate()
581 cpnode->u.name.child = newnode(T_NUM, NULL, 0); in hmatch_full_config()
832 else if (norknp->t == T_NUM) in itree_np2nork()
905 cpnode->u.name.child = newnode(T_NUM, NULL, 0); in vmatch_event()
962 np->u.name.child->t == T_NUM) { in vmatch_event()
[all …]
H A Dipath.c119 np->u.name.child->t == T_NUM) in ipath_epnamecmp()
259 namep->u.name.child->t == T_NUM) in ipath()
H A Dconfig.c221 ASSERT(rhs->u.name.child->t == T_NUM); in addconfig()
556 numn = newnode(T_NUM, NULL, 0); in config_nodeize()
H A Deft_mdb.c492 case T_NUM: /* num (ull internally) */ in eft_node()
H A Dplatform.c1184 case T_NUM: in arglist2argv()
H A Dfme.c1233 ASSERT(nN->t == T_NUM); in serd_eval()
1983 if (nc->u.name.child == NULL || nc->u.name.child->t != T_NUM) in node2fmri()