/* This revealed a bug when rotates are expanded into
|
/* This revealed a bug when rotates are expanded into
|
two shifts. */
|
two shifts. */
|
|
|
/* { dg-do run } */
|
/* { dg-do run } */
|
/* { dg-options "-O1 -std=c99" } */
|
/* { dg-options "-O1 -std=c99" } */
|
|
|
#include <stdlib.h>
|
#include <stdlib.h>
|
|
|
#if __INT_MAX__ == 2147483647
|
#if __INT_MAX__ == 2147483647
|
typedef unsigned int uint32_t;
|
typedef unsigned int uint32_t;
|
#elif __LONG_MAX__ == 2147483647
|
#elif __LONG_MAX__ == 2147483647
|
typedef unsigned long uint32_t;
|
typedef unsigned long uint32_t;
|
#else
|
#else
|
#error unable to find 32-bit integer type
|
#error unable to find 32-bit integer type
|
#endif
|
#endif
|
|
|
uint32_t
|
uint32_t
|
f (uint32_t *S, int j)
|
f (uint32_t *S, int j)
|
{
|
{
|
uint32_t A, B, k, L[2] = {1234, 5678};
|
uint32_t A, B, k, L[2] = {1234, 5678};
|
int i, m;
|
int i, m;
|
|
|
A = B = 0;
|
A = B = 0;
|
for (i = 0; i < j; i++)
|
for (i = 0; i < j; i++)
|
{
|
{
|
k = (S[i] + A + B) & 0xffffffffL;
|
k = (S[i] + A + B) & 0xffffffffL;
|
A = S[i] =
|
A = S[i] =
|
((k << (3 & 0x1f)) | ((k & 0xffffffff) >> (32 - (3 & 0x1f))));
|
((k << (3 & 0x1f)) | ((k & 0xffffffff) >> (32 - (3 & 0x1f))));
|
|
|
m = (int) (A + B);
|
m = (int) (A + B);
|
k = (L[i] + A + B) & 0xffffffffL;
|
k = (L[i] + A + B) & 0xffffffffL;
|
B = L[i] =
|
B = L[i] =
|
((k << (m & 0x1f)) | ((k & 0xffffffff) >> (32 - (m & 0x1f))));
|
((k << (m & 0x1f)) | ((k & 0xffffffff) >> (32 - (m & 0x1f))));
|
}
|
}
|
return L[0] + L[1];
|
return L[0] + L[1];
|
}
|
}
|
|
|
int
|
int
|
main ()
|
main ()
|
{
|
{
|
uint32_t S[2] = {0xffff, 0xffffff};
|
uint32_t S[2] = {0xffff, 0xffffff};
|
|
|
if (f (S,2)!= 1392607300)
|
if (f (S,2)!= 1392607300)
|
abort();
|
abort();
|
|
|
return 0;
|
return 0;
|
}
|
}
|
|
|
