Searched refs:integer_onep (Results 1 - 19 of 19) sorted by last modified time
/freebsd-11-stable/contrib/gcc/ |
H A D | dojump.c | 216 if (integer_onep (TREE_OPERAND (exp, 1))) 232 && integer_onep (TREE_OPERAND (exp0, 1)))
|
H A D | dwarf2out.c | 10712 || (is_fortran () && integer_onep (bound)))))
|
H A D | expr.c | 8661 && integer_onep (DECL_SIZE (TREE_OPERAND (lhs, 1))) 8662 && integer_onep (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs, 1), 1)))) 9130 if (integer_onep (arg1)) 9148 if (integer_onep (arg1))
|
H A D | fold-const.c | 1296 || integer_onep (tem))) 1910 else if (code == MULT_EXPR && integer_onep (arg0)) 3328 if (!integer_onep (TREE_OPERAND (arg, 1))) 4228 in_p = in_p == (integer_onep (range_binop (GE_EXPR, integer_type_node, 4230 && integer_onep (range_binop (LE_EXPR, integer_type_node, 4296 if (integer_onep (low) && TREE_CODE (high) == INTEGER_CST) 4426 || integer_onep (range_binop (EQ_EXPR, integer_type_node, 4429 || integer_onep (range_binop (EQ_EXPR, integer_type_node, 4434 if (integer_onep (range_binop (GT_EXPR, integer_type_node, 4437 && integer_onep (range_bino [all...] |
H A D | predict.c | 1124 || integer_onep (TREE_OPERAND (cond, 1)) 1135 || integer_onep (TREE_OPERAND (cond, 1)) 1179 && (!integer_zerop (val) && !integer_onep (val)))
|
H A D | stor-layout.c | 1737 || integer_onep (TYPE_MAX_VALUE (element))) 1771 if (TYPE_SIZE_UNIT (element) != 0 && ! integer_onep (element_size))
|
H A D | tree-cfg.c | 441 onep = integer_onep (cond);
|
H A D | tree-chrec.c | 376 if (integer_onep (op1)) 388 if (integer_onep (op0)) 403 if (integer_onep (op1))
|
H A D | tree-ssa-address.c | 180 if (addr->step && !integer_onep (addr->step)) 324 if (addr->step && integer_onep (addr->step)) 583 if (parts.step && !integer_onep (parts.step)) 675 gcc_assert (!parts.step || integer_onep (parts.step));
|
H A D | tree-ssa-forwprop.c | 259 || integer_onep (TREE_OPERAND (cond, 1))) 299 && integer_onep (TREE_OPERAND (cond, 1)))) 336 && integer_onep (TREE_OPERAND (cond, 1)))) 388 && integer_onep (TREE_OPERAND (cond, 1))))
|
H A D | tree-ssa-loop-niter.c | 166 if (integer_onep (s)) 435 if ((iv0->step && integer_onep (iv0->step) 1128 if (integer_onep (niter->assumptions)) 1149 && (integer_onep (iv1.step) || integer_all_onesp (iv1.step))) 1151 && (integer_onep (iv0.step) || integer_all_onesp (iv0.step))))
|
H A D | tree-ssa-phiopt.c | 388 if ((integer_zerop (arg0) && integer_onep (arg1)) 389 || (integer_zerop (arg1) && integer_onep (arg0))) 468 if ((e0 == true_edge && integer_onep (arg0)) 470 || (e1 == true_edge && integer_onep (arg1))
|
H A D | tree-ssa-reassoc.c | 697 else if (integer_onep (oelast->op))
|
H A D | tree-tailcall.c | 557 if (integer_onep (a))
|
H A D | tree-vrp.c | 1731 && integer_onep (vr0.min) 1732 && integer_onep (vr0.max)) 1734 && integer_onep (vr1.min) 1735 && integer_onep (vr1.max)))) 4927 && integer_onep (val) 4943 if (val && integer_onep (val)) 4998 else if (integer_onep (val)) 5004 && (integer_onep (val) || integer_zerop (val))) 5022 if (integer_onep (val))
|
H A D | tree.c | 1290 integer_onep (tree expr) 1298 && integer_onep (TREE_REALPART (expr)) 1285 integer_onep (tree expr) function
|
H A D | tree.h | 4087 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */ 4089 extern int integer_onep (tree);
|
H A D | builtins.c | 3060 if (integer_onep (len)) 4715 && (integer_zerop (arg1) || integer_onep (arg1)))
|
/freebsd-11-stable/contrib/gcc/cp/ |
H A D | mangle.c | 2275 || integer_zerop (value) || integer_onep (value));
|
Completed in 531 milliseconds