Searched refs:cst2 (Results 1 - 5 of 5) sorted by relevance
| /haiku-buildtools/gcc/gcc/ |
| H A D | double-int.h | 192 bool operator == (double_int cst2) const;
193 bool operator != (double_int cst2) const;
411 double_int::operator == (double_int cst2) const
413 return low == cst2.low && high == cst2.high;
419 double_int::operator != (double_int cst2) const
421 return low != cst2.low || high != cst2.high;
|
| H A D | tree-vrp.c | 5244 tree cst2 = NULL_TREE, name2 = NULL_TREE, name3 = NULL_TREE; local
5251 cst2 = gimple_assign_rhs2 (def_stmt);
5253 && TREE_CODE (cst2) == INTEGER_CST)
5270 && (cst2 == NULL_TREE
5271 || TREE_CODE (cst2) == INTEGER_CST)
5280 if (cst2 != NULL_TREE)
5281 tmp = build2 (PLUS_EXPR, TREE_TYPE (name), tmp, cst2);
5298 && TREE_CODE (cst2) == INTEGER_CST
5309 if (cst2 != NULL_TREE)
5310 tmp = build2 (PLUS_EXPR, TREE_TYPE (name), tmp, cst2);
5367 tree name2 = NULL_TREE, names[2], cst2 = NULL_TREE; local
[all...] |
| H A D | tree-vect-generic.c | 519 tree cst2 = VECTOR_CST_ELT (op1, j); local
523 if (!tree_fits_uhwi_p (cst2))
525 d2 = tree_to_uhwi (cst2) & mask;
|
| /haiku-buildtools/isl/ |
| H A D | isl_polynomial.c | 81 struct isl_upoly_cst *cst1, *cst2; local
83 cst2 = isl_upoly_as_cst(up2);
84 if (!cst1 || !cst2)
86 return isl_int_eq(cst1->n, cst2->n) &&
87 isl_int_eq(cst1->d, cst2->d);
567 struct isl_upoly_cst *cst2; local
574 cst2 = isl_upoly_as_cst(up2);
576 if (isl_int_eq(cst1->d, cst2->d))
577 isl_int_add(cst1->n, cst1->n, cst2->n);
579 isl_int_mul(cst1->n, cst1->n, cst2
863 struct isl_upoly_cst *cst2; local
2961 isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1, __isl_keep struct isl_upoly_cst *cst2) argument
2977 struct isl_upoly_cst *cst1, *cst2; local
2996 struct isl_upoly_cst *cst1, *cst2; local
3023 struct isl_upoly_cst *cst1, *cst2; local
[all...] |
| /haiku-buildtools/gcc/gcc/config/rs6000/ |
| H A D | rs6000.c | 5572 int cst, cst2;
5627 cst2 = INTVAL (CONST_VECTOR_ELT (vec, 1));
5630 if (cst == cst2)
5559 int cst, cst2; local
[all...] |
Completed in 185 milliseconds