| /src/external/gpl3/gcc/dist/gcc/ |
| gimple-range-edge.cc | 95 TYPE_PRECISION (TREE_TYPE (CASE_LOW (gimple_switch_label (sw, 1)))) !=
139 wide_int low = wi::to_wide (CASE_LOW (gimple_switch_label (sw, x)));
|
| sancov.cc | 158 tree low_case = CASE_LOW (label);
195 tree low_case = CASE_LOW (label);
|
| tree-vrp.cc | 799 /* Cache the result of comparing CASE_LOW and val. */
800 cmp = tree_int_cst_compare (CASE_LOW (t), val);
861 high = CASE_LOW (gimple_switch_label (stmt, i));
866 low = CASE_LOW (gimple_switch_label (stmt, k));
906 = CASE_HIGH (label) ? CASE_HIGH (label) : CASE_LOW (label);
907 wide_int wlow = wi::to_wide (CASE_LOW (label));
932 case_high = CASE_LOW (max_label);
933 int_range_max label_range (TREE_TYPE (CASE_LOW (min_label)),
934 wi::to_wide (CASE_LOW (min_label)),
|
| vr-values.cc | 489 tree case_low, case_high; local
517 case_low = CASE_LOW (gimple_switch_label (stmt, i));
519 if (tree_int_cst_compare (case_low, min) < 0)
1386 tree case_label_type = TREE_TYPE (CASE_LOW (min_label));
1394 if (tree_int_cst_compare (CASE_LOW (min_label), vr_min) < 0
1397 CASE_LOW (min_label) = vr_min;
1401 if (tree_int_cst_compare (CASE_LOW (max_label), vr_max) <= 0
1414 if (tree_int_cst_compare (CASE_LOW (min_label), vr_min) == 0
1417 CASE_LOW (min_label
[all...] |
| tree-ssa-uncprop.cc | 190 || !CASE_LOW (label)
206 tree x = fold_convert (TREE_TYPE (cond), CASE_LOW (node));
|
| stmt.cc | 924 minval = fold_convert (index_type, CASE_LOW (elt));
929 maxval = fold_convert (index_type, CASE_LOW (elt));
966 tree low = CASE_LOW (elt);
1095 tree maxval = CASE_LOW (dispatch_table.last ());
1104 high = CASE_LOW (elt);
1105 case_list.safe_push (simple_case_node (CASE_LOW (elt), high,
|
| tree-switch-conversion.cc | 87 /* The gimplifier has already sorted the cases by CASE_LOW and ensured there
100 m_range_min = CASE_LOW (min_case);
104 m_range_max = CASE_LOW (max_case);
111 if (wi::to_wide (last) + 1 != wi::to_wide (CASE_LOW (elt)))
116 last = CASE_HIGH (elt) ? CASE_HIGH (elt) : CASE_LOW (elt);
201 && ! tree_int_cst_equal (CASE_LOW (elt), CASE_HIGH (elt)))
374 gcc_assert (CASE_LOW (default_case) == NULL_TREE
419 while (tree_int_cst_lt (pos, CASE_LOW (cs)))
437 gcc_assert (tree_int_cst_equal (pos, CASE_LOW (cs)));
443 high = CASE_LOW (cs)
[all...] |
| gimple.cc | 3153 the CASE_LOW values of each case label. */
3162 if (!CASE_LOW (case1))
3164 else if (!CASE_LOW (case2))
3167 return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2));
3213 tree low = CASE_LOW (elt);
3285 CASE_LOW (elt) = low;
3319 && tree_int_cst_equal (CASE_LOW (labels[0]),
3324 high = CASE_LOW (labels[len - 1]);
3330 high = CASE_LOW (labels[i])
[all...] |
| gimple-if-to-switch.cc | 288 return tree_int_cst_compare (CASE_LOW (l1), CASE_LOW (l2));
|
| tree-dump.cc | 672 if (CASE_LOW (t))
674 dump_child ("low ", CASE_LOW (t));
|
| gimple-predicate-analysis.cc | 1848 if (!l || CASE_CHAIN (l) || !CASE_LOW (l))
1851 || operand_equal_p (CASE_LOW (l), CASE_HIGH (l)))
1855 one_pred.pred_rhs = CASE_LOW (l);
1869 one_pred.pred_rhs = CASE_LOW (l);
|
| tree-cfg.cc | 1843 : CASE_LOW (base_case);
1860 && wi::to_wide (CASE_LOW (merge_case)) == bhp1)
1864 ? CASE_HIGH (merge_case) : CASE_LOW (merge_case));
2577 /* Cache the result of comparing CASE_LOW and val. */
2578 cmp = tree_int_cst_compare (CASE_LOW (t), val);
4947 if (CASE_LOW (elt) != NULL_TREE
4967 if (! CASE_LOW (elt))
4974 && ! tree_int_cst_lt (CASE_LOW (elt), CASE_HIGH (elt)))
4983 elt_type = TREE_TYPE (CASE_LOW (elt));
4990 if (TREE_TYPE (CASE_LOW (elt)) != elt_typ
[all...] |
| ipa-icf-gimple.cc | 921 tree low1 = CASE_LOW (label1);
922 tree low2 = CASE_LOW (label2);
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| gimple-range-edge.cc | 96 TYPE_PRECISION (TREE_TYPE (CASE_LOW (gimple_switch_label (sw, 1)))) !=
140 tree low = CASE_LOW (gimple_switch_label (sw, x));
|
| sancov.cc | 158 tree low_case = CASE_LOW (label);
195 tree low_case = CASE_LOW (label);
|
| tree-ssa-uncprop.cc | 190 || !CASE_LOW (label)
206 tree x = fold_convert (TREE_TYPE (cond), CASE_LOW (node));
|
| stmt.cc | 926 minval = fold_convert (index_type, CASE_LOW (elt));
931 maxval = fold_convert (index_type, CASE_LOW (elt));
968 tree low = CASE_LOW (elt);
1097 tree maxval = CASE_LOW (dispatch_table.last ());
1106 high = CASE_LOW (elt);
1107 case_list.safe_push (simple_case_node (CASE_LOW (elt), high,
|
| gimple.cc | 3119 the CASE_LOW values of each case label. */
3128 if (!CASE_LOW (case1))
3130 else if (!CASE_LOW (case2))
3133 return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2));
3179 tree low = CASE_LOW (elt);
3251 CASE_LOW (elt) = low;
3285 && tree_int_cst_equal (CASE_LOW (labels[0]),
3290 high = CASE_LOW (labels[len - 1]);
3296 high = CASE_LOW (labels[i])
[all...] |
| tree-switch-conversion.cc | 86 /* The gimplifier has already sorted the cases by CASE_LOW and ensured there
99 m_range_min = CASE_LOW (min_case);
103 m_range_max = CASE_LOW (max_case);
110 if (wi::to_wide (last) + 1 != wi::to_wide (CASE_LOW (elt)))
115 last = CASE_HIGH (elt) ? CASE_HIGH (elt) : CASE_LOW (elt);
169 && ! tree_int_cst_equal (CASE_LOW (elt), CASE_HIGH (elt)))
347 gcc_assert (CASE_LOW (default_case) == NULL_TREE
392 while (tree_int_cst_lt (pos, CASE_LOW (cs)))
407 gcc_assert (tree_int_cst_equal (pos, CASE_LOW (cs)));
413 high = CASE_LOW (cs)
[all...] |
| tree-vrp.cc | 2361 /* Cache the result of comparing CASE_LOW and val. */
2362 cmp = tree_int_cst_compare (CASE_LOW (t), val);
2423 high = CASE_LOW (gimple_switch_label (stmt, i));
2428 low = CASE_LOW (gimple_switch_label (stmt, k));
2469 = CASE_HIGH (label) ? CASE_HIGH (label) : CASE_LOW (label);
2470 int_range_max label_range (CASE_LOW (label), case_high);
2493 case_high = CASE_LOW (max_label);
2494 int_range_max label_range (CASE_LOW (min_label), case_high);
2930 if (!CASE_LOW (ci1->expr))
2932 else if (!CASE_LOW (ci2->expr)
[all...] |
| vr-values.cc | 2530 tree case_low, case_high; local
2557 case_low = CASE_LOW (gimple_switch_label (stmt, i));
2559 if (tree_int_cst_compare (case_low, min) < 0)
3769 tree case_label_type = TREE_TYPE (CASE_LOW (min_label));
3777 if (tree_int_cst_compare (CASE_LOW (min_label), vr_min) < 0
3780 CASE_LOW (min_label) = vr_min;
3784 if (tree_int_cst_compare (CASE_LOW (max_label), vr_max) <= 0
3797 if (tree_int_cst_compare (CASE_LOW (min_label), vr_min) == 0
3800 CASE_LOW (min_label
[all...] |
| gimple-if-to-switch.cc | 284 return tree_int_cst_compare (CASE_LOW (l1), CASE_LOW (l2));
|
| tree-dump.cc | 672 if (CASE_LOW (t))
674 dump_child ("low ", CASE_LOW (t));
|
| tree-cfg.cc | 1761 : CASE_LOW (base_case);
1778 && wi::to_wide (CASE_LOW (merge_case)) == bhp1)
1782 ? CASE_HIGH (merge_case) : CASE_LOW (merge_case));
2501 /* Cache the result of comparing CASE_LOW and val. */
2502 cmp = tree_int_cst_compare (CASE_LOW (t), val);
4851 if (CASE_LOW (elt) != NULL_TREE
4871 if (! CASE_LOW (elt))
4878 && ! tree_int_cst_lt (CASE_LOW (elt), CASE_HIGH (elt)))
4887 elt_type = TREE_TYPE (CASE_LOW (elt));
4894 if (TREE_TYPE (CASE_LOW (elt)) != elt_typ
[all...] |
| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| supergraph.cc | 1142 tree lower_bound = CASE_LOW (case_label);
1169 tree lower_bound = CASE_LOW (case_label);
1207 if (CASE_LOW (case_label))
|
