RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-01-31 20:51:52 +01:00
Code Issues Projects Releases Wiki Activity

Add a comment about A[i+(j+1)].

Browse Source 
llvm-svn: 90185
This commit is contained in:
Dan Gohman 2009-12-01 01:38:10 +00:00
parent 8cd7f1260b
commit 6bb055cfcd
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
test/Analysis/ScalarEvolution/scev-aa.ll
View File

@ -2,7 +2,7 @@
; RUN: |& FileCheck %s
; At the time of this writing, -basicaa only misses the example of the form
; A[i+(j+1)] != A[i+j]. However, it does get A[(i+j)+1] != A[i+j].
; A[i+(j+1)] != A[i+j], which can arise from multi-dimensional array references.
target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64"