| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| region-model-manager.cc | 665 tree cst1 = arg1->maybe_get_constant (); local
667 if (cst0 && cst1)
671 if (tree result = fold_binary (op, type, cst0, cst1))
677 if (tree result = int_const_binop (op, cst0, cst1, -1))
694 if (cst1 && zerop (cst1))
699 if (cst1 && zerop (cst1))
712 if (cst1
713 && zerop (cst1)
[all...] |
| svalue.cc | 57 static int cmp_csts_and_types (const_tree cst1, const_tree cst2);
293 if (tree cst1 = other->maybe_get_constant ())
294 if (zerop (cst1))
412 cmp_csts_same_type (const_tree cst1, const_tree cst2)
414 gcc_assert (TREE_TYPE (cst1) == TREE_TYPE (cst2));
415 gcc_assert (TREE_CODE (cst1) == TREE_CODE (cst2));
416 switch (TREE_CODE (cst1))
421 return tree_int_cst_compare (cst1, cst2);
423 return strcmp (TREE_STRING_POINTER (cst1),
427 return memcmp (TREE_REAL_CST_PTR (cst1),
498 const_tree cst1 = constant_sval1->get_constant (); local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| svalue.cc | 62 static int cmp_csts_and_types (const_tree cst1, const_tree cst2);
191 if (tree cst1 = other->maybe_get_constant ())
192 if (zerop (cst1))
309 cmp_csts_same_type (const_tree cst1, const_tree cst2)
311 gcc_assert (TREE_TYPE (cst1) == TREE_TYPE (cst2));
312 gcc_assert (TREE_CODE (cst1) == TREE_CODE (cst2));
313 switch (TREE_CODE (cst1))
318 return tree_int_cst_compare (cst1, cst2);
320 return strcmp (TREE_STRING_POINTER (cst1),
324 return memcmp (TREE_REAL_CST_PTR (cst1),
395 const_tree cst1 = constant_sval1->get_constant (); local
[all...] |
| region-model-manager.cc | 608 tree cst1 = arg1->maybe_get_constant (); local
610 if (cst0 && cst1)
612 if (tree result = fold_binary (op, type, cst0, cst1))
629 if (cst1 && zerop (cst1))
634 if (cst1 && zerop (cst1))
642 if (cst1 && zerop (cst1) && INTEGRAL_TYPE_P (type))
645 if (cst1 && integer_onep (cst1)
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| gimple-match-head.cc | 140 is an exact integer, arg1 = phi_res +/- cst1 and phi_res = PHI <cst2, ...>
141 where cst2 +/- cst1 is an exact integer, because then pow (arg0, arg1)
157 tree cst1 = NULL_TREE; local
176 cst1 = gimple_assign_rhs2 (def);
196 if (cst1 && cst2)
197 cst2 = const_binop (code, TREE_TYPE (cst2), cst2, cst1);
|
| tree-vrp.cc | 574 const bool cst1 = is_gimple_min_invariant (val1); local
579 if ((sym1 && inv1 && cst2) || (sym2 && inv2 && cst1))
592 tree cst = cst1 ? val1 : val2;
593 tree inv = cst1 ? inv2 : inv1;
603 return cst1 ? res : -res;
610 if (!cst1 || !cst2)
|
| tree-vect-patterns.cc | 5688 tree cst0, cst1, tmp; local
5702 cst1 = build_int_cst (type, 1);
5704 pattern_stmt = gimple_build_assign (tmp, COND_EXPR, var, cst1, cst0);
5773 tree cst0, cst1, new_vectype; local
5782 cst1 = build_int_cst (type, 1);
5786 pattern_stmt = gimple_build_assign (rhs, COND_EXPR, var, cst1, cst0);
|
| fold-const.cc | 11444 /* MEM[&MEM[p, CST1], CST2] -> MEM[p, CST1 + CST2]. */
11496 tree cst1 = TREE_OPERAND (arg1, 1);
11497 tree sum = fold_binary_loc (loc, PLUS_EXPR, TREE_TYPE (cst1),
11498 cst1, cst0);
12240 wi::tree_to_wide_ref cst1 = wi::to_wide (arg1);
12241 wide_int ncst1 = -cst1;
12242 if ((cst1 & ncst1) == ncst1
12248 /* Fold (X * CST1) & CST2 to zero if we can, or drop known zero
13098 wi::tree_to_wide_ref cst1 = wi::to_wide (arg1)
[all...] |
| match.pd | 2212 /* (x | CST1) & CST2 -> (x & CST2) | (CST1 & CST2) */
2233 (with { tree cst1 = const_binop (bitop, type, @0, @2); }
2234 (if (cst1)
2235 (bitop @1 { cst1; })
3127 /* Convert (X == CST1) && ((other)X OP2 CST2) to a known value
3128 based on CST1 OP2 CST2. Similarly for (X != CST1). */
3206 /* Convert (X OP1 CST1) && (X OP2 CST2).
3254 /* Convert (X == CST1) || (X OP2 CST2) to a known valu
[all...] |
| ipa-prop.cc | 6162 tree cst1 = ipa_get_jf_constant (jf1); local
6164 if (!values_equal_for_ipcp_p (cst1, cst2))
|
| /src/external/mit/isl/dist/ |
| isl_polynomial.c | 102 isl_poly_cst *cst1, *cst2; local
105 cst1 = isl_poly_as_cst(poly1);
107 if (!cst1 || !cst2)
109 cmp = isl_int_cmp(cst1->n, cst2->n);
112 return isl_int_cmp(cst1->d, cst2->d);
147 isl_poly_cst *cst1, *cst2; local
149 cst1 = isl_poly_as_cst(poly1);
151 if (!cst1 || !cst2)
153 r = isl_int_eq(cst1->n, cst2->n) &&
154 isl_int_eq(cst1->d, cst2->d)
856 isl_poly_cst *cst1; local
1189 isl_poly_cst *cst1; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| gimple-match-head.cc | 1225 is an exact integer, arg1 = phi_res +/- cst1 and phi_res = PHI <cst2, ...>
1226 where cst2 +/- cst1 is an exact integer, because then pow (arg0, arg1)
1242 tree cst1 = NULL_TREE; local
1261 cst1 = gimple_assign_rhs2 (def);
1281 if (cst1 && cst2)
1282 cst2 = const_binop (code, TREE_TYPE (cst2), cst2, cst1);
|
| tree-vrp.cc | 406 const bool cst1 = is_gimple_min_invariant (val1); local
411 if ((sym1 && inv1 && cst2) || (sym2 && inv2 && cst1))
424 tree cst = cst1 ? val1 : val2;
425 tree inv = cst1 ? inv2 : inv1;
435 return cst1 ? res : -res;
442 if (!cst1 || !cst2)
1580 /* In the case of NAME != CST1 where NAME = A +- CST2 we can
1581 assert that A != CST1 -+ CST2. */
|
| tree-vect-patterns.cc | 4419 tree cst0, cst1, tmp; local
4433 cst1 = build_int_cst (type, 1);
4435 pattern_stmt = gimple_build_assign (tmp, COND_EXPR, var, cst1, cst0);
4506 tree cst0, cst1, new_vectype; local
4515 cst1 = build_int_cst (type, 1);
4519 pattern_stmt = gimple_build_assign (rhs, COND_EXPR, var, cst1, cst0);
|
| fold-const.cc | 11019 /* MEM[&MEM[p, CST1], CST2] -> MEM[p, CST1 + CST2]. */
11071 tree cst1 = TREE_OPERAND (arg1, 1);
11072 tree sum = fold_binary_loc (loc, PLUS_EXPR, TREE_TYPE (cst1),
11073 cst1, cst0);
11798 wi::tree_to_wide_ref cst1 = wi::to_wide (arg1);
11799 wide_int ncst1 = -cst1;
11800 if ((cst1 & ncst1) == ncst1
11806 /* Fold (X * CST1) & CST2 to zero if we can, or drop known zero
12720 wi::tree_to_wide_ref cst1 = wi::to_wide (arg1)
[all...] |
| ipa-prop.cc | 6187 tree cst1 = ipa_get_jf_constant (jf1); local
6189 if (!values_equal_for_ipcp_p (cst1, cst2))
|
| match.pd | 1737 /* (x | CST1) & CST2 -> (x & CST2) | (CST1 & CST2) */
1758 (with { tree cst1 = const_binop (bitop, type, @0, @2); }
1759 (if (cst1)
1760 (bitop @1 { cst1; })
2398 /* Convert (X == CST1) && (X OP2 CST2) to a known value
2399 based on CST1 OP2 CST2. Similarly for (X != CST1). */
2425 /* Convert (X OP1 CST1) && (X OP2 CST2). */
2464 /* Convert (X == CST1) || (X OP2 CST2) to a known valu
[all...] |
| /src/external/gpl3/gcc/dist/gcc/config/i386/ |
| i386-expand.cc | 18216 rtx cst1, tmp; local
18228 cst1 = force_reg (XFmode, CONST1_RTX (XFmode));
18229 emit_insn (gen_addxf3 (e2, e1, cst1));
18263 rtx cst1; local
18269 cst1 = force_reg (XFmode, CONST1_RTX (XFmode));
18270 emit_insn (gen_divxf3 (e2, cst1, e1));
18334 rtx cst1, tmp; local
18340 cst1 = force_reg (XFmode, CONST1_RTX (XFmode));
18341 emit_insn (gen_addxf3 (e2, e1, cst1));
18343 emit_insn (gen_addxf3 (e2, e2, cst1));
18385 rtx cst1 = force_reg (XFmode, CONST1_RTX (XFmode)); local
18415 rtx cst1, tmp; local
18467 rtx cst, cstln2, cst1; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/config/i386/ |
| i386-expand.cc | 17118 rtx cst1, tmp; local
17130 cst1 = force_reg (XFmode, CONST1_RTX (XFmode));
17131 emit_insn (gen_addxf3 (e2, e1, cst1));
17165 rtx cst1; local
17171 cst1 = force_reg (XFmode, CONST1_RTX (XFmode));
17172 emit_insn (gen_divxf3 (e2, cst1, e1));
17236 rtx cst1, tmp; local
17242 cst1 = force_reg (XFmode, CONST1_RTX (XFmode));
17243 emit_insn (gen_addxf3 (e2, e1, cst1));
17245 emit_insn (gen_addxf3 (e2, e2, cst1));
17287 rtx cst1 = force_reg (XFmode, CONST1_RTX (XFmode)); local
17317 rtx cst1, tmp; local
17369 rtx cst, cstln2, cst1; local
[all...] |
| /src/external/gpl3/gcc/dist/gcc/config/sparc/ |
| sparc.cc | 11907 /* Multiply the VECTOR_CSTs CST0 and CST1 as specified by FNCODE and put
11912 tree inner_type, tree cst0, tree cst1)
11924 TREE_INT_CST_LOW (VECTOR_CST_ELT (cst1, i)));
11930 scale = TREE_INT_CST_LOW (VECTOR_CST_ELT (cst1, 0));
11942 scale = TREE_INT_CST_LOW (VECTOR_CST_ELT (cst1, 1));
|
| /src/external/gpl3/gcc.old/dist/gcc/config/sparc/ |
| sparc.cc | 11892 /* Multiply the VECTOR_CSTs CST0 and CST1 as specified by FNCODE and put
11897 tree inner_type, tree cst0, tree cst1)
11909 TREE_INT_CST_LOW (VECTOR_CST_ELT (cst1, i)));
11915 scale = TREE_INT_CST_LOW (VECTOR_CST_ELT (cst1, 0));
11927 scale = TREE_INT_CST_LOW (VECTOR_CST_ELT (cst1, 1));
|
