tailix
/
libclayer
mirror of https://github.com/tailix/libclayer.git
1
0
Fork 0
Code Releases Activity

Add tests

This commit is contained in:
Alex Kotov 2022-12-27 16:17:41 +04:00
parent 881f6ecb5b
commit 8197462089
Signed by: kotovalexarian
GPG Key ID: 553C0EBBEB5D5F08
1 changed files with 40 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

48
tests/string.c
View File

@ -3,19 +3,51 @@
#include <assert.h>
#include <stddef.h>
#define COUNT 1024
static char aaa[COUNT], bbb[COUNT];
#define memcmp LIBCLAYER(memcmp)
#define memcpy LIBCLAYER(memcpy)
#define memmove LIBCLAYER(memmove)
#define memchr LIBCLAYER(memchr)
#define memset LIBCLAYER(memset)
void test_main()
{
{
const size_t count = 1024;
char aaa[count];
char bbb[count];
for (size_t i = 0; i < count; ++i) aaa[i] = bbb[i] = i*i;
assert(LIBCLAYER(memcmp)(aaa, bbb, count) == 0);
{ // memcmp
for (size_t i = 0; i < COUNT; ++i) aaa[i] = bbb[i] = i * i;
assert(memcmp(aaa, bbb, COUNT) == 0);
aaa[123] = 1;
bbb[123] = 2;
assert(LIBCLAYER(memcmp)(aaa, bbb, count) == -1);
assert(memcmp(aaa, bbb, COUNT) == -1);
aaa[123] = 2;
bbb[123] = 1;
assert(LIBCLAYER(memcmp)(aaa, bbb, count) == 1);
assert(memcmp(aaa, bbb, COUNT) == 1);
}
{ // memcpy
for (size_t i = 0; i < COUNT; ++i) { aaa[i] = 0; bbb[i] = i * i; }
assert(memcpy(aaa, bbb, COUNT) == aaa);
for (size_t i = 0; i < COUNT; ++i) assert(aaa[i] == (char)(i * i));
}
{ // memmove
for (size_t i = 0; i < COUNT; ++i) { aaa[i] = 0; bbb[i] = i * i; }
assert(memcpy(aaa, bbb, COUNT) == aaa);
for (size_t i = 0; i < COUNT; ++i) assert(aaa[i] == (char)(i * i));
}
{ // memchr
for (size_t i = 0; i < COUNT; ++i) aaa[i] = 0;
aaa[256] = 'a';
assert(memchr(aaa, 'a', COUNT) == &aaa[256]);
}
{ // memset
memset(&aaa[0], 'a', COUNT / 2);
memset(&aaa[COUNT / 2], 'b', COUNT / 2);
for (size_t i = 0; i < COUNT / 2; ++i) assert(aaa[i] == 'a');
for (size_t i = COUNT / 2; i < COUNT; ++i) assert(aaa[i] == 'b');
}
}