HomeSort by: relevance | last modified time | path
    Searched defs:neg_step (Results 1 - 2 of 2) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
tree-data-ref.cc 2138 bool neg_step = tree_int_cst_compare (DR_STEP (dr_a.dr), size_zero_node) < 0;
2140 if (neg_step)
2205 gcc_assert (!neg_step || tree_int_cst_sign_bit (idx_step) == 1);
2220 if (neg_step)
2326 poly_offset_int low_offset1 = neg_step ? -idx_len1 : 0;
2327 poly_offset_int high_offset2 = neg_step || waw_or_war_p ? 0 : idx_len2;
2396 tree neg_step = fold_build2 (LT_EXPR, boolean_type_node,
2484 tree low_offset_a = fold_build3 (COND_EXPR, sizetype, neg_step,
2489 /* We could use COND_EXPR <neg_step, size_zero_node, seg_len_a_minus_step>,
2577 tree neg_step = fold_build2 (LT_EXPR, boolean_type_node
2137 bool neg_step = tree_int_cst_compare (DR_STEP (dr_a.dr), size_zero_node) < 0; local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-data-ref.cc 2125 bool neg_step = tree_int_cst_compare (DR_STEP (dr_a.dr), size_zero_node) < 0;
2127 if (neg_step)
2192 gcc_assert (!neg_step || tree_int_cst_sign_bit (idx_step) == 1);
2207 if (neg_step)
2313 poly_offset_int low_offset1 = neg_step ? -idx_len1 : 0;
2314 poly_offset_int high_offset2 = neg_step || waw_or_war_p ? 0 : idx_len2;
2383 tree neg_step = fold_build2 (LT_EXPR, boolean_type_node,
2471 tree low_offset_a = fold_build3 (COND_EXPR, sizetype, neg_step,
2476 /* We could use COND_EXPR <neg_step, size_zero_node, seg_len_a_minus_step>,
2564 tree neg_step = fold_build2 (LT_EXPR, boolean_type_node
2124 bool neg_step = tree_int_cst_compare (DR_STEP (dr_a.dr), size_zero_node) < 0; local
    [all...]

Completed in 48 milliseconds