/* Copyright (C) 2002 Free Software Foundation.
|
/* Copyright (C) 2002 Free Software Foundation.
|
|
|
Test memcpy with various combinations of pointer alignments and lengths to
|
Test memcpy with various combinations of pointer alignments and lengths to
|
make sure any optimizations in the library are correct.
|
make sure any optimizations in the library are correct.
|
|
|
Written by Michael Meissner, March 9, 2002. */
|
Written by Michael Meissner, March 9, 2002. */
|
|
|
#include <string.h>
|
#include <string.h>
|
|
|
#ifndef MAX_OFFSET
|
#ifndef MAX_OFFSET
|
#define MAX_OFFSET (sizeof (long long))
|
#define MAX_OFFSET (sizeof (long long))
|
#endif
|
#endif
|
|
|
#ifndef MAX_COPY
|
#ifndef MAX_COPY
|
#define MAX_COPY (10 * sizeof (long long))
|
#define MAX_COPY (10 * sizeof (long long))
|
#endif
|
#endif
|
|
|
#ifndef MAX_EXTRA
|
#ifndef MAX_EXTRA
|
#define MAX_EXTRA (sizeof (long long))
|
#define MAX_EXTRA (sizeof (long long))
|
#endif
|
#endif
|
|
|
#define MAX_LENGTH (MAX_OFFSET + MAX_COPY + MAX_EXTRA)
|
#define MAX_LENGTH (MAX_OFFSET + MAX_COPY + MAX_EXTRA)
|
|
|
|
|
/* Use a sequence length that is not divisible by two, to make it more
|
/* Use a sequence length that is not divisible by two, to make it more
|
likely to detect when words are mixed up. */
|
likely to detect when words are mixed up. */
|
#define SEQUENCE_LENGTH 31
|
#define SEQUENCE_LENGTH 31
|
|
|
static union {
|
static union {
|
char buf[MAX_LENGTH];
|
char buf[MAX_LENGTH];
|
long long align_int;
|
long long align_int;
|
long double align_fp;
|
long double align_fp;
|
} u1, u2;
|
} u1, u2;
|
|
|
main ()
|
main ()
|
{
|
{
|
int off1, off2, len, i;
|
int off1, off2, len, i;
|
char *p, *q, c;
|
char *p, *q, c;
|
|
|
for (off1 = 0; off1 < MAX_OFFSET; off1++)
|
for (off1 = 0; off1 < MAX_OFFSET; off1++)
|
for (off2 = 0; off2 < MAX_OFFSET; off2++)
|
for (off2 = 0; off2 < MAX_OFFSET; off2++)
|
for (len = 1; len < MAX_COPY; len++)
|
for (len = 1; len < MAX_COPY; len++)
|
{
|
{
|
for (i = 0, c = 'A'; i < MAX_LENGTH; i++, c++)
|
for (i = 0, c = 'A'; i < MAX_LENGTH; i++, c++)
|
{
|
{
|
u1.buf[i] = 'a';
|
u1.buf[i] = 'a';
|
if (c >= 'A' + SEQUENCE_LENGTH)
|
if (c >= 'A' + SEQUENCE_LENGTH)
|
c = 'A';
|
c = 'A';
|
u2.buf[i] = c;
|
u2.buf[i] = c;
|
}
|
}
|
|
|
p = memcpy (u1.buf + off1, u2.buf + off2, len);
|
p = memcpy (u1.buf + off1, u2.buf + off2, len);
|
if (p != u1.buf + off1)
|
if (p != u1.buf + off1)
|
abort ();
|
abort ();
|
|
|
q = u1.buf;
|
q = u1.buf;
|
for (i = 0; i < off1; i++, q++)
|
for (i = 0; i < off1; i++, q++)
|
if (*q != 'a')
|
if (*q != 'a')
|
abort ();
|
abort ();
|
|
|
for (i = 0, c = 'A' + off2; i < len; i++, q++, c++)
|
for (i = 0, c = 'A' + off2; i < len; i++, q++, c++)
|
{
|
{
|
if (c >= 'A' + SEQUENCE_LENGTH)
|
if (c >= 'A' + SEQUENCE_LENGTH)
|
c = 'A';
|
c = 'A';
|
if (*q != c)
|
if (*q != c)
|
abort ();
|
abort ();
|
}
|
}
|
|
|
for (i = 0; i < MAX_EXTRA; i++, q++)
|
for (i = 0; i < MAX_EXTRA; i++, q++)
|
if (*q != 'a')
|
if (*q != 'a')
|
abort ();
|
abort ();
|
}
|
}
|
|
|
exit (0);
|
exit (0);
|
}
|
}
|
|
|
