diff options
author | Frank Ch. Eigler <fche@redhat.com> | 2004-10-03 21:17:29 +0000 |
---|---|---|
committer | Frank Ch. Eigler <fche@redhat.com> | 2004-10-03 21:17:29 +0000 |
commit | 6abd7fa1c77cd9620d0fd62fe78236b4e2c1ef25 (patch) | |
tree | 290760cbad801c6cac12846ce38486866a926da9 | |
parent | 541b5fcc48d66bc1a101504dae360a1eddc94ee6 (diff) |
* fixing typos in accidental checkin
git-svn-id: https://gcc.gnu.org/svn/gcc/trunk@88463 138bc75d-0d04-0410-961f-82ee72b054a4
-rw-r--r-- | libmudflap/testsuite/libmudflap.c/fail33-frag.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/libmudflap/testsuite/libmudflap.c/fail33-frag.c b/libmudflap/testsuite/libmudflap.c/fail33-frag.c index 5f33be7a852..ac7c617a4eb 100644 --- a/libmudflap/testsuite/libmudflap.c/fail33-frag.c +++ b/libmudflap/testsuite/libmudflap.c/fail33-frag.c @@ -7,14 +7,14 @@ char a[SIZE]; int main () { - int i, j=0; + int i, j=0, k; int a_before_b = (& a[0] < & b[0]); /* Rather than iterating linearly, which would allow loop unrolling and mapping to pointer manipulation, we traverse the "joined" arrays in some random order. */ for (i=0; i<SIZE*2; i++) { - k=rand()%(SIZE*2)) + k = rand() % (SIZE*2); j += (a_before_b ? a[k] : b[k]); } return j; |