forked from OSchip/llvm-project
113 lines
2.2 KiB
C
113 lines
2.2 KiB
C
/*
|
|
* memset test.
|
|
*
|
|
* Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
* See https://llvm.org/LICENSE.txt for license information.
|
|
* SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
*/
|
|
|
|
#include <stdint.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include "stringlib.h"
|
|
|
|
static const struct fun
|
|
{
|
|
const char *name;
|
|
void *(*fun)(void *s, int c, size_t n);
|
|
} funtab[] = {
|
|
#define F(x) {#x, x},
|
|
F(memset)
|
|
#if __aarch64__
|
|
F(__memset_aarch64)
|
|
#elif __arm__
|
|
F(__memset_arm)
|
|
#endif
|
|
#undef F
|
|
{0, 0}
|
|
};
|
|
|
|
static int test_status;
|
|
#define ERR(...) (test_status=1, printf(__VA_ARGS__))
|
|
|
|
#define A 32
|
|
#define LEN 250000
|
|
static unsigned char sbuf[LEN+2*A];
|
|
|
|
static void *alignup(void *p)
|
|
{
|
|
return (void*)(((uintptr_t)p + A-1) & -A);
|
|
}
|
|
|
|
static void err(const char *name, unsigned char *src, int salign, int c, int len)
|
|
{
|
|
ERR("%s(align %d, %d, %d) failed\n", name, salign, c, len);
|
|
ERR("got : %.*s\n", salign+len+1, src);
|
|
}
|
|
|
|
static void test(const struct fun *fun, int salign, int c, int len)
|
|
{
|
|
unsigned char *src = alignup(sbuf);
|
|
unsigned char *s = src + salign;
|
|
void *p;
|
|
int i;
|
|
|
|
if (len > LEN || salign >= A)
|
|
abort();
|
|
for (i = 0; i < len+A; i++)
|
|
src[i] = '?';
|
|
for (i = 0; i < len; i++)
|
|
s[i] = 'a' + i%23;
|
|
for (; i<len%A; i++)
|
|
s[i] = '*';
|
|
|
|
p = fun->fun(s, c, len);
|
|
if (p != s)
|
|
ERR("%s(%p,..) returned %p\n", fun->name, s, p);
|
|
|
|
for (i = 0; i < salign; i++) {
|
|
if (src[i] != '?') {
|
|
err(fun->name, src, salign, c, len);
|
|
return;
|
|
}
|
|
}
|
|
for (i = salign; i < len; i++) {
|
|
if (src[i] != (unsigned char)c) {
|
|
err(fun->name, src, salign, c, len);
|
|
return;
|
|
}
|
|
}
|
|
for (; i < len%A; i++) {
|
|
if (src[i] != '*') {
|
|
err(fun->name, src, salign, c, len);
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
|
|
int main()
|
|
{
|
|
int r = 0;
|
|
for (int i=0; funtab[i].name; i++) {
|
|
test_status = 0;
|
|
for (int s = 0; s < A; s++) {
|
|
int n;
|
|
for (n = 0; n < 100; n++) {
|
|
test(funtab+i, s, 0, n);
|
|
test(funtab+i, s, 0x25, n);
|
|
test(funtab+i, s, 0xaa25, n);
|
|
}
|
|
for (; n < LEN; n *= 2) {
|
|
test(funtab+i, s, 0, n);
|
|
test(funtab+i, s, 0x25, n);
|
|
test(funtab+i, s, 0xaa25, n);
|
|
}
|
|
}
|
|
printf("%s %s\n", test_status ? "FAIL" : "PASS", funtab[i].name);
|
|
if (test_status)
|
|
r = -1;
|
|
}
|
|
return r;
|
|
}
|