Displaying 1 result from an estimated 1 matches for "1000173".
Did you mean:
1000103
2008 Aug 22
5
[LLVMdev] Dependence Analysis [was: Flow-Sensitive AA]
>However, there is one issue I have ignored - possibility of overflow in
>the index expression. Suppose, we have such a loop:
> for (i8 i = 0; i != 200; ++i) {
> A[2 * i + 5] = ...
> ... = A[2 * i + 3]
> }
>If both index expressions are evaluated in 8-bit arithmetic,
>then the dependence equation should be solved in modular arithmetic:
> 2 * i + 5 == 2 * (i +