On Mon, Sep 26, 2016 at 8:15 PM, Richard Biener
<richard.guent...@gmail.com> wrote:
> On September 26, 2016 5:46:28 PM GMT+02:00, Bernd Edlinger 
> <bernd.edlin...@hotmail.de> wrote:
>>Hi,
>>
>>>@@ -2310,7 +2313,8 @@ create_intersect_range_checks_index
>>(loop_vec_info loop_vinfo, tree *cond_expr,
>>>   gcc_assert (TREE_CODE (DR_STEP (dr_a.dr)) == INTEGER_CST);
>>>
>>>   bool neg_step = tree_int_cst_compare (DR_STEP (dr_a.dr),
>>size_zero_node) < 0;
>>>-  unsigned HOST_WIDE_INT abs_step = tree_to_uhwi (DR_STEP (dr_a.dr));
>>>+  unsigned HOST_WIDE_INT abs_step =
>>>+    absu_hwi (tree_to_shwi (DR_STEP (dr_a.dr)));
>>>   if (neg_step)
>>>     abs_step = -abs_step;
>>
>>Hmmm...
>>
>>but you must remove the neg_step if you do this.
>
> The negation, yes.  Neg_step is used later as well.

Also the '=' in the split line goes to the next line according to
coding conventions.

Richard.

> Richard.
>
>>Right?
>>
>>
>>Bernd.
>
>

Reply via email to